RETRACTED ARTICLE: A Multi-agent Based Self-adaptive Genetic Algorithm for the Long-term Car Pooling Problem

Rising vehicles number and increased use of private cars have caused significant traffic congestion, noise and energy waste. Public transport cannot always be set up in the non-urban areas. Car pooling, which is based on the idea that sets of car owners having the same travel destination share their vehicles has emerged to be a viable possibility to reduce private car usage around the world. In this paper, we present a multi-agent based self-adaptive genetic algorithm to solve long-term car pooling problem. The system is a combination of multi-agent system and genetic paradigm, and guided by a hyper-heuristic dynamically adapted by a collective learning process. The aim of our research is to solve the long-term car pooling problem efficiently with limited exploration of the search space. The proposed algorithm is tested using large scale instance data sets. The computational results show that the proposed method is competitive with other known approaches for solving long-term car pooling problem.

[1]  Antonella Carbonaro,et al.  An ANTS Heuristic for the Long — Term Car Pooling Problem , 2004 .

[2]  Alessandro Persona,et al.  THE CAR POOLING PROBLEM: HEURISTIC ALGORITHMS BASED ON SAVINGS FUNCTIONS , 2003 .

[3]  Thomas Stützle,et al.  The long term car pooling problem : on the soundness of the problem formulation and proof of NP-completeness , 2002 .

[4]  Gilbert Laporte,et al.  Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic , 2006, Transp. Sci..

[5]  El-Ghazali Talbi,et al.  A Parallel Co-evolutionary Metaheuristic , 2000, IPDPS Workshops.

[6]  Matthias Fuchs,et al.  High Performance ATP Systems by Combining Several AI Methods , 1997, IJCAI.

[7]  Roberto Baldacci,et al.  An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation , 2004, Oper. Res..

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

[9]  Gregory Gutin,et al.  Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP , 2001, Discret. Appl. Math..

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

[11]  A. Fraser,et al.  Computer models in genetics , 1970 .

[12]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[13]  Piotr Jedrzejowicz,et al.  JADE-Based A-Team Environment , 2006, International Conference on Computational Science.

[14]  David E. Goldberg,et al.  Genetic Algorithms, Selection Schemes, and the Varying Effects of Noise , 1996, Evolutionary Computation.