Using a hybrid heuristic to solve the balanced vehicle routing problem with loading constraints
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 resu...
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: | |
Online Access: | http://www.growingscience.com/ijiec/Vol11/IJIEC_2019_25.pdf |
Similar Items
-
PROPOSAL OF ALGORITHM FOR ROUTE OPTIMIZATION
by: Robert Ramon de Carvalho Sousa, et al.
Published: (2016-06-01) -
An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem
by: L. Caccetta, et al.
Published: (2013-04-01) -
An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem
by: L. Caccetta, et al.
Published: (2013-04-01) -
An insertion heuristic for the capacitated vehicle routing problem with loading constraints and mixed linehauls and backhauls
by: Pinto Telmo, et al.
Published: (2015-01-01) -
QoS Routing With Multiple Constraints
by: Jishnu, A
Published: (2011)