A Coalition-Based Metaheuristic for the vehicle routing problem

This paper presents a population based Metaheuristic adopting the metaphor of social autonomous agents. In this context, agents cooperate and self-adapt in order to collectively solve a given optimization problem. From an evolutionary computation point of view, mechanisms driving the search consist of combining intensification operators and diversification operators, such as local search and mutation or recombination. The multiagent paradigm mainly focuses on the adaptive capabilities of individual agents evolving in a context of decentralized control and asynchronous communication. In the proposed metaheuristic, the agentpsilas behavior is guided by a decision process for the operatorspsilachoice which is dynamically adapted during the search using reinforcement learning and mimetism learning between agents. The approach is called Coalition-Based Metaheuristic (CBM) to refer to the strong autonomy conferred to the agents. This approach is applied to the Vehicle Routing Problem to emphasize the performance of learning and cooperation mechanisms.

[1]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

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

[3]  Andrea Roli,et al.  MAGMA: a multiagent architecture for metaheuristics , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[4]  James Smith,et al.  A tutorial for competent memetic algorithms: model, taxonomy, and design issues , 2005, IEEE Transactions on Evolutionary Computation.

[5]  Anthony Wren,et al.  Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points , 1972 .

[6]  El-Ghazali Talbi,et al.  COSEARCH: A Parallel Co-evolutionary Metaheuristic , 2004, Hybrid Metaheuristics.

[7]  Bernd Freisleben,et al.  Memetic Algorithms for the Traveling Salesman Problem , 2002, Complex Syst..

[8]  Abder Koukam,et al.  Self-organization in Evolution for the Solving of Distributed Terrestrial Transportation Problems , 2008, Soft Computing Applications in Industry.

[9]  Michel Gendreau,et al.  Metaheuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[10]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[11]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[12]  Jacques Ferber,et al.  Multi-agent systems - an introduction to distributed artificial intelligence , 1999 .

[13]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[14]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[15]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[16]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[17]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[18]  H. Van Dyke Parunak,et al.  A Design Taxonomy of Multi-agent Interactions , 2003, AOSE.

[19]  Edmund H. Durfee,et al.  Distributed Problem Solving and Planning , 2001, EASSS.

[20]  Michel Gendreau,et al.  New Heuristics for the Vehicle Routing Problem , 2005 .

[21]  Olli Bräysy,et al.  Active guided evolution strategies for large-scale vehicle routing problems with time windows , 2005, Comput. Oper. Res..

[22]  Marco Colombetti,et al.  What Is a Learning Classifier System? , 1999, Learning Classifier Systems.

[23]  Yasuhiro Tanaka,et al.  Speed up reinforcement learning between two agents with adaptive mimetism , 1997, Proceedings of the 1997 IEEE/RSJ International Conference on Intelligent Robot and Systems. Innovative Robotics for Real-World Applications. IROS '97.

[24]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[25]  Pablo Moscato,et al.  A Gentle Introduction to Memetic Algorithms , 2003, Handbook of Metaheuristics.

[26]  Andrew W. Moore,et al.  Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..