Journal ArticleDOI
The multi-depot vehicle routing problem with heterogeneous vehicle fleet
TLDR
An efficient implementation of variable neighborhood search that incorporates new features in addition to the adaptation of several existing neighborhoods and local search operators is proposed, including a preprocessing scheme for identifying borderline customers, and a neighborhood reduction test that saves nearly 80% of the CPU time, especially on the large instances.About:
This article is published in Computers & Operations Research.The article was published on 2014-12-01. It has received 159 citations till now. The article focuses on the topics: Vehicle routing problem & Static routing.read more
Citations
More filters
Journal ArticleDOI
The vehicle routing problem
TL;DR: This classification is the first to categorize the articles of the VRP literature to this level of detail and is based on an adapted version of an existing comprehensive taxonomy.
Journal ArticleDOI
Survey of Green Vehicle Routing Problem: Past and future trends
TL;DR: The purpose is to review the most up-to-date state-of-the-art of GVRP, discuss how the traditional VRP variants can interact with G VRP and offer an insight into the next wave of research into GVRp.
Journal ArticleDOI
A literature review on the vehicle routing problem with multiple depots
Jairo R. Montoya-Torres,Julián López Franco,Santiago Nieto Isaza,Heriberto Felizzola Jiménez,Nilson Herazo-Padilla +4 more
TL;DR: A state-of-the-art survey on the vehicle routing problem with multiple depots (MDVRP) is presented, considered papers published between 1988 and 2014, in which several variants of the model are studied.
Journal ArticleDOI
Thirty years of heterogeneous vehicle routing
TL;DR: The aim of this survey paper is to classify and review the literature on heterogeneous vehicle routing problems, and presents a comparative analysis of the metaheuristic algorithms that have been proposed for these problems.
Journal ArticleDOI
An improved ant colony optimization algorithm for the multi-depot green vehicle routing problem with multiple objectives
TL;DR: A multi-depot green vehicle routing problem (MDGVRP) is developed by maximizing revenue and minimizing costs, time and emission, and an improved ant colony optimization (IACO) algorithm is applied that aims to efficiently solve the problem.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
Variable neighborhood search
Nenad Mladenović,Pierre Hansen +1 more
TL;DR: This chapter presents the basic schemes of VNS and some of its extensions, and presents five families of applications in which VNS has proven to be very successful.
Journal ArticleDOI
Computer solutions of the traveling salesman problem
TL;DR: Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer and are based on a general heuristic approach believed to be of general applicability to various optimization problems.
Journal ArticleDOI
A general heuristic for vehicle routing problems
David Pisinger,Stefan Ropke +1 more
TL;DR: A unified heuristic which is able to solve five different variants of the vehicle routing problem and shown promising results for a large class of vehicle routing problems with backhauls as demonstrated in Ropke and Pisinger.