A hybrid estimation of distribution algorithm for solving the multi-objective multiple traveling salesman problem

The multi-objective multiple traveling salesman problem (MmTSP) is a generalization of the classical multi-objective traveling salesman problem. In this paper, a formulation of the MmTSP, which considers the weighted sum of the total traveling costs of all salesmen and the highest traveling cost of any single salesman, is proposed. An estimation of distribution algorithm (EDA) based on restricted Boltzmann machine is used for solving the formulated problem. The EDA is developed in the decomposition framework of multi-objective optimization. Due to the limitation of EDAs in generating a wide range of solutions, the EDA is hybridized with the evolutionary gradient search. Simulation studies are carried out to examine the optimization performances of the proposed algorithm on MmTSP with different number of objective functions, salesmen and problem sizes.

[1]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[2]  Andrew B. Whinston,et al.  Computer-Assisted School Bus Scheduling , 1972 .

[3]  Kenneth C. Gilbert,et al.  A New Multiperiod Multiple Traveling Salesman Problem with Heuristic and Application to a Scheduling Problem , 1992 .

[4]  P. Bosman,et al.  Continuous iterated density estimation evolutionary algorithms within the IDEA framework , 2000 .

[5]  Gu Guochang,et al.  An implementation of evolutionary computation for path planning of cooperative mobile robots , 2002, Proceedings of the 4th World Congress on Intelligent Control and Automation (Cat. No.02EX527).

[6]  Jesús García,et al.  Solving complex high-dimensional problems with the multi-objective neural estimation of distribution algorithm , 2009, GECCO.

[7]  Yang-Byung Park,et al.  A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines , 2001 .

[8]  Lixin Tang,et al.  A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex , 2000, Eur. J. Oper. Res..

[9]  Geoffrey E. Hinton,et al.  Restricted Boltzmann machines for collaborative filtering , 2007, ICML '07.

[10]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[11]  C. Okonjo-Adigwe.  An effective method of balancing the workload amongst salesmen , 1988 .

[12]  Qingfu Zhang,et al.  Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem , 2009 .

[13]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[14]  Cliff T. Ragsdale,et al.  A new approach to solving the multiple traveling salesperson problem using genetic algorithms , 2006, Eur. J. Oper. Res..

[15]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[16]  Kay Chen Tan,et al.  Restricted Boltzmann machine based algorithm for multi-objective optimization , 2010, IEEE Congress on Evolutionary Computation.

[17]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[18]  Kay Chen Tan,et al.  An investigation on evolutionary gradient search for multi-objective optimization , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[19]  Wei Zhou,et al.  An improved genetic algorithm for multiple traveling salesman problem , 2010, 2010 2nd International Asia Conference on Informatics in Control, Automation and Robotics (CAR 2010).

[20]  Alok Singh,et al.  A new grouping genetic algorithm approach to the multiple traveling salesperson problem , 2008, Soft Comput..

[21]  David E. Goldberg,et al.  Multiobjective Estimation of Distribution Algorithms , 2006, Scalable Optimization via Probabilistic Modeling.

[22]  János Abonyi,et al.  Optimization of Multiple Traveling Salesmen Problem by a Novel Representation Based Genetic Algorithm , 2011, Intelligent Computational Optimization in Engineering.

[23]  Hussain Aziz Saleh,et al.  The design of the global navigation satellite system surveying networks using genetic algorithms , 2004, Eng. Appl. Artif. Intell..

[24]  Qingfu Zhang,et al.  This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 RM-MEDA: A Regularity Model-Based Multiobjective Estimation of , 2022 .

[25]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[26]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[27]  Miguel Á. Carreira-Perpiñán,et al.  On Contrastive Divergence Learning , 2005, AISTATS.

[28]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[29]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[30]  Xiaoping Zhong,et al.  A Decision-Tree-Based Multi-objective Estimation of Distribution Algorithm , 2007, 2007 International Conference on Computational Intelligence and Security (CIS 2007).

[31]  Kay Chen Tan,et al.  A predictive gradient strategy for multiobjective evolutionary algorithms in a fast changing environment , 2010, Memetic Comput..

[32]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[33]  Kay Chen Tan,et al.  Probabilistic Based Evolutionary Optimizers in Bi-objective Travelling Salesman Problem , 2010, SEAL.

[34]  Pedro Larrañaga,et al.  Towards a New Evolutionary Computation - Advances in the Estimation of Distribution Algorithms , 2006, Towards a New Evolutionary Computation.

[35]  William A. Gruver,et al.  Team scheduling by genetic search , 1999, Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296).

[36]  Mícheál Ó Foghlú,et al.  Frequent Closed Informative Itemset Mining , 2007 .

[37]  Ralf Salomon,et al.  Evolutionary algorithms and gradient search: similarities and differences , 1998, IEEE Trans. Evol. Comput..