Next Article in Journal
A New Oren–Nayar Shape-from-Shading Approach for 3D Reconstruction Using High-Order Godunov-Based Scheme
Previous Article in Journal
The NIRS Brain AnalyzIR Toolbox
Previous Article in Special Issue
A Multi-Stage Algorithm for a Capacitated Vehicle Routing Problem with Time Constraints
Article Menu

Export Article

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

Using Metaheuristics on the Multi-Depot Vehicle Routing Problem with Modified Optimization Criterion

Department of Tactics, University of Defence, 66210 Brno, Czech Republic
Received: 8 March 2018 / Revised: 16 May 2018 / Accepted: 17 May 2018 / Published: 18 May 2018
(This article belongs to the Special Issue Metaheuristics for Rich Vehicle Routing Problems)
View Full-Text   |   Download PDF [2663 KB, uploaded 18 May 2018]   |  

Abstract

This article deals with the modified Multi-Depot Vehicle Routing Problem (MDVRP). The modification consists of altering the optimization criterion. The optimization criterion of the standard MDVRP is to minimize the total sum of routes of all vehicles, whereas the criterion of modified MDVRP (M-MDVRP) is to minimize the longest route of all vehicles, i.e., the time to conduct the routing operation is as short as possible. For this problem, a metaheuristic algorithm—based on the Ant Colony Optimization (ACO) theory and developed by the author for solving the classic MDVRP instances—has been modified and adapted for M-MDVRP. In this article, an additional deterministic optimization process which further enhances the original ACO algorithm has been proposed. For evaluation of results, Cordeau’s benchmark instances are used. View Full-Text
Keywords: metaheuristic algorithm; ant colony optimization; multi-depot vehicle routing problem; time minimization; additional optimization process metaheuristic algorithm; ant colony optimization; multi-depot vehicle routing problem; time minimization; additional optimization process
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

Stodola, P. Using Metaheuristics on the Multi-Depot Vehicle Routing Problem with Modified Optimization Criterion. Algorithms 2018, 11, 74.

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