A hybrid metaheuristic for a real life vehicle routing problem

Authors:
Panagiotis P. Repoussis;Christos D. Tarantilis;George Ioannou
Affiliations:
Athens University of Economics & Business;Athens University of Economics & Business;Athens University of Economics & Business
Venue:
NMA'06 Proceedings of the 6th international conference on Numerical methods and applications
Year:
2006

Citing 3
Cited 1

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem

Computers and Operations Research
A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows

INFORMS Journal on Computing

A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a solution methodology to tackle a new realistic vehicle routing problem that incorporates heterogeneous fleet, multiple commodities and multiple vehicle compartments. The objective is to find minimum cost routes for a fleet of heterogeneous vehicles without violating capacity, loading and time window constraints. The solution methodology hybridizes in a reactive fashion systematic diversification mechanisms of Greedy Randomized Adaptive Search Procedures with Variable Neighborhood Search for intensification local search. Computational results reported justify the applicability of the methodology.