Ant colony optimization with clustering for solving the dynamic location routing problem

Applied Mathematics and Computation

Volumn 285, Issue , 2016, Pages 149-173

  Gao, Shangce ^a,b   Wang, Yirui ^a   Cheng, Jiujun ^c   Inazumi, Yasuhiro ^b   Tang, Zheng ^b  

^a DONGHUA UNIVERSITY   (China)

^b UNIVERSITY OF TOYAMA   (Japan)

^c Ministry of Education   (China)

Author keywords

Ant colony algorithm; Clustering algorithm; Dynamic environment; Dynamic optimization; Immigrant scheme; Location routing

Indexed keywords

ALGORITHMS; ANT COLONY OPTIMIZATION; EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; LOCATION; OPTIMIZATION;

ANT COLONY ALGORITHMS; DYNAMIC ENVIRONMENTS; DYNAMIC OPTIMIZATION; IMMIGRANT SCHEME; LOCATION-ROUTING;

CLUSTERING ALGORITHMS;

EID: 84963682518     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2016.03.035     Document Type: Article

References (58)

1. E. Bonabeau, M. Dorigo, and G. Theraulaz Inspiration for optimization from social insect behaviour Nature 406 6791 2000 39 42
2. M. Dorigo, and T. Stutzle Ant Colony Optimization 2004 MIT Press
3. M. Dorigo, V. Maniezzo, and A. Colorni Ant system: optimization by a colony of cooperating agents IEEE Trans. Syst. Man Cybern. Part B Cybern. 26 1 1996 29 41
4. M. Dorigo, and L.M. Gambardella Ant colony system: a cooperative learning approach to the traveling salesman problem IEEE Trans. Evol. Comput. 1 1 1997 53 66
5. K.V. Narasimha, E. Kivelevitch, B. Sharma, and M. Kumar An ant colony optimization technique for solving min-max multi-depot vehicle routing problem Swarm Evol. Comput. 13 2013 63 73
6. C. Cruz, J.R. González, and D.A. Pelta Optimization in dynamic environments: a survey on problems, methods and measures Soft Comput. 15 7 2011 1427 1448
7. M. Mavrovouniotis, and S. Yang Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors Appl. Soft Comput. 13 10 2013 4023 4037
8. Y. Jin, and J. Branke Evolutionary optimization in uncertain environments - a survey IEEE Trans. Evol. Comput. 9 3 2005 303 317
9. M. Guntsch, and M. Middendorf Pheromone modification strategies for ant algorithms applied to dynamic tsp Proceedings of the EvoWorkshops 2001 on Applications of Evolutionary Computing 2001 Springer 213 222
10. S. Yang, and R. Tinós A hybrid immigrants scheme for genetic algorithms in dynamic environments Int. J. Autom. Comput. 4 3 2007 243 254
11. X. Yu, K. Tang, and X. Yao An immigrants scheme based on environmental information for genetic algorithms in changing environments Proceedings of the 2008 IEEE Congress on Evolutionary Computation 2008 IEEE 1141 1147
12. S. Yang, H. Cheng, and F. Wang Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 40 1 2010 52 63
13. T. Blackwell, and J. Branke Multiswarms, exclusion, and anti-convergence in dynamic environments IEEE Trans. Evol. Comput. 10 4 2006 459 472
14. C. Li, and S. Yang A general framework of multipopulation methods with clustering in undetectable dynamic environments IEEE Trans. Evol. Comput. 16 4 2012 556 577
15. S. Yang, and C. Li A clustering particle swarm optimizer for locating and tracking multiple optima in dynamic environments IEEE Trans. Evol. Comput. 14 6 2010 959 974
16. T.T. Nguyen, S. Yang, and J. Branke Evolutionary dynamic optimization: A survey of the state of the art Swarm Evol. Comput. 6 2012 1 24
17. W. Du, and B. Li Multi-strategy ensemble particle swarm optimization for dynamic optimization Inf. Sci. 178 15 2008 3096 3109
18. E. Alba, G. Luque, and S. Nesmachnow Parallel metaheuristics: recent advances and new trends Int. Trans. Oper. Res. 20 1 2013 1 48
19. G. Laporte, Y. Nobert, and D. Arpin An exact algorithm for solving a capacitated location-routing problem Ann. Oper. Res. 6 9 1986 291 310
20. P. Toth, and D. Vigo The Vehicle Routing Problem 2001 Society for Industrial and Applied Mathematics
21. M. Gendreau, A. Hertz, and G. Laporte A tabu search heuristic for the vehicle routing problem Manag. Sci. 40 10 1994 1276 1290
22. I.H. Osman Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem Ann. Oper. Res. 41 4 1993 421 451
23. B. Bullnheimer, R.F. Hartl, and C. Strauss Applying the Ant System to the Vehicle Routing Problem 1999 Springer 285 296
24. B. Bullnheimer, R.F. Hartl, and C. Strauss An improved ant system algorithm for the vehicle routing problem Ann. Oper. Res. 89 1999 319 328
25. J.E. Bell, and P.R. McMullen Ant colony optimization techniques for the vehicle routing problem Adv. Eng. Inf. 18 1 2004 41 48
26. A. Rizzoli, F. Oliverio, R. Montemanni, and L.M. Gambardella Ant Colony Optimisation for Vehicle Routing Problems: From Theory to Applications Technical Report IDSIA-15-04 2004 Istituto Dalle Molle di Studi sull
27. L.M. Hvattum, A. Løkketangen, and G. Laporte A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems Networks 49 4 2007 330 340
28. M. Gendreau, F. Guertin, J.-Y. Potvin, and E. Taillard Parallel tabu search for real-time vehicle routing and dispatching Transp. Sci. 33 4 1999 381 390
29. Y. Chan, W.B. Carter, and M.D. Burnes A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands Comput. Oper. Res. 28 8 2001 803 826
30. R.M. Karp Reducibility Among Combinatorial Problems 1972 Springer
31. C. Lin, and R. 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
32. T.-H. Wu, C. Low, and J.-W. Bai Heuristic solutions to multi-depot location-routing problems Comput. Oper. Res. 29 10 2002 1393 1415
33. G.u. Clarke, and J.W. Wright Scheduling of vehicles from a central depot to a number of delivery points Oper. Res. 12 4 1964 568 581
34. B.M. Baker, and M. Ayechew A genetic algorithm for the vehicle routing problem Comput. Oper. Res. 30 5 2003 787 800
35. Z. Ursani, D. Essam, D. Cornforth, and R. Stocker Localized genetic algorithm for vehicle routing problem with time windows Appl. Soft Comput. 11 8 2011 5375 5390
36. M. Reimann, K. Doerner, and R.F. Hartl D-ants: Savings based ants divide and conquer the vehicle routing problem Comput. Oper. Res. 31 4 2004 563 591
37. L. Santos, J. Coutinho-Rodrigues, and J.R. Current An improved ant colony optimization based algorithm for the capacitated arc routing problem Transp. Res. Part B Methodol. 44 2 2010 246 266
38. N.H. Wilson, and N.J. Colvin Computer Control of the Rochester Dial-a-Ride System Technical Report R77-31 1977 Department of Civil Engineering, Massachusetts Institute of Technology, Center for Transportation Studies
39. R. Montemanni, L.M. Gambardella, A.E. Rizzoli, and A.V. Donati Ant colony system for a dynamic vehicle routing problem J. Comb. Optim. 10 4 2005 327 343
40. 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 4 2012 1426 1439
41. G. Laporte, F. Louveaux, and H. Mercure Models and exact solutions for a class of stochastic location-routing problems Eur. J. Oper. Res. 39 1 1989 71 78
42. T.W. Chien Heuristic procedures for practical-sized uncapacitated location-capacitated routing problems Decis. Sci. 24 5 1993 995 1021
43. S. S, and F. M An integrated heuristic approach for the combined location vehicle fleet mix problem Stud. Locat. Anal. 8 1996 3 21
44. 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
45. I. Or, and W.P. Pierskalla A transportation location-allocation model for regional blood banking AIIE Trans. 11 2 1979 86 95
46. D. Tuzun, and L.I. Burke A two-phase tabu search approach to the location routing problem Eur. J. Oper. Res. 116 1 1999 87 99
47. 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
48. M.-C. Su, and C.-H. Chou A modified version of the k-means algorithm with a distance based on cluster symmetry IEEE Trans. Pattern Anal. Mach. Intell. 23 6 2001 674 680
49. S. Yang, Y. Li, X. Hu, and R.-y. PAN Optimization study on k value of k-means algorithm Syst. Eng. Theory Pract. 2 2006 012
50. M. Dorigo, M. Birattari, and T. Stützle Ant colony optimization Comput. Intell. Mag. IEEE 1 4 2006 28 39
51. T. Stützle, and H. Hoos Max-min ant system and local search for the traveling salesman problem Proceedings of the IEEE International Conference on Evolutionary Computation 1997 IEEE 309 314
52. M. Mavrovouniotis, and S. Yang Ant colony optimization with immigrants schemes in dynamic environments Proceedings of the Eleventh International Conference on Parallel Problem Solving from Nature, PPSN XI 2010 Springer 371 380
53. J. Alcala-Fdez, L. Sanchez, S. Garcia, M.J. del Jesus, S. Ventura, J. Garrell, J. Otero, C. Romero, J. Bacardit, V.M. Rivas, and et al. Keel: a software tool to assess evolutionary algorithms for data mining problems Soft Comput. 13 3 2009 307 318
54. C.J. Eyckelhof, and M. Snoek Ant systems for a dynamic tsp Proceedings of the Third International Workshop on Ant Algorithms 2002 Springer 88 99
55. M. Guntsch, and M. Middendorf A population based approach for ACO Applications of Evolutionary Computing 2002 Springer 72 81
56. V.F. Yu, and S.Y. Lin A simulated annealing heuristic for the open location-routing problem Comput. Oper. Res. 62 2 2014 288 299
57. M.A. Mohammed, M.S. Ahmad, S. Mostafa, and et al. Using genetic algorithm in implementing capacitated vehicle routing problem Proceedings of the 2012 International Conference on Computer and Information Science (ICCIS) vol. 1 2012 IEEE 257 262
58. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller Equation of state calculations by fast computing machines J. Chem. Phys. 21 6 1953 1087 1092