Biased Random-Key Genetic Algorithm Applied to the Vehicle Routing Problem with Private Fleet and Common Carrier

Among the different classes of Vehicle Routing Problems are the Vehicle Routing Problems with Profits (VRPPs), where it is not mandatory to service all the customers. A relatively new VRPP is the VRPPFCC (Vehicle Routing Problem with Private Fleet and Common Carrier). In this problem, it is sometimes useful to directly serve only part of the shipping demand, outsourcing the rest of it to other companies. This paper presents the combination between the Biased Random-key Genetic Algorithm (BRKGA) and Random Variable Neighborhood Descent (RVND), a local search procedure, in the solution of the VRPPFCC. The implementation uses a vector of random keys as solution representation; thus a decoding heuristic is also developed, converting random keys to actual solutions for the VRPPFCC. Computational tests and conclusions focus on the comparison of the effectiveness of the methods, comparing their obtained solutions to the best known solutions for the problem.

[1]  Jean-Yves Potvin,et al.  A tabu search heuristic for the vehicle routing problem with private fleet and common carrier , 2009, Eur. J. Oper. Res..

[2]  Daniele Vigo,et al.  An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping , 2013, Transp. Sci..

[3]  Puca Huachi Vaz Penna,et al.  An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem , 2013, J. Heuristics.

[4]  Mauricio G. C. Resende,et al.  Biased random-key genetic algorithms for combinatorial optimization , 2011, J. Heuristics.

[5]  W. Spears,et al.  On the Virtues of Parameterized Uniform Crossover , 1995 .

[6]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[7]  Ching-Wu Chu,et al.  A heuristic algorithm for the truckload and less-than-truckload problem , 2005, Eur. J. Oper. Res..

[8]  Christian Prins,et al.  A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem , 2009, Bio-inspired Algorithms for the Vehicle Routing Problem.

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

[10]  Gilbert Laporte,et al.  A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers , 2008, J. Oper. Res. Soc..

[11]  Pierre Hansen,et al.  Variable neighborhood search , 1997, Eur. J. Oper. Res..

[12]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[13]  Manuel Laguna,et al.  Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search , 2006, Oper. Res..

[14]  Maria Teresinha Arns Steiner,et al.  Meta-heurísticas em pesquisa operacional , 2013 .

[15]  Jean-Yves Potvin,et al.  Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier , 2011, J. Oper. Res. Soc..

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

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

[18]  Michel Gendreau,et al.  A unified solution framework for multi-attribute vehicle routing problems , 2014, Eur. J. Oper. Res..

[19]  Paolo Toth,et al.  Vehicle Routing , 2014, Vehicle Routing.

[20]  James P. Kelly,et al.  The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results , 1998 .

[21]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[22]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[23]  Thibaut Vidal,et al.  Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits , 2014, Transp. Sci..