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

Authors:
Niaz A. Wassan;Gábor Nagy;Samad Ahmadi
Affiliations:
Centre for Heuristic Optimisation, Kent Business School, The University of Kent, Canterbury, UK;Centre for Heuristic Optimisation, Kent Business School, The University of Kent, Canterbury, UK;School of Computing, De Montfort University, Leicester, UK
Venue:
Journal of Scheduling
Year:
2008

Citing 5
Cited 2

Heuristics for the traveling salesman problem with pickup and delivery

Computers and Operations Research
VRP with backhauls

The vehicle routing problem
Tabu Search

Tabu Search
An ant system algorithm for the mixed vehicle routing problem with backhauls

Metaheuristics
A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service

Computers and Operations Research

The vehicle routing problem with restricted mixing of deliveries and pickups

Journal of Scheduling
A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.