HighlightsA MILP formulation and a reduction procedure are proposed for the green vehicle routing problem.The proposed solution approach solves medium-sized instances using a general-purpose solver.The exact approach outperforms a state-of-the-art branch-and-cut algorithm.
AbstractGreen vehicle routing (GVRP) is an active research area that is concerned with the development and analysis of distribution activities with eco-friendly vehicles. We propose a practical solution approach for the GVRP that uses a mixed-integer linear formulation and a reduction procedure. The newly formulation offers two significant advantages: compactness and flexibility. We provide empirical evidence that the formulation and the reduction procedure enable to derive optimal solutions for medium-sized instances using a general-purpose solver. We show that the proposed exact approach consistently outperforms a state-of-the-art branch-and-cut algorithm and constitutes an appealing and practical alternative for optimally solving GVRPs.
A practical solution approach for the green vehicle routing problem
2017-06-02
16 pages
Article (Journal)
Electronic Resource
English
Initial Solution Constructors for Capacitated Green Vehicle Routing Problem
British Library Conference Proceedings | 2021
|A Green Vehicle Routing Problem
Elsevier | 2011
|A Green Vehicle Routing Problem
Online Contents | 2012
|Interactive Heuristic for Practical Vehicle Routing Problem with Solution Shape Constraints
Transportation Research Record | 2006
|Interactive Heuristic for Practical Vehicle Routing Problem with Solution Shape Constraints
Transportation Research Record | 2006
|