Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors

Applied Soft Computing Journal

Volumn 13, Issue 10, 2013, Pages 4023-4037

  Mavrovouniotis, Michalis ^a   Yang, Shengxiang ^a  

^a DE MONTFORT UNIVERSITY   (United Kingdom)

Author keywords

Ant colony optimization; Dynamic optimization problem; Dynamic travelling salesman problem; Immigrants schemes; Traffic factor

Indexed keywords

ARTIFICIAL INTELLIGENCE; EVOLUTIONARY ALGORITHMS; OPTIMIZATION; TRAVELING SALESMAN PROBLEM;

ANT COLONY OPTIMIZATION ALGORITHMS; DYNAMIC ENVIRONMENTS; DYNAMIC OPTIMIZATION PROBLEM (DOP); IMMIGRANTS SCHEMES; PHEROMONE TRAILS; RANDOM IMMIGRANTS; TRAFFIC FACTORS; TRAVELLING SALESMAN PROBLEM;

ANT COLONY OPTIMIZATION;

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

References (62)

1. D. Angus, Niching for population-based ant colony optimization, in: Proceedings of the 2nd IEEE International Conference on e-Science and Grid Computing, 2006, pp. 15-22.
2. D. Angus, T. Hendtlass, Dynamic ant colony optimisation, Applied Intelligence 23 (2005) 33-38. (Pubitemid 40891522)
3. J.E. Bell, P.R. McMullen, Ant colony optimization techniques for the vehicle routing problem, Advanced Engineering Informatics 18 (2004) 41-48.
4. P.A.N. Bosman, Learning, anticipation and time-deception in evolutionary online dynamic optimization, in: Proceedings of the 2005 Genetic and Evolutionary Computation Conference, ACM Press, 2005, pp. 39-47.
5. B. Bullnheimer, R. Haiti, C. Strauss, An improved ant system algorithm for the vehicle routing problem, Annals of Operations Research 89 (1999) 319-328.
6. B. Bullnheimer, R.F. Hartl, C. Strauss, A new rank based version of the ant system-a computational study, Central European Journal for Operations Research in Economics 7 (1) (1990) 25-38.
7. E. Bonabeau, M. Dorigo, G. Theraulaz, Swarm Intelligence: From Natural to Artificial Systems, Oxford University Press, New York, 1999.
8. J. Branke, Memory enhanced evolutionary algorithms for changing optimization problems, in: Proceedings of the 1999 IEEE Congress on Evolutionary Computation, vol. 3, IEEE Press, 1999, pp. 1875-1882.
9. J. Branke, T. Kausler, C. Schmidt, H. Schmeck, A multi-population approach to dynamic optimization problems, in: Proceedings of the 4th International Conference on Adaptive Computing in Design and Manufacturing, Springer- Verlag, 2000, pp. 299-308.
10. J. Branke, E. Salihoglu, C. Uyar, Towards an analysis of dynamic environments., in: Proceedings of the 2005 Genetic and Evolutionary Computation Conference, ACM Press, 2005, pp. 1433-1440. (Pubitemid 43226462)
11. C. Cruz, J.R. Gonzalez, D.A. Pelta, Optimization in dynamic environments: a survey on problems, methods and measures, Soft Computing. 15 (7) (2011) 1427-1448.
12. H.G. Cobb, An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent non-stationary environments, Technical Report AIC-90-001, Naval Research Laboratory, Washington, USA, 1990.
13. H.G. Cobb, J.J. Grefenstette, Genetic algorithms for tracking changing environments, in: Proceedings of the 5th International Conference on Genetic Algorithms, 1993, pp. 523-530.
14. A. Colorni, M. Dorigo, V. Maniezzo, Distributed optimization by ant colonies, in: Proceedings of the 1st European Conference on Artificial Life, 1992, pp. 134-142.
15. O. Cordon, I.F. de Viana, F. Herrera, L. Moreno, A new ACO model integrating evolutionary computation concepts: the best worst Ant System, in: Proceedings of the 2nd International Workshop on Ant Algorithms, Springer-Verlag, 2000, pp. 22-29.
16. G. Di Caro, M. Dorigo, Ant Net: distributed stigmergetic control for communications networks, Journal of Artificial Intelligence Research 9 (1998) 317-365. (Pubitemid 128636207)
17. G. Di Caro, F. Ducatelle, L.M. Gambardella, AntHocNet: an ant-based hybrid routing algorithm for mobile ad hoc networks, in: Proceedings of the 8th International Conference on Parallel Problem Solving from Nature, Springer-Verlag, 2004, pp. 461-470. (Pubitemid 39750247)
18. M. Dorigo, V. Maniezzo, A. Colorni, Ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man and Cybernetics, Part B: Cybernetics 26 (1) (1996) 29-41. (Pubitemid 126780573)
19. M. Dorigo, L.M. Gambardella, Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation 1 (1) (1997) 53-66. (Pubitemid 127771018)
20. M. Dorigo, T. Stutzle, Ant Colony Optimization, The MIT Press, London, England, 2004.
21. C.J. Eyckelhof, M. Snoek, Ant Systems for a Dynamic TSP, in: Proceedings of the 3rd International Workshop on Ant Algorithms, Springer-Verlag, 2002, pp. 88-99.
22. M.R. Garey, D.S. Johnson, Computer and Intractability: A Guide to the Theory of NP-completeness, San Francisco, Freeman, 1979.
23. L.M. Gambardella, E.D. Taillard, M. Dorigo, Ant colonies for the quadratic assignment problem, Journal of the Operations Research Society 50 (1999) 167-176.
24. J.J. Grefenestette, Genetic algorithms for changing environments., in: Proceedings of the 2nd International Conference on Parallel Problem Solving from Nature, 1992, pp. 137-144.
25. M. Guntsch, M. Middendorf, Applying population based ACO to dynamic optimization problems, in: Proceedings of the 3rd International Workshop on Ant Algorithms, LNCS 2463, Springer-Verlag, 2002, pp. 111-122.
26. M. Guntsch, M. Middendorf, A population based approach for ACO., in: EvoWorkshops 2002: Applications of Evolutionary Computing, Springer- Verlag, 2002, pp. 72-81.
27. M. Guntsch, M. Middendorf, Pheromone modification strategies for ant algorithms applied to dynamic TSP., in: EvoWorkshops 2001: Applications of Evolutionary Computing, Springer-Verlag, 2001, pp. 213-222. (Pubitemid 33261170)
28. M. Guntsch, M. Middendorf, H. Schmeck, An ant colony optimization approach to dynamic TSP, in: Proceedings of the 2001 Genetic and Evolutionary Computing Conference, 2001, pp. 860-867.
29. T. Guo, Z. Michalewicz, Inver-over operator for the TSP, in: Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, 1998, pp. 803-812. (Pubitemid 128146010)
30. J. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, 1975.
31. Y. Jin, J. Branke, Evolutionary optimization in uncertain environments-a survey, IEEE Transactions on Evolutionary Computation 9 (3) (2005) 303-317. (Pubitemid 40871134)
32. P. Kilby, P. Prosser, P. Shaw, Dynamic VRPs: A study of scenarios, Technical Report APES-06-1998, University of Strathclyde, UK, 1998.
33. S. Lin, B.W. Kerninghan, An effective heuristic algorithm for the traveling salesman problem, Operations Research 21 (2) (1973) 498-516.
34. V. Maniezzo, A. Colorni, The ant system applied to the quadratic assignment problem, IEEE Transactions on Knowledge and Data Engineering 9 (5) (1999) 769-778. (Pubitemid 30518732)
35. M. Mavrovouniotis, S. Yang, Ant colony optimization with immigrants schemes for dynamic environments, in: Proceedings of the 11th International Conference on Parallel Problem Solving from Nature, LNCS 6238, Springer- Verlag, 2010, pp. 371-380.
36. M. Mavrovouniotis, S. Yang, A memetic ant colony optimization algorithm for the dynamic travelling salesman problem, Soft Computing 15 (7) (2011) 1405-1425, Springer-Verlag.
37. M. Mavrovouniotis, S. Yang, Memory-based immigrants for ant colony optimization in changing environments, in: EvoApplications 2011: Applications of Evolutionary Computing, LNCS 6624, Springer-Verlag, 2011, pp. 324-333.
38. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, third ed., Springer-Verlag, Berlin, 1999.
39. R. Montemanni, L. Gambardella, A. Rizzoli, A. Donati, Ant colony system for a dynamic vehicle routing problem, Journal of Combinatorial Optimization. 10 (4) (2005) 327-343. (Pubitemid 41660714)
40. T.T. Nguyen, Z. Yang, S. Bonsall, Dynamic time-linkage problems-the challenges, in: Proceedings of the International Conference on Computing and Communication Technologies, Research, Innovation, and Vision for the Future, IEEE Press, 2012, pp. 1-6.
41. T.T. Nguyen, S. Yang, J. Branke, Evolutionary dynamic optimization: a survey of the state of the art, Swarm and Evolutionary Computation. 6 (2012) 1-24.
42. A.E. Rizzoli, R. Montemanni, E. Lucibello, L.M. Gambardella, Ant colony optimization for real-world vehicle routing problems-from theory to applications, Swarm Intelligence 1 (2) (2007) 135-151.
43. T. Stutzle, H. Hoos, The MAX-MIN ant system and local search for the traveling salesman problem, in: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, IEEE Press, 1997, pp. 309-314.
44. T. Stutzle, H. Hoos, MAX-MIN ant system, Future Generation Computer Systems 8 (16) (2000) 889-914.
45. R.K. Ursem, Multinational GA optimization techniques in dynamic environments, in: Proceedings of the 2000 Genetic and Evolutionary Computation Conference, 2000, pp. 19-26.
46. F. Vavak, K.A. Jukes, T.C. Fogarty, Performance of a genetic algorithm with variable local search range relative to frequency for the environmental changes, in: Proceedings of the 1998 International Conference on Genetic Programming, Morgan Kaufmann, 1998, pp. 22-25.
47. H. Wang, D. Wang, S. Yang, A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems, Soft Computing. 13 (8-9) (2009) 763-780.
48. M. Wineberg, F. Oppacher, Enhancing the GA's ability to cope with dynamic environments., in: Proceedings of the 2000 Genetic and Evolutionary Computation Conference, 2000, pp. 3-10.
49. S. Yang, Memory-based immigrants for genetic algorithms in dynamic environments, in: Proceedings of the 2005 Genetic and Evolutionary Computation Conference, vol. 2, ACM Press, 2005, pp. 1115-1122. (Pubitemid 43226422)
50. S. Yang, On the design of diploid genetic algorithms for problem optimization in dynamic environments, in: Proceedings of the 2006 IEEE Congress on Evolutionary Computation, IEEE Press, 2006, pp. 1362-1369. (Pubitemid 47130656)
51. S. Yang, Genetic algorithms with elitism based immigrants for changing optimization problems, in: EvoWorkshops 2007: Applications of Evolutionary Computing, LNCS 4448, Springer-Verlag, 2007, pp. 627-636. (Pubitemid 47290121)
52. S. Yang, Genetic algorithms with memory and elitism based immigrants in dynamic environments, Evolutionary Computation 16 (3) (2008) 385-416.
53. S. Yang, H. Cheng, F. Wang, Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks., IEEE Transactions on Systems, Man, and Cybernetics. Part C: Applications and Reviews. 40 (1) (2010) 52-63.
54. S. Yang, Y. Jiang, T.T. Nguyen, Metaheuristics for dynamic combinatorial optimization problems, IMA Journal of Management Mathematics (2012), Oxford University Press.
55. S. Yang, R. Tinos, A hybrid immigrants scheme for genetic algorithms in dynamic environments, International Journal of Automation and Computing 4 (3) (2007) 243-254. (Pubitemid 47167351)
56. S. Yang, Non-stationary problem optimization using the primal-dual genetic algorithm, in: Proceedings of the 2003 IEEE Congress on Evolutionary Computation, IEEE Press, 2003, pp. 2246-2253.
57. S. Yang, X. Yao, Population-based incremental learning with associative memory for dynamic environments, IEEE Transactions on Evolutionary Computation 12 (5) (2008) 542-561.
58. A. Younes, O. Basir, P.A. Calamai, Benchmark generator for dynamic optimization., in: Proceedings of the 3rd WSEAS International Conference on Soft Computing, Optimization, Simulation & Manufacturing Systems 3(1), 2004, pp. 273-278.
59. E.L. Yu, P.N. Suganthan, Evolutionary programming with ensemble of explicit memories for dynamic optimization, in: Proceedings of the 2009 IEEE Congress on Evolutionary Computation, IEEE Press, 2009, pp. 431-438.
60. X. Yu, K. Tang, X. Yao, An immigrants scheme based on environmental information for genetic algorithms in changing environments., in: Proceedings of the 2008 IEEE Congress of Evolutionary Computation, IEEE Press, 2008, pp. 1141-1147.
61. X. Yu, K. Tang, X. Yao, Immigrant schemes for evolutionary algorithms in dynamic environments: Adapting the replacement rate, Science China Series F: Information Sciences 53 (1) (2010) 1-11.
62. X. Yu, K. Tang, T. Chen, X. Yao, Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization, Memetic Computing. 1 (1) (2009) 3-24.