A Hybrid Estimation of Distribution Algorithm with Decomposition for Solving the Multiobjective Multiple Traveling Salesman Problem
Authors:
- 3 April 2012
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
- Vol. 42 (5) , 682-691
Abstract
Evolutionary multiobjective optimization with decomposition, in which the algorithm is not required to differentiate between the dominated and nondominated solutions, is one of the promising approaches in dealing with multiple conflicting objectives. In this paper, the estimation of distribution algorithm (EDA) is integrated into the decomposition framework. The search behavior of the algorithm is further enhanced by hybridizing local search metaheuristic approaches with the decomposition EDA. Three local search techniques, including hill climbing, simulated annealing, and evolutionary gradient search, are considered. A novel multiobjective formulation of the multiple traveling salesman problem is proposed. The hybrid algorithms are used to solve the formulated problem with different number of objective functions, salesmen, and problem sizes. The effectiveness and efficiency of the algorithms are tested and benchmarked against several state-of-the-art multiobjective evolutionary paradigms.Keywords
This publication has 38 references indexed in Scilit:
- Evolutionary Computation Meets Machine Learning: A SurveyIEEE Computational Intelligence Magazine, 2011
- Memetic informed evolutionary optimization via data miningMemetic Computing, 2011
- Memetic Compact Differential Evolution for Cartesian Robot ControlIEEE Computational Intelligence Magazine, 2010
- Memetic Computation—Past, Present & Future [Research FrontierIEEE Computational Intelligence Magazine, 2010
- Guest editorial: Memetic Algorithms for Evolutionary Multi-Objective OptimizationMemetic Computing, 2010
- Special issue on emerging trends in soft computing: memetic algorithmsSoft Computing, 2008
- Hybrid ant colony algorithms for path planning in sparse graphsSoft Computing, 2007
- Adaptation for parallel memetic algorithm based on population entropy2006
- A tabu search algorithm for static routing and wavelength assignment problemIEEE Communications Letters, 2005
- Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways2002