An improved particle swarm optimization algorithm for the capacitated location routing problem and for the location routing problem with stochastic demands

Applied Soft Computing Journal

Volumn 37, Issue , 2015, Pages 680-701

  Marinakis, Yannis ^a  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

Author keywords

Capacitated location routing problem; Combinatorial neighborhood topology; Expanding neighborhood topology; Global and local neighborhood topology; Location routing problem with stochastic demands; Particle swarm optimization

Indexed keywords

ALGORITHMS; BENCHMARKING; COMBINATORIAL MATHEMATICS; EVOLUTIONARY ALGORITHMS; LOCATION; OPTIMIZATION; STOCHASTIC SYSTEMS; TOPOLOGY;

CAPACITATED LOCATION; DISCRETE OPTIMIZATION PROBLEMS; IMPROVED PARTICLE SWARM OPTIMIZATION ALGORITHMS; LOCAL NEIGHBORHOODS; NATURE INSPIRED ALGORITHMS; NEIGHBORHOOD TOPOLOGY; PARTICLE SWARM OPTIMIZATION ALGORITHM; STOCHASTIC DEMAND;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 84942411043     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2015.09.005     Document Type: Article

References (108)

1. T.J. Ai, and V. Kachitvichyanukul A particle swarm optimization for vehicle routing problem with time windows Int. J. Oper. Res. 6 4 2009 519 537
2. T.J. Ai, and V. Kachitvichyanukul A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery Comput. Oper. Res. 36 2009 1693 1702
3. T.J. Ai, and V. Kachitvichyanukul Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem Comput. Ind. Eng. 56 2009 380 387
4. S. Alam, G. Dobbie, Y.S. Koh, P. Riddle, and S.U. Rehman Research on particle swarm optimization based clustering: a systematic review of literature and techniques Swarm Evolut. Comput. 17 2014 1 13
5. M. Albareda-Sambola, J.A. Diaz, and E. Fernandez A compact model and tight bounds for a combined location-routing problem Comput. Oper. Res. 32 3 2005 407 428
6. A. Banks, J. Vincent, and C. Anyakoha A review of particle swarm optimization. Part I: Background and development Nat. Comput. 6 4 2007 467 484
7. A. Banks, J. Vincent, and C. Anyakoha A review of particle swarm optimization. Part II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications Nat. Comput. 7 2008 109 124
8. S. Barreto, C. Ferreira, J. Paixao, and B.S. Santos Using clustering analysis in a capacitated location-routing problem Eur. J. Oper. Res. 179 3 2007 968 977
9. J.M. Belenguer, E. Benavent, C. Prins, C. Prodhon, and R. Wolfler-Calvo A branch-and-cut method for the capacitated location-routing problem Comput. Oper. Res. 38 2011 931 941
10. L. Bianchi, M. Birattari, M. Manfrin, M. Mastrolilli, L. Paquete, O. Rossi-Doria, and T. Schiavinotto Hybrid metaheuristics for the vehicle routing problem with stochastic demands J. Math. Model. Algorithms 5 1 2006 91 110
11. M.R. Bonyadi, X. Li, and Z. Michalewicz A hybrid particle swarm with a time-adaptive topology for constrained optimization Swarm Evolut. Comput. 18 2014 22 37
12. J.H. Bookbinder, and K.E. Reece Vehicle routing considerations in distribution system design Eur. J. Oper. Res. 37 1988 204 213
13. L. Bouhafs, A. Hajjam, and A. Koukam A combination of simulated annealing and ant colony system for the capacitated location-routing problem Knowl. Based Intell. Inf. Eng. Syst. LNCS 4251 2006 409 416
14. R. Caballero, M. González, F.M. Guerrero, J. Molina, and C. Paralera Solving a multiobjective location routing problem with a metaheuristic based on a tabu search. Application to a real case in Andalusia Eur. J. Oper. Res. 177 2007 1751 1763
15. P. Cappanera, G. Gallo, and F. Maffioli Discrete facility location and routing of obnoxious activities Discret. Appl. Math. 133 1-3 2003 3 28
16. Y. Chan, and S.F. Baker The multiple depot, multiple traveling salesmen facility-location problem: vehicle range, service frequency, and heuristic implementations Math. Comput. Model. 41 8-9 2005 1035 1053
17. A.-L. Chen, G.-K. Yang, and Z.-M. Wu Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem J. Zhejiang Univ. Sci. A 7 4 2006 607 614
18. W.C. Chiang, and R.A. Russell Integrating purchasing and routing in a propane gas supply chain Eur. J. Oper. Res. 154 3 2004 710 729
19. T.W. Chien Heuristic procedures for practical-sized uncapacitated location-capacitated routing problems Decis. Sci. 24 5 1993 995 1021
20. N. Christofides, and S. Eilon An algorithm for the vehicle dispatching problem Oper. Res. Q. 20 1969 309 318
21. M. Clerc, and J. Kennedy The particle swarm: explosion, stability and convergence in a multi-dimensional complex space IEEE Trans. Evolut. Comput. 6 2002 58 73
22. C. Contardo, J.F. Cordeau, and B. Gendron A GRASP + ILP-based metaheuristic for the capacitated location-routing problem J. Heuristics 20 2014 1 38
23. M. Daskin Network and Discrete Location. Models, Algorithms and Applications 1995 John Wiley and Sons New York
24. R. Dondo, and J. Cerda A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows Eur. J. Oper. Res. 176 3 2007 1478 1507
25. C. Duhamel, P. Lacomme, C. Prins, and C. Prodhon A memetic approach for the capacitated location routing problem EU/Meeting 2008 Troyes, France 2008
26. C. Duhamel, P. Lacomme, C. Prins, and C. Prodhon A GRASP × ELS approach for the capacitated location-routing problem Comput. Oper. Res. 37 2010 1912 1923
27. A.P. Engelbrecht Computational Intelligence: An Introduction 2nd ed. 2007 John Wiley and Sons England
28. R.L. Franchis, and J.A. White Facility Layout and Location. An Analytical Approach 1974 Prentice-Hall New Jersey
29. R.L. Franchis, L.F. McGinnis, and J.A. White Locational analysis Eur. J. Oper. Res. 12 3 1983 220 252
30. S. Ghosh, S. Das, D. Kundu, K. Suresh, and A. Abraham Inter-particle communication and search-dynamics of lbest particle swarm optimizers: an analysis Inf. Sci. 182 2012 156 168
31. B. Gillett, and J. Johnson Multi-terminal vehicle-dispatch algorithm Omega 4 6 1976 711 718
32. F. Glover, M. Laguna, and R. Marti Scatter search and path relinking: advances and applications F. Lover, G.A. Kochenberger, Handbook of Metaheuristics 2003 Kluwer Academic Publishers Boston 1 36
33. F.P. Goksal, I. Karaoglan, and F. Altiparmak A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery Comput. Ind. Eng. 65 2013 39 53
34. B.L. Golden, and A.A. Assad Vehicle Routing: Methods and Studies 1988 North Holland Amsterdam
35. Y.-J. Gong, J. Zhang, O. Liu, R.-Z. Huang, H.S.-H. Chung, and Y.-H. Shi Optimizing the vehicle routing problem with time windows: a discrete particle swarm optimization approach IEEE Trans. Syst. Man Cybern. C Appl. Rev. 42 2 2012 254 267
36. P. Hansen, and N. Mladenovic Variable neighborhood search: principles and applications Eur. J. Oper. Res. 130 2001 449 467
37. P.H. Hansen, B. Hegedahl, S. Hjortkajaer, and B. Obel A heuristic solution to the warehouse location-routing problem Eur. J. Oper. Res. 76 1994 111 127
38. X. Hu, and R.C. Eberhart Multiobjective optimization using dynamic neighborhood particle swarm optimization Proceedings of the Congress Evolutionary Computation 2002 1677 1681
39. H.S. Hwang Design of supply-chain logistics system considering service level Comput. Ind. Eng. 43 1-2 2002 283 297
40. S.K. Jacobsen, and O.B.G. Madsen On the location of transfer points in a two-level newspaper delivery system - a case study The International Symposium on Locational Decisions 1978 24 28
41. S.K. Jacobsen, and O.B.G. Madsen A comparative study of heuristics for a two-level routing-location problem Eur. J. Oper. Res. 5 1980 378 387
42. B. Jiang, N. Wang, and L. Wang Particle swarm optimization with age-group topology for multimodal functions and data clustering Commun. Nonlinear Sci. Numer. Simul. 18 11 2013 3134 3145
43. J. Kennedy Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance Proceedings of IEEE Congress on Evolutionary Computation 1999 1391 1938
44. J. Kennedy, and R. Eberhart Particle swarm optimization Proceedings of 1995 IEEE International Conference on Neural Networks 4 1995 1942 1948
45. J. Kennedy, and R. Mendes Population structure and particle swarm performance Proceedings of IEEE Congress on Evolutionary Computation 2002 1671 1676
46. A. Khare, and S. Rangnekar A review of particle swarm optimization and its applications in solar photovoltaic system Appl. Soft Comput. 13 2013 2997 3006
47. M.R. Khouadjia, B. Sarasola, E. Alba, L. Jourdan, and E.-G. Talbi A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests Appl. Soft Comput. 12 2012 1426 1439
48. N. Laoutaris, V. Zissimopoulos, and I. Stavrakakis On the optimization of storage capacity allocation for content distribution Comput. Netw. 47 3 2005 409 428
49. G. Laporte, and P.J. Dejax Dynamic location-routing problems J. Oper. Res. Soc. 40 5 1989 471 482
50. X.D. Li Niching without niching parameters: particle swarm optimization using a ring topology IEEE Trans. Evolut. Comput. 14 1 2010 150 169
51. J. Liang, A. Qin, P. Suganthan, and S. Baskarr Comprehensive learning particle swarm optimizer for global optimization of multimodal functions IEEE Trans. Evolut. Comput. 10 3 2006 281 295
52. W.H. Lim, and N.A.M. Isa Particle swarm optimization with increasing topology connectivity Eng. Appl. Artif. Intell. 27 2014 80 102
53. W.H. Lim, and N.A.M. Isa Particle swarm optimization with adaptive time-varying topology connectivity Appl. Soft Comput. 24 2014 623 642
54. C.K.Y. Lin, C.K. Chow, and A. Chen A location-routing-loading problem for bill delivery services Comput. Ind. Eng. 43 1-2 2002 5 25
55. C.K.Y. Lin, and R.C.W. Kwok Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data Eur. J. Oper. Res. 175 3 2006 1833 1849
56. S.C. Liu, and S.B. Lee A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration Int. J. Adv. Manuf. Technol. 22 11-12 2003 941 950
57. O.B.G. Madsen Methods for solving combined two level location routing problems of realistic dimension Eur. J. Oper. Res. 12 3 1983 295 301
58. Y. Marinakis, G.R. Iordanidou, and M. Marinaki Particle swarm optimization for the vehicle routing problem with stochastic demands Appl. Soft Comput. 13 2013 1693 1704
59. Y. Marinakis, and M. Marinaki A bilevel genetic algorithm for a real life location routing problem Int. J. Logist. Res. Appl. 11 1 2008 49 65
60. Y. Marinakis, and M. Marinaki A particle swarm optimization algorithm with path relinking for the location routing problem J. Math. Model. Algorithms 7 1 2008 59 78
61. Y. Marinakis, and M. Marinaki A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem Comput. Oper. Res. 37 2010 432 442
62. Y. Marinakis, and M. Marinaki A hybrid genetic - particle swarm optimization algorithm for the vehicle routing problem Expert Syst. Appl. 37 2010 1446 1455
63. Y. Marinakis, and M. Marinaki A hybrid particle swarm optimization algorithm for the open vehicle routing problem M. Dorigo, ANTS 2012 LNCS 7461 2012 Springer-Verlag Berlin, Heidelberg 180 187
64. Y. Marinakis, and M. Marinaki Particle swarm optimization with expanding neighborhood topology for the permutation flowshop scheduling problem Soft Comput. 17 7 2013 1159 1173
65. Y. Marinakis, and M. Marinaki A bilevel particle swarm optimization algorithm for supply chain management problems E.-G. Talbi, Metaheuristics for Bi-level Optimization Studies in Computational Intelligence (SCI), vol. 482 2013 69 93
66. Y. Marinakis, and M. Marinaki A hybridized particle swarm optimization with expanding neighborhood topology for the feature selection problem M.J. Blesa, HM 2013, LNCS, 7919 2013 Springer-Verlag Berlin Heidelberg 37 51
67. Y. Marinakis, and M. Marinaki Combinatorial neighborhood topology particle swarm optimization algorithm for the vehicle routing problem M. Middendorf, C. Blum, EvoCOP 2013, LNCS, 7832 2013 133 144
68. Y. Marinakis, and M. Marinaki Combinatorial expanding neighborhood topology particle swarm optimization for the vehicle routing problem with stochastic demands GECCO: 2013, Genetic and Evolutionary Computation Conference Amsterdam, The Netherlands 2013
69. Y. Marinakis, M. Marinaki, and G. Dounias A hybrid particle swarm optimization algorithm for the vehicle routing problem Eng. Appl. Artif. Intell. 23 2010 463 472
70. Y. Marinakis, M. Marinaki, and N. Matsatsinis Honey bees mating optimization for the location routing problem IEEE International Engineering Management Conference (IEMC-Europe 2008) Estoril, Portugal 2008
71. Y. Marinakis, M. Marinaki, and A. Migdalas An adaptive particle swarm optimization algorithm for the vehicle routing problem with time windows LOT 2014, Logistics, Optimization and Transportation Conference 1-2 November 2014, Molde, Norway 2014
72. Y. Marinakis, M. Marinaki, and A. Migdalas A hybrid clonal selection algorithm for the location routing problem with stochastic demands Ann. Math. Artif. Intell. 2014 10.1007/s10472-014-9441-7
73. Y. Marinakis, M. Marinaki, and P. Spanou A memetic differential evolution algorithm for vehicle routing problem with stochastic demands I. Fister, I. Fister, Adaptation and Hybridization in Computational Intelligence, Adaptation Learning and Optimization, 18 2015 185 203 10.1007/978-3-319-14400-9-9
74. I. Maruta, T.H. Kim, D. Song, and T. Sugie Synthesis of fixed-structure robust controllers using a constrained particle swarm optimizer with cyclic neighborhood topology Expert Syst. Appl. 40 9 2013 3595 3605
75. J. Melechovsky, C. Prins, and R. Wolfler-Calvo A metaheuristic to solve a location-routing problem with non-linear costs J. Heuristics 11 5-6 2005 375 391
76. R. Mendes, J. Kennedy, and J. Neves The fully informed particle swarm: simpler, maybe better IEEE Trans. Evolut. Comput. 8 3 2004 204 210
77. H. Min Consolidation terminal location-allocation and consolidated routing problems J. Bus. Logist. 17 2 1996 235 263
78. H. Min, V. Jayaraman, and R. Srivastava Combined location-routing problems: a synthesis and future research directions Eur. J. Oper. Res. 108 1998 1 15
79. G. Nagy, and S. Salhi Location-routing: issues, models and methods Eur. J. Oper. Res. 177 2007 649 672
80. J.M. Nambiar, L.F. Gelders, and L.N. Van Wassenhove A large scale location-allocation problem in the natural rubber industry Eur. J. Oper. Res. 6 1981 183 189
81. M. Nasir, S. Das, D. Maity, S. Sengupta, U. Halder, and P.N. Suganthan A dynamic neighborhood learning based particle swarm optimizer for global numerical optimization Inf. Sci. 209 2012 16 36
82. V.P. Nguyen, C. Prins, and C. Prodhon Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking Eur. J. Oper. Res. 216 2012 113 126
83. T. Peram, K. Veeramachaneni, and C.K. Mohan Fitness-distance-ratio based particle swarm optimization Proceedings of the 2003 IEEE Swarm Intelligence Symposium 2003 174 181
84. J. Perl, and M.S. Daskin A unified warehouse location-routing methodology J. Bus. Logist. 5 1 1984 92 111
85. J. Perl, and M.S. Daskin A warehouse location routing model Transp. Res. B 19 1985 381 396
86. R. Poli, J. Kennedy, and T. Blackwell Particle swarm optimization. An overview Swarm Intell. 1 2007 33 57
87. C. Prins, C. Prodhon, and R. Wolfler-Calvo Nouveaux algorithmes pour le probleme de localisation et routage sous contraintes de capacite Proceedings of the MOSIM'04, 1115-1122, Editions Tec-Doc Lavoisier Nantes, France 2004 ISBN 2-7430-0731-1
88. C. Prins, C. Prodhon, and R. Wolfler-Calvo Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking 4OR 4 2006 221 238
89. C. Prins, C. Prodhon, and R. Wolfler-Calvo A memetic algorithm with population management (MAPM) for the capacitated location-routing problem J. Gottlieb, G.R. Raidl, EvoCOP 2006, LNCS, 3906 2006 Springer-Verlag Berlin, Heidelberg 183 194
90. C. Prins, C. Prodhon, A. Ruiz, P. Soriano, and R. Wolfler-Calvo Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic Transp. Sci. 41 4 2007 470 483
91. C. Prodhon, and C. Prins A survey of recent research on location-routing problems Eur. J. Oper. Res. 238 2014 1 17
92. M. Rosendo, and A. Pozo A hybrid particle swarm optimization algorithm for combinatorial optimization problems 2010 IEEE Congress on Evolutionary Computation (CEC) 2010 10.1109/CEC.2010.5586178
93. R. Russell, W.C. Chiang, and D. Zepeda Integrating multi-product production and distribution in newspaper logistics Comput. Oper. Res. 35 5 2008 1576 1588
94. D. Simchi-Levi, and O. Berman A heuristic algorithm for the traveling salesman location problem on networks Eur. J. Oper. Res. 36 1988 478 484
95. R. Srisvastava Alternate solution procedures for the location-routing problem Omega 21 4 1993 497 506
96. R. Srivastava, and W.C. Benton The location-routing problem: considerations in physical distribution system design Comput. Oper. Res. 17 1990 427 435
97. P.N. Suganthan Particle swarm optimiser with neighborhood operator Proceedings of the IEEE Congress on Evolutionary Computation 1999 1958 1962
98. C.J. Ting, and C.H. Chen A multiple ant colony optimization algorithm for the capacitated location routing problem Int. J. Prod. Econ. 141 2013 34 44
99. P. Toth, and D. Vigo The Vehicle Routing Problem 2002 Siam Monographs on Discrete Mathematics and Applications
100. D.C. Tran, Z. Wu, and H. Wang A novel enhanced particle swarm optimization method with diversity and neighborhood search IEEE International Conference on Systems, Man, and Cybernetics (SMC2013) 2013 180 187
101. D. Tuzun, and L.I. Burke A two-phase tabu search approach to the location routing problem Eur. J. Oper. Res. 116 1999 87 99
102. S. Wang, and J. Watada Two-stage fuzzy stochastic programming with value-at-risk criteria Appl. Soft Comput. 11 1 2011 1044 1056
103. S. Wang, and J. Watada A hybrid modified PSO approach to VaR-based facility location problems with variable capacity in fuzzy random uncertainty Inf. Sci. 192 1 2012 3 18
104. H. Wang, H. Sun, C. Li, S. Rahnamayan, and J.S. Pan Diversity enhanced particle swarm optimization with neighborhood search Inf. Sci. 223 2013 119 135
105. L. Wang, B. Yang, and Y. Chen Improving particle swarm optimization using multi-layer searching strategy Inf. Sci. 274 2014 70 94
106. C.D.T. Watson-Gandy, and P.J. Dohrn Depot location with van salesman - a practical approach Omega 1 1973 321 329
107. T.H. Wu, C. Low, and J.W. Bai Heuristic solutions to multi-depot location-routing problems Comput. Oper. Res. 29 2002 1393 1415
108. V.F. Yu, S.W. Lin, W. Lee, and C.J. Ting A simulated annealing heuristic for the capacitated location routing problem Comput. Ind. Eng. 58 2010 288 299