Next Article in Journal
Estimating Functional Connectivity Symmetry between Oxy- and Deoxy-Haemoglobin: Implications for fNIRS Connectivity Analysis
Next Article in Special Issue
Using Metaheuristics on the Multi-Depot Vehicle Routing Problem with Modified Optimization Criterion
Previous Article in Journal
Hybrid Flow Shop with Unrelated Machines, Setup Time, and Work in Progress Buffers for Bi-Objective Optimization of Tortilla Manufacturing
Previous Article in Special Issue
Safe Path Planning of Mobile Robot Based on Improved A* Algorithm in Complex Terrains
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(5), 69; https://doi.org/10.3390/a11050069

A Multi-Stage Algorithm for a Capacitated Vehicle Routing Problem with Time Constraints

DIME—Department of Mechanical Engineering, Energetics, Management and Transportation, Polytechnic School, University of Genoa, 16145 Genoa, Italy
*
Author to whom correspondence should be addressed.
Received: 28 February 2018 / Revised: 16 April 2018 / Accepted: 16 April 2018 / Published: 10 May 2018
(This article belongs to the Special Issue Metaheuristics for Rich Vehicle Routing Problems)
View Full-Text   |   Download PDF [1556 KB, uploaded 11 May 2018]   |  

Abstract

The Vehicle Routing Problem (VRP) is one of the most optimized tasks studied and it is implemented in a huge variety of industrial applications. The objective is to design a set of minimum cost paths for each vehicle in order to serve a given set of customers. Our attention is focused on a variant of VRP, the capacitated vehicle routing problem when applied to natural gas distribution networks. Managing natural gas distribution networks includes facing a variety of decisions ranging from human resources and material resources to facilities, infrastructures, and carriers. Despite the numerous papers available on vehicle routing problem, there are only a few that study and analyze the problems occurring in capillary distribution operations such as those found in a metropolitan area. Therefore, this work introduces a new algorithm based on the Saving Algorithm heuristic approach which aims to solve a Capacitated Vehicle Routing Problem with time and distance constraints. This joint algorithm minimizes the transportation costs and maximizes the workload according to customer demand within the constraints of a time window. Results from a real case study in a natural gas distribution network demonstrates the effectiveness of the approach. View Full-Text
Keywords: vehicle routing problem (VRP), capacitated vehicle routing problem (CVRP), natural gas distribution networks vehicle routing problem (VRP), capacitated vehicle routing problem (CVRP), natural gas distribution networks
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Cassettari, L.; Demartini, M.; Mosca, R.; Revetria, R.; Tonelli, F. A Multi-Stage Algorithm for a Capacitated Vehicle Routing Problem with Time Constraints. Algorithms 2018, 11, 69.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top