Efficient stochastic hybrid heuristics for the multi-depot vehicle routing problem

Authors:
M. Mirabi;S. M. T. Fatemi Ghomi;F. Jolai
Affiliations:
Department of Industrial Engineering, Faculty of Engineering, Yazd University, Yazd, P.O. Box 89195-741, Iran;Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran;Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
Venue:
Robotics and Computer-Integrated Manufacturing
Year:
2010

Citing 6
Cited 4

A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions

American Journal of Mathematical and Management Sciences - Special issue: vehicle routing 2000: advances in time windows, optimality, fast bounds, & multi-depot routing
A tabu search heuristic for the multi-depot vehicle routing problem

Computers and Operations Research
Heuristic solutions to multi-depot location-routing problems

Computers and Operations Research
A dynamic vehicle routing problem with time-dependent travel times

Computers and Operations Research
A general heuristic for vehicle routing problems

Computers and Operations Research
A hybrid genetic algorithm for the multi-depot vehicle routing problem

Engineering Applications of Artificial Intelligence

A variable neighborhood search for the multi-depot vehicle routing problem with loading cost

Expert Systems with Applications: An International Journal
High-Level Relay Hybrid Metaheuristic Method for Multi-Depot Vehicle Routing Problem with Time Windows

Journal of Mathematical Modelling and Algorithms
Incremental multiple-scan chain ordering for ECO flip-flop insertion

Proceedings of the International Conference on Computer-Aided Design
Improved Shuffled Frog Leaping Algorithm and its multi-phase model for multi-depot vehicle routing problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.03

Visualization

Abstract

The paper addresses the problem of multi-depot vehicle routing in order to minimize the delivery time of vehicle objective. Three hybrid heuristics are presented to solve the multi-depot vehicle routing problem. Each hybrid heuristic combines elements from both constructive heuristic search and improvement techniques. The improvement techniques are deterministic, stochastic and simulated annealing (SA) methods. Experiments are run on a number of randomly generated test problems of varying depots and customer sizes. Our heuristics are shown to outperform one of the best-known existing heuristic. Statistical tests of significance are performed to substantiate the claims of improvement.