A heuristic method for the vehicle routing problem with mixed deliveries and pickups

The vehicle routing problem with deliveries and pickups is a challenging extension to the vehicle routing problem that lately attracted growing attention in the literature. This paper investigates the relationship between two versions of this problem, called “mixed” and “simultaneous”. In particular...

Full description

Saved in:
Bibliographic Details
Published inJournal of scheduling Vol. 11; no. 2; pp. 149 - 161
Main Authors Wassan, Niaz A., Nagy, Gábor, Ahmadi, Samad
Format Journal Article
LanguageEnglish
Published Boston Springer US 01.04.2008
Springer Nature B.V
Subjects
Algorithms
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control; Optimization
Commodities
Customers
Heuristic
Load
Motor vehicle fleets
Operations research
Operations Research/Decision Theory
Optimization
Routing
Studies
Supply Chain Management
Reactive tabu search
Deliveries and pickups
Vehicle routing
Heuristic
Online AccessGet full text

Cover

More Information
Summary:The vehicle routing problem with deliveries and pickups is a challenging extension to the vehicle routing problem that lately attracted growing attention in the literature. This paper investigates the relationship between two versions of this problem, called “mixed” and “simultaneous”. In particular, we wish to know whether a solution algorithm designed for the simultaneous case can solve the mixed case. To this end, we implement a metaheuristic based on reactive tabu search. The results suggest that this approach can yield good results.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-008-0055-y