A novel approach to combine the hierarchical and iterative techniques for solving capacitated location-routing problem

References

• Ahmed, A. K. M. F. , & Sun, J. U. (2016). An improved particle swarm optimization algorithm for the travelling salesman problem. Advanced Science Letters , 22 (11), 3318–3322.10.1166/asl.2016.7864
   Google Scholar
• Ahmed, A. K. M. F. , & Sun, J. U. (2018). Bilayer local search enhanced particle swarm optimization incorporated with a distinct decoding method for solving capacitated vehicle routing problem. Algorithms , 11 (3), 31.10.3390/a11030031
   Web of Science ®Google Scholar
• Ai, T. J. , & Kachitvichyanukul, V. (2009). A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research , 36 (5), 1693–1702.10.1016/j.cor.2008.04.003
   Web of Science ®Google Scholar
• Akhand, M. A. H. , Akter, S. , Rashid, M. A. , & Yaakob, S. B. (2015). Velocity tentative PSO: An optimal velocity implementation based particle swarm optimization to solve traveling salesman problem. Production Planning and Control , 42 (3), 221–232.
   Google Scholar
• Albareda-Sambola, M. , Díaz, J. A. , & Fernández, E. (2005). A compact model and tight bounds for a combined location-routing problem. Computers & Operations Research , 32 (3), 407–428.10.1016/S0305-0548(03)00245-4
   Web of Science ®Google Scholar
• Alumur, S. , & Kara, B. Y. (2008). Network hub location problems: The state of the art. European Journal of Operational Research , 190 (1), 1–21.10.1016/j.ejor.2007.06.008
   Web of Science ®Google Scholar
• Banks, A. , Vincent, J. , & Anyakoha, C. (2007). A review of particle swarm optimization. Part I: Background and development. Natural Computing , 6 (4), 467–484.10.1007/s11047-007-9049-5
   Google Scholar
• Banks, A. , Vincent, J. , & Anyakoha, C. (2008). A review of particle swarm optimization. Part II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Natural Computing , 7 (1), 109–124.10.1007/s11047-007-9050-z
   Google Scholar
• Barreto, S. , Ferreira, C. , Paixao, J. , & Santos, B. S. (2007). Using clustering analysis in a capacitated location-routing problem. European Journal of Operational Research , 179 (3), 968–977.10.1016/j.ejor.2005.06.074
   Web of Science ®Google Scholar
• Billionnet, A. , Elloumi, S. , & Djerbi, L. G. (2005). Designing radio-mobile access networks based on synchronous digital hierarchy rings. Computers & Operations Research , 32 (2), 379–394.10.1016/S0305-0548(03)00242-9
   Web of Science ®Google Scholar
• Bouhafs, L. , Hajjam, A. and Koukam, A. (2006). A combination of simulated annealing and ant colony system for the capacitated location-routing problem. In Knowledge-Based Intelligent Information and Engineering Systems Springer Berlin/Heidelberg, pp. 409–416.
   Google Scholar
• Branco, I. M. , & Coelho, J. D. (1990). The hamiltonian p-median problem. European Journal of Operational Research , 47 (1), 86–95.10.1016/0377-2217(90)90092-P
   Web of Science ®Google Scholar
• Bruns, A. , Klose, A. , & Stähly, P. (2000). Restructuring of Swiss parcel delivery services. OR Spectrum , 22 (2), 285–302.10.1007/s002910050106
   Google Scholar
• Chan, A. W. , & Hearn, D. W. (1977). A rectilinear distance round-trip location problem. Transportation Science , 11 (2), 107–123.10.1287/trsc.11.2.107
   Google Scholar
• Derbel, H. , Jarboui, B. , Hanafi, S. , & Chabchoub, H. (2012). Genetic algorithm with iterated local search for solving a location-routing problem. Expert Systems with Applications , 39 (3), 2865–2871.10.1016/j.eswa.2011.08.146
   Web of Science ®Google Scholar
• Drexl, M. , & Schneider, M. (2015). A survey of variants and extensions of the location-routing problem. European Journal of Operational Research , 241 (2), 283–308.10.1016/j.ejor.2014.08.030
   Web of Science ®Google Scholar
• Drezner, Z. (1982). Fast algorithms for the round trip location problem. Proceedings of the 6th IIE Transactions , 14 (4), 243–248.
   Google Scholar
• Drezner, Z. , & Wesolowsky, G. O. (1982). A trajectory approach to the round-trip location problem. Transportation Science , 16 (1), 56–66.10.1287/trsc.16.1.56
   Web of Science ®Google Scholar
• Duhamel, C. , Lacomme, P. , Prins, C. , & Prodhon, C. (2010). A GRASP × ELS approach for the capacitated location-routing problem. Computers & Operations Research , 37 (11), 1912–1923.10.1016/j.cor.2009.07.004
   Web of Science ®Google Scholar
• Eberhart, R. C. , & Kennedy, J. (1995). Particle swarm optimization, proceeding of IEEE International Conference on Neural Network. In Proceeding of IEEE International Conference on Neural Network. Perth, Australia , pp. 1942–1948.
   Google Scholar
• Karaoglan, I. , Altiparmak, F. , Kara, I. , & Dengiz, B. (2012). The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach. Omega , 40 (4), 465–477.10.1016/j.omega.2011.09.002
   Web of Science ®Google Scholar
• Kennedy, J. , & Eberhart, R. C. (1997). A discrete binary version of the particle swarm algorithm. In IEEE International Conference on Computational Cybernetics and Simulation: Systems, Man, and Cybernetics , pp. 4104–4108.
   Google Scholar
• Kolen, A. (1985). the round-trip p-center and covering problem on a tree. Transportation Science , 19 (3), 222–234.10.1287/trsc.19.3.222
   Web of Science ®Google Scholar
• Laporte, G. (1992). The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research , 59 (3), 345–358.10.1016/0377-2217(92)90192-C
   Web of Science ®Google Scholar
• Lin, C. K. Y. , Chow, C. K. , & Chen, A. (2002). A location-routing-loading problem for bill delivery services. Journal of the Korean Institute of Management Science , 43 (1), 5–25.
   Google Scholar
• Lin, S. , & Kernighan, B. W. (1973). An effective heuristic algorithm for the traveling-salesman problem. Operations Research , 21 (2), 498–516.10.1287/opre.21.2.498
   Web of Science ®Google Scholar
• Maranzana, F. E. (1964). On the location of supply points to minimize transport costs. OR , 261–270.10.2307/3007214
   Google Scholar
• Marinakis, Y. , & Marinaki, M. (2008). A particle swarm optimization algorithm with path relinking for the location routing problem. Journal of Mathematical Modelling and Algorithms , 7 (1), 59–78.10.1007/s10852-007-9073-6
   Google Scholar
• Melechovský, J. , Prins, C. , & Calvo, R. W. (2005). A metaheuristic to solve a location-routing problem with non-linear costs. Journal of Heuristics , 11 (5–6), 375–391.10.1007/s10732-005-3601-1
   Web of Science ®Google Scholar
• Min, H. (1996). Consolidation terminal location-allocation and consolidated routing problems. Journal of Business Logistics , 17 (2), 235–263.
   Google Scholar
• Nagy, G. , & Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research , 177 (2), 649–672.10.1016/j.ejor.2006.04.004
   Web of Science ®Google Scholar
• Nambiar, J. M. , Gelders, L. F. , & Van Wassenhove, L. N. (1981). A large scale location-allocation problem in the natural rubber industry. European Journal of Operational Research , 6 (2), 183–189.10.1016/0377-2217(81)90205-8
   Web of Science ®Google Scholar
• O’Kelly, M. E. 1986. The location of interacting hub facilities. Transportation Science , 20 (2), 92–106.10.1287/trsc.20.2.92
   Web of Science ®Google Scholar
• Or, I. , & Pierskalla, W. P. (1979). A transportation location-allocation model for regional blood banking. AIIE Transactions , 11 (2), 86–95.10.1080/05695557908974447
   Web of Science ®Google Scholar
• Perl, J. , & Daskin, M. S. (1985). A warehouse location-routing problem. Transportation Research Part B: Methodological , 19 (5), 381–396.10.1016/0191-2615(85)90052-9
   Web of Science ®Google Scholar
• Prins, C. , Prodhon, C. , & Calvo, R. W. (2004). Nouveaux algorithmes pour le problème de localisation et routage sous contraintes de capacité. In MOSIM , pp. 1115–1122.
   Google Scholar
• Prins, C. , Prodhon, C. , & Calvo, R. W. (2006a). A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem. In European Conference on Evolutionary Computation in Combinatorial Optimization , Springer, Berlin Heidelberg, pp. 183–194.
   Google Scholar
• Prins, C. , Prodhon, C. , & Calvo, R. W. (2006b). Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR: A Quarterly Journal of Operations Research , 4 (3), 221–238.10.1007/s10288-006-0001-9
   Google Scholar
• Prodhon, C. (2010, February 25). Classical instances for LRP. Retrieved December 15, 2017, from http://prodhonc.free.fr/Instances/instances_us.htm
   Google Scholar
• Prodhon, C. , & Prins, C. (2014). A survey of recent research on location-routing problems. European Journal of Operational Research , 238 (1), 1–17.10.1016/j.ejor.2014.01.005
   Web of Science ®Google Scholar
• Salhi, S. , & Fraser, M. (1996). An intergrated heuristic approach for the combined location vehicle fleet mix problem. Studies in Locational Analysis , 8 , 3–22.
   Google Scholar
• Salhi, S. , & Nagy, G. (2009). Local improvement in planar facility location using vehicle routing. Annals of Operations Research , 167 (1), 287–296.10.1007/s10479-007-0223-z
   Web of Science ®Google Scholar
• Salhi, S. , & Rand, G. K. (1989). The effect of ignoring routes when locating depots. International Journal of Systems Science , 39 (2), 150–156.
   Google Scholar
• Schwardt, M. , & Dethloff, J. (2005). Solving a continuous location-routing problem by use of a self-organizing map. International Journal of Physical Distribution & Logistics Management , 35 (6), 390–408.10.1108/09600030510611639
   Google Scholar
• Shi, Y. , & Eberhart, R. C. (1998). A modified particle swarm optimizer. In Proceedings of the IEEE International Conference on Evolutionary Computation, Anchorage, AK, USA , 4–9 May, pp. 69–73.
   Google Scholar
• Sun, J. U. (2013). A two-phase meta heuristic approach to the location-routing problem for transportation network planning. Applied Mechanics and Materials , (Trans Tech Publications), 361 , 1900–1905.10.4028/www.scientific.net/AMM.361-363
   Google Scholar
• Tan, Y. , Gao, H. M. , & Zeng, J. C. (2004). Particle swarm optimization for integer programming [J]. Systems Engineering-theory & Practice , 5 , 126–129.
   Google Scholar
• Ting, C. J. , & Chen, C. H. (2013). A multiple ant colony optimization algorithm for the capacitated location routing problem. International Journal of Production Economics , 141 (1), 34–44.10.1016/j.ijpe.2012.06.011
   Web of Science ®Google Scholar
• Vincent, F. Y. , Lin, S. W. , Lee, W. , & Ting, C. J. (2010). A simulated annealing heuristic for the capacitated location routing problem. Computers & Industrial Engineering , 58 (2), 288–299.
   Web of Science ®Google Scholar
• Wang, K. P. , Huang, L. , Zhou, C. G ., & Pang, W. (2003). Particle swarm optimization for traveling salesman problem. In IEEE International Conference on Machine Learning and Cybernetics , pp. 1583–1585.
   Google Scholar
• Watson-Gandy, C. D. T. , & Dohrn, P. J. (1973). Depot location with van salesmen—A practical approach. Omega , 1 (3), 321–329.10.1016/0305-0483(73)90108-4
   Google Scholar
• Wu, T. H. , Low, C. , & Bai, J. W. (2002). Heuristic solutions to multi-depot location-routing problems. Computers & Operations Research , 29 (10), 1393–1415.10.1016/S0305-0548(01)00038-7
   Web of Science ®Google Scholar