A new crossover to solve the full truckload vehicle routing problem using genetic algorithm

This paper considers the full-truckload selective multi-depot vehicle routing problem under time windows constraints (denoted by FT-SMDVRPTW), which is a generalization of the vehicle routing problem (VRP). Our objective function is to maximize the total profit that the vehicle generates during its trip. In this study, we'll present a review of literature about full truckload vehicle routing; we'll define the FT-SMDVRPTW that will be resolved via using genetic algorithm. A new complex two-part chromosome is used to represent the solution to our problem. Through a selection based on the elitist method and roulette method, an improved crossover operator called selected two-part chromosome crossover (S-TCX), and swap mutation operator new individuals are generated. Finally, we give a numerical example on a randomly generated instance to illustrate our approach.

[1]  Nicolas Jozefowiez,et al.  The vehicle routing problem: Latest advances and new challenges , 2007 .

[2]  Barrie M. Baker,et al.  A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..

[3]  Gerrit K. Janssens,et al.  A Deterministic Annealing Algorithm for a Bi-Objective Full Truckload Vehicle Routing Problem in Drayage Operations , 2011 .

[4]  Michel Gendreau,et al.  A PARALLEL TABU SEARCH HEURISTIC FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 1997 .

[5]  Yanling Wang,et al.  Study on the model and tabu search algorithm for delivery and pickup vehicle routing problem with time windows , 2008, 2008 IEEE International Conference on Service Operations and Logistics, and Informatics.

[6]  Kamlesh Mathur,et al.  Vehicle Routing and Scheduling with Full Truckloads , 2003, Transp. Sci..

[7]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[8]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[9]  Keivan Ghoseiri,et al.  Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm , 2010, Appl. Soft Comput..

[10]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

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

[12]  Vili Podgorelec,et al.  A survey of genetic algorithms for solving multi depot vehicle routing problem , 2015, Appl. Soft Comput..

[13]  Gilbert Laporte,et al.  Vehicle routing with full loads , 1985, Comput. Oper. Res..

[14]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[15]  Jian Li,et al.  Full Truckload Vehicle Routing Problem with Profits , 2014 .

[16]  Franciszek Seredynski,et al.  A Genetic Algorithm with a Penalty Function in the Selective Travelling Salesman Problem on a Road Network , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[17]  Sara Ceschia,et al.  Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs , 2011, J. Sched..

[18]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[19]  Tsung-Che Chiang,et al.  A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows , 2014, Comput. Oper. Res..

[20]  Richard F. Hartl,et al.  New savings based algorithms for time constrained pickup and delivery of full truckloads , 2003, Eur. J. Oper. Res..

[21]  Zhang Lei,et al.  Savings Based Algorithm for Full Truckload Vehicle Routing Problem with Time Window , 2006 .

[22]  J. Dréo,et al.  Métaheuristiques pour l'optimisation difficile , 2003 .

[23]  Pengfei Zhou,et al.  A Container Vehicle Routing Model with Variable Traveling Time , 2007, 2007 IEEE International Conference on Automation and Logistics.

[24]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[25]  Charles Fleurent,et al.  Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[26]  Sun Guohua.  Modeling and algorithm for open vehicle routing problem with full-truckloads and time windows , 2012 .

[27]  Shoudong Huang,et al.  A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms , 2013, Eur. J. Oper. Res..

[28]  Xiangpei Hu,et al.  An improved ant colony optimization and its application to vehicle routing problem with time windows , 2012, Neurocomputing.

[29]  Jairo R. Montoya-Torres,et al.  A literature review on the vehicle routing problem with multiple , 2014 .

[30]  Ricardo Saraiva de Camargo,et al.  A Tabu Search Approach for the Prize Collecting Traveling Salesman Problem , 2013, Electron. Notes Discret. Math..

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

[32]  Chuan-Kang Ting,et al.  The selective pickup and delivery problem: Formulation and a memetic algorithm , 2013 .

[33]  Xiao Liu,et al.  Task Selection and Routing Problems In Collaborative Truckload Transportation , 2010 .

[34]  Zhangcan Huang,et al.  A Hybrid Algorithm for Vehicle Routing Problem with Time Windows , 2008, ISICA.

[35]  Cyrille Gueguen.  Méthodes de résolution exacte pour les problèmes de tournées de véhicules , 1999 .