Using metaheuristics on the multi-depot vehicle routing problem with modified optimization criterion

DOI10.3390/A11050074zbMath1461.90016OpenAlexW2803548656WikidataQ129788091 ScholiaQ129788091MaRDI QIDQ2283871

Petr Stodola

Publication date: 13 January 2020

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a11050074

zbMATH Keywords

ant colony optimizationmulti-depot vehicle routing problemmetaheuristic algorithmtime minimizationadditional optimization process

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Route optimization cold chain logistic distribution using greedy search method ⋮ Hybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problem ⋮ A heuristic algorithm for the routing and scheduling problem with time windows: a case study of the automotive industry in Mexico

Uses Software

• VRP
• METSlib

Cites Work

• Unnamed Item
• The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
• Heuristic solutions to multi-depot location-routing problems
• A tabu search heuristic for the multi-depot vehicle routing problem
• Dynamic vehicle routing using genetic algorithms
• The Truck Dispatching Problem
• A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems

This page was built for publication: Using metaheuristics on the multi-depot vehicle routing problem with modified optimization criterion