Using a hybrid heuristic to solve the balanced vehicle routing problem with loading constraints

• Main Authors: Carlos A. Vega-Mejía, Eliana María González-Neira, Jairo R. Montoya-Torres, Sardar M.N. Islam
• Format: Article
• Language: English
• Published: Growing Science 2019-11-01
• Series: International Journal of Industrial Engineering Computations
• Subjects: vehicle routing problem with loading constraints; hybrid heuristic; grasp; clarke and wright savings; practical loading and routing constraints
• Online Access: http://www.growingscience.com/ijiec/Vol11/IJIEC_2019_25.pdf

The Vehicle Routing Problem with Loading Constraints (VRPLC) is strongly related to real life applications in distribution logistics. It addresses the simultaneous loading and routing of vehicles, which are two crucial activities in transportation. Since treating these operations separately may result in impractical solutions, the development of applications for VRPLCs has gained the attention of researchers in recent years. Several heuristic methods have been proposed, but they consider only a limited group of practical characteristics that arise in real world situations. This study proposes a hybrid heuristic method based on the Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic and the Clarke and Wright Savings algorithm, to solve a VRPLC with several loading and routing constraints that have not been considered simultaneously before. Experimental results show that the proposed procedure produces competitive solutions in short processing times. Lastly, the impact of the added operational constraints is also analyzed.