Using family competition genetic algorithm in pickup and delivery problem with time window constraints

In this paper, we propose a novel research scheme to solve the single vehicle pickup and delivery problem (PDPTW) with time window constraints. The family competition genetic algorithm (FCGA) is a modern approach that has been successfully applied to solve the traveling salesman problem. We illustrate the FCGA and give the experimental results that show the FCGA is an effective algorithm for solving the single vehicle PDPTW. Genetic algorithms (GA) have been successful applied to solve the combinatorial computation problems. The family competition will improve the achievements for obtaining optimal solutions and the probability to hit the feasible solutions. By comparing FCGA with traditional GA, this excellent approach does not need enormous resources. Applying FCGA to single vehicle PDPTW, it succeeded in finding feasible solutions for all problems and obtained efficient results in our experimentation.

[1]  Sam R. Thangiah,et al.  Vehicle Routing and Time Deadlines Using Genetic and Local Algorithms , 1993, ICGA.

[2]  Mwp Martin Savelsbergh,et al.  VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .

[3]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[4]  Jinn-Moon Yang,et al.  Integrating adaptive mutations and family competition into genetic algorithms as function optimizer , 2000, Soft Comput..

[5]  Roger L. Wainwright,et al.  Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms , 1993, ICGA.

[6]  Harilaos N. Psaraftis,et al.  Scheduling Large-Scale Advance-Request Dial-A-Ride Systems , 1986 .

[7]  Jane Yung-jen Hsu,et al.  Dynamic vehicle routing using hybrid genetic algorithms , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

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

[9]  Gunar E. Liepins,et al.  A New Approach on the Traveling Salesman Problem by Genetic Algorithms , 1993, ICGA.

[10]  A Assad,et al.  MODELING AND IMPLEMENTATION ISSUES IN VEHICLE ROUTING , 1988 .

[11]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..

[12]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .