Vehicle Routing Problem (VRP) is an operational management problem in the field of distribution and logistics. In VRPs, routes have to be designed starting from a depot to the geographically spread customer zones with an objective to minimize distance or cost and fulfilling the customer demands. The customers are assigned to a route without violating the capacity of the vehicle. Heterogeneous fleet vehicle routing problem is a kind of VRP that uses vehicles with different capacity. In this study, the real data is obtained from one of the major distribution agency that distributes the Liquefied Petroleum Gas (LPG) cylinders in a Northern district of Kerala. The heterogeneous vehicle routing problem is solved by using Clarke and Wright Algorithm and the solution is compared with that of LINGO solution.
Solving a Heterogeneous Fleet Vehicle Routing Model - A practical approach
2018-07-01
436243 byte
Conference paper
Electronic Resource
English
Heterogeneous fixed fleet vehicle routing considering carbon emission
Online Contents | 2013
|Papers on the heterogeneous fixed fleet vehicle routing problem.
ORKG Comparisons | 2020
A Constraint Programming Model for the Open Vehicle Routing Problem with Heterogeneous Vehicle Fleet
Springer Verlag | 2023
|