143
Views
4
CrossRef citations to date
0
Altmetric
Articles

Applying a hybrid particle swarm optimization_Tabu search algorithm to a facility location case in Jakarta

&
Pages 199-212 | Received 15 May 2016, Accepted 20 Sep 2016, Published online: 27 Oct 2016

References

  • Hinojosa Y, Puerto J, Fernández FR. A multiperiod two-echelon multicommodity capacitated plant location problem. Eur J Oper Res. 2000;123:271–291.10.1016/S0377-2217(99)00256-8
  • Heckmann, I, Nickel, S, Saldanha-da-Gama, F. The risk-aware multi-period capacitated plant location problem (CPLP-Risk). Int Conf Inf Syst Log Supp Chain. 2016.
  • Zhang Y, Snyder LV, Ralphs TK, Xue Z. The competitive facility location problem under disruption risks. Transp Res Part E Log Transp Rev. 2016;93:453–473.10.1016/j.tre.2016.07.002
  • Zeinal Hamadani A, Abouei Ardakan M, Rezvan T, Honarmandian MM. Location-allocation problem for intra-transportation system in a big company by using meta-heuristic algorithm. SocioEcon Plann Sci. 2013;47:309–317.10.1016/j.seps.2013.03.001
  • Farahani RZ, Hekmatfar M, Fahimnia B, Kazemzadeh N. Hierarchical facility location problem: models, classifications, techniques, and applications. Comput Ind Eng. 2013;68:104–117.
  • Aardal K. Reformulation of capacitated facility location problems: how redundant information can help. Ann Oper Res. 1998;82:289–308.10.1023/A:1018966804496
  • Chan Y, Mahan JM, Chrissis JW, Drake DA, Wang D. Hierarchical maximal-coverage location-allocation: case of generalized search-and-rescue. Comput Oper Res. 2008;35:1886–1904.10.1016/j.cor.2006.09.018
  • Şahin G, Süral H. A review of hierarchical facility location models. Comput Oper Res. 2007;34:2310–2331.10.1016/j.cor.2005.09.005
  • Obreque C, Marianov V, Ríos M. Optimal design of hierarchical networks with free main path extremes. Oper Res Lett. 2008;36:366–371.10.1016/j.orl.2007.10.007
  • Gendron B, Khuong PV, Semet F. A Lagrangian-based branch-and-bound algorithm for the two-level uncapacitated facility location problem with single-assignment constraints. Transp Sci. 2016.
  • Sevkli M, Mamedsaidov R, Camci F. A novel discrete particle swarm optimization for p-median problem. J King Saud Univ Eng Sci. 2014;26:11–19.10.1016/j.jksues.2012.09.002
  • Boffey B, Yates D, Galvão RD. An algorithm to locate perinatal facilities in the municipality of Rio de Janeiro. J Oper Res Soc. 2003;54:21–31.10.1057/palgrave.jors.2601485
  • Chardaire P, Lutton J-L, Sutter A. Upper and lower bounds for the two-level simple plant location problem. Ann Oper Res. 1999;86:117–140.10.1023/A:1018942415824
  • Aksen D, Aras N. A bilevel fixed charge location model for facilities under imminent attack. Comput Oper Res. 2012;39:1364–1381.10.1016/j.cor.2011.08.006
  • Engelbrecht AP. Fundamentals of computational swarm intelligence. Chicester: Wiley; 2006.
  • Ghaderi A, Jabalameli MS, Barzinpour F, Rahmaniani R. An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem. Networks Spat Eco. 2011;12:421–439.
  • Zhang X-F, Koshimura M, Fujita H, Hasegawa R. An efficient hybrid particle swarm optimization for the job shop scheduling problem. 2011 IEEE Int Conf Fuzzy Syst (FUZZ-IEEE 2011). 2011. p. 622–626.10.1109/FUZZY.2011.6007385
  • Zhihua C. A new stochastic particle swarm optimizer. Proc 2004 Cong Evol Comput (IEEE Cat. No.04TH8753). 2004. p. 316–319.10.1109/CEC.2004.1330873
  • Allahverdi A, Al-Anzi FS. A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application. Comput Oper Res. 2006;33:1056–1080.10.1016/j.cor.2004.09.002
  • Chiou C-W, Wu M-C. A GA-Tabu algorithm for scheduling in-line steppers in low-yield scenarios. Expert Syst Appl. 2009;36:11925–11933.10.1016/j.eswa.2009.03.064
  • Niknam T, Ranjbar AM Shirani, AR, Mozafari B, Ostadi A. Optimal operation of distribution system with regard to distributed generation: a comparison of evolutionary methods. In: IEEE Fourtieth IAS Annual Meeting. Conference record of the 2005 Industry Applications Conference. Vol. 4; 2005. p. 2690–2697.
  • Wang Y, Zhao Z, Ren R. Hybrid particle swarm optimizer with tabu strategy for global numerical optimization. 2007 IEEE Cong Evol Comput. 2007:2310–2316.10.1109/CEC.2007.4424759
  • Fang S, Zhang X. A hybrid algorithm of particle swarm optimization and Tabu search for distribution network reconfiguration. Math Prob Eng. 2016. Article ID: 7410293.
  • Sheu J-B, Lin AY-S. Hierarchical facility network planning model for global logistics network configurations. Appl Math Model. 2012;36:3053–3066.10.1016/j.apm.2011.09.095
  • Tcha D, Lee B. A branch-and-bound algorithm for the multi-level uncapacitated facility location problem. Eur J Oper Res. 1984;18:35–43.10.1016/0377-2217(84)90258-3
  • Ai TJ, Kachitvichyanukul V. A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Comput Oper Res. 2009;36:1693–1702.10.1016/j.cor.2008.04.003
  • Teixeira JC, Antunes AP. A hierarchical location model for public facility planning. Eur J Oper Res. 2008;185:92–104.10.1016/j.ejor.2006.12.027
  • Al-Saleh, MA, Mir, M, Hassanin, A. Comparison of enhanced constructive layout optimization technique with Tabu-search and Particle Swarm Optimization methodologies. In: 2015 IEEE International Conference on Industrial Engineering and Operations Management (IEOM), Dubai; 2015. p. 1–7.10.1109/IEOM.2015.7093781
  • Gao H, Kwong S, Fan B, Wang R. A hybrid particle-swarm tabu search algorithm for solving job shop scheduling problems. IEEE Trans Ind Inf. 2014;10:2044–2054.10.1109/TII.2014.2342378

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.