A Parallel Procedure for Dynamic Multi-objective TSP

This paper proposes a new parallel search procedure for dynamic multi-objective traveling salesman problem. We design a multi-objective TSP in a stochastic dynamic environment. The proposed procedure first uses parallel processors to identify the extreme solutions of the search space for each of k objectives individually at the same time. These solutions are merged into a matrix E. The solutions in E are then searched by parallel processors and evaluated for dominance relationship. The proposed procedure was implemented in two different ways: a master-worker architecture and a pipeline architecture.

[1]  David Wallace,et al.  Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach , 2006, GECCO.

[2]  Steven Guan,et al.  Evolving Dynamic Multi-Objective Optimization Problems with Objective Replacement , 2005, Artificial Intelligence Review.

[3]  C. R. Reeves,et al.  Landscapes, operators and heuristic search , 1999, Ann. Oper. Res..

[4]  Francisco de Toro,et al.  The Parallel Single Front Genetic Algorithm (PSFGA) in Dynamic Multi-objective Optimization , 2007, IWANN.

[5]  C.E. Mariano-Romero,et al.  Incremental Refinement of Solutions for Dynamic Multi Objective Optimization Problems , 2007, 2007 Sixth Mexican International Conference on Artificial Intelligence, Special Session (MICAI).

[6]  Weiqi Li.  A Parallel Multi-start Search Algorithm for Dynamic Traveling Salesman Problem , 2011, SEA.

[7]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[8]  Weiqi Li,et al.  Seeking global edges for traveling salesman problem in multi-start search , 2011, J. Glob. Optim..

[9]  Paul H. Calamai,et al.  Adapting Genetic Algorithms for Combinatorial Optimization Problems in Dynamic Environments , 2008 .

[10]  Julio Ortega Lopera,et al.  Approaching Dynamic Multi-Objective Optimization Problems by Using Parallel Evolutionary Algorithms , 2010, Advances in Multi-Objective Nature Inspired Computing.

[11]  Yuping Wang,et al.  Dynamic Multi-objective Optimization Evolutionary Algorithm , 2007, Third International Conference on Natural Computation (ICNC 2007).

[12]  Kalyanmoy Deb,et al.  Dynamic Multiobjective Optimization Problems: Test Cases, Approximation, and Applications , 2003, EMO.

[13]  Julio Ortega Lopera,et al.  Parallel Processing for Multi-objective Optimization in Dynamic Environments , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[14]  Ming Yang,et al.  Multi-algorithm co-evolution strategy for Dynamic Multi-Objective TSP , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[15]  Cheng-Liang Chen,et al.  Solving multi‐objective dynamic optimization problems with fuzzy satisfying method , 2003 .

[16]  Kalyanmoy Deb,et al.  Dynamic multiobjective optimization problems: test cases, approximations, and applications , 2004, IEEE Transactions on Evolutionary Computation.

[17]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .