A parallel multi-algorithm solver for dynamic multi-objective TSP (DMO-TSP)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5227 LNAI, Issue , 2008, Pages 164-173

  Yang, Ming ^a   Kang, Zhou ^b   Kang, Lishan ^a,b  

^a CHINA UNIVERSITY OF GEOSCIENCES   (China)

^b WUHAN UNIVERSITY   (China)

Author keywords

Dynamic multi objective TSP; Parallel multi algorithm; Pareto optimal front

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMMUNICATION; COMPUTER SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; EVOLUTIONARY ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION; NUCLEAR PROPULSION; OPTIMIZATION; PARALLEL ALGORITHMS; POPULATION STATISTICS; TRAVELING SALESMAN PROBLEM;

CO-EVOLUTION; DYNAMIC MULTI-OBJECTIVE TSP; INTELLIGENT COMPUTING; INTERNATIONAL CONFERENCES; MOBILE COMMUNICATIONS; MULTI OBJECTIVES; NO FREE LUNCH THEOREMS; NP-HARD PROBLEMS; NUMERICAL EXPERIMENTS; OPTIMIZ ATION PROBLEMS; PARALLEL COMPUTER SYSTEMS; PARALLEL MULTI-ALGORITHM; PARETO FRONTS; PARETO OPTIMAL FRONT; POPULATION EVOLUTION; SHARED MEMORIES; SMALL SIZE; THEORETICAL MODEL;

SET THEORY;

EID: 53049099590     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85984-0_21     Document Type: Conference Paper

References (26)

1. Lin, S., Kernighan, B.W.: An Effective Heuristic Algorithm for the Traveling Salesman Problem. Operations Research 21, 498-516 (1973)
2. Helsgaun, K.: An Effective Implementation of the Lin-Kemighan Traveling Salesman Heuristic. Eur. J. Oper. Res. 126, 106-130 (2000)
3. Quo, T.: Evolutionary Computation and Optimization (Ph.D Thesis). Wuhan University, Wuhan (May 2000)
4. Guo, T., Michalewicz, Z.: Inver-Over Operator for the TSP. In: Eiben, A.E., Back, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 803-812. Springer, Heidelberg (1998)
5. Psaraftis, H.N.: Dynamic Vehicle Routing Problems. In: Golden, B.L., Assad, A.A. (eds.) Vehicle Routing: Methods and Studies, pp. 223-248. Elsevier Science Publishers, Amsterdam (1988)
6. Guntsch, M., Branke, J., Middendorf, M., Schmeck, H.: ACO Strategies for Dynamic TSP. In: Dorrigo, M., et al. (eds.) Abstract Proceedings of ANTS 2000, pp. 59-62 (2000)
7. Guntsch, M., Middendorf, M.: Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol.2037, pp. 213-220. Springer, Heidelberg (2001)
8. Guntsch, M., Middendorf, M., Schmeck, H.: An Ant Colony Optimization Approach to Dynamic TSP. In: Proceedings of the GECCO 2001, pp. 860-867. Morgan Kaufmann, San Francisco (2001)
9. Ausiello, G., Feuestein, E., Leonardi, S., Stougie, L., Talamo, M.: Algorithms for the Online Traveling Salesman. Algorithmica 29(4), 560-581 (2001)
10. Kang, L.S., Zhou, A., McKay, B., Li, Y., Kang, Z.: Benchmarking Algorithms for Dynamic Travelling Salesman Problems. In: Proceedings of the Congress on Evolutionary Computation, Portland, Oregon (2004)
11. Durbin, R., Willshaw, D.: An Analogue Approach to the Traveling Salesman Problem Using an Elastic Net Method. Nature 326(6114), 689-691 (1987)
12. Yan, Z.Y., Zhang, L.H., Kang, L.S., Lin, G.M.: A New MOEA for Multi-objective TSP and Its Convergence Property Analysis. In: Fonseca, CM., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 342-354. Springer, Heidelberg (2003)
13. Ji, Z.W., Chen, A., Kitti, S.: Finding Multi-Objective Paths in Stochastic Networks: A Simulation-based Genetic Algorithm Approach. In: Congress on Evolution Compution (CEC 2004), pp. 174-180. IEEE Press, Los Alamitos (2004)
14. Marwaha, S., Srinivasan, D., Tham, C.K., et al.: Evolutionary Fuzzy Multi-Objective Routing For Wireless Mobile Ad Hoc Networks. In: Congress on Evolution Compution (CEC 2004), pp. 1964-1971. IEEE Press, Los Alamitos (2004)
15. Pareto, V.: Cours D' Economie Politique, vol. I. F. Rouge, Lausanne (1896)
16. Wolpert, D.H., MacReady, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67-82 (1997)
17. Kang, L.S., Jin, H.Y., et al.: The Split Method for Solving High-dimensional Partial Differential Equations, pp. 160-196. Science and Technology of Shanghai Press (1990)
18. Peter, M., Freisleben, B.: Genetic Local Search for the TSP: New Results. In: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, pp. 164-259. IEEE Press, NJ (1997)
19. Baraglia, R., Hidalgo, J.I., Perego, R.: A Hybrid Heuristic for the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 5(6), 613-622 (2001)
20. Yang, Hui, Kang, L.S., Chen, Y.P.: A Gene-pool Based Genetic Algorithm for TSP. Wuhan University Journal of Nature Sciences 8(1B), 217-223 (2003)
21. Volgenant, T., Jonker, R.: The Symmetric Traveling Salesman Problem and Edge Exchange i Minimal 1-Trees. Eur. J. Oper. Res. 12, 394-403 (1983)
22. TSP Library (2006), http: //www. iwr.uni-heidelberg.de/groups/comopt/ software/TSPLIB95/tsp
23. Goldberg, D.E., Lingle, R.: Alletes, Loci, and the TSP. In: Proceedings of the First International Conference on Genetic Algorithms. Lawrence Erlbaum. Associates, Hilladale, pp. 154-159 (1985)
24. Vrugt, J.A., Robinsion, B.A.: Improved evolutionary optimization from genetically adaptive multi-method search. Proceedings of the National Academy of Sciences of the United stats of America 104, 708-711 (2007)
25. Corne, D., Knowles, J.: Techniques for Highly Multi-objective Optimization: Some Nondominated Points are Better than Others. In: Proceedings of GECCO, pp. 773-780 (2007)
26. Yang, M., Kang, L.S., Guan, J.: Multi-Algorithm. Co-evolution Strategy for Dynamic Multi-Objective TSP. In: Proceedings of the Congress on Evolutionary Computation (CEC 2008), Hong Kong (2008)