The vehicle routing problem with restricted mixing of deliveries and pickups

Authors:
Gábor Nagy;Niaz A. Wassan;Saïd Salhi
Affiliations:
Centre for Logistics & Heuristic Optimisation, Kent Business School, University of Kent, Canterbury, UK;Centre for Logistics & Heuristic Optimisation, Kent Business School, University of Kent, Canterbury, UK;Centre for Logistics & Heuristic Optimisation, Kent Business School, University of Kent, Canterbury, UK
Venue:
Journal of Scheduling
Year:
2013

Citing 7
Cited 0

Vehicle routing with pick-up and delivery: tour-partitioning heuristics

Computers and Industrial Engineering
The vehicle routing problem

The vehicle routing problem
An Exact Method for the Vehicle Routing Problem with Backhauls

Transportation Science
An ant system algorithm for the mixed vehicle routing problem with backhauls

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

Journal of Scheduling
Reactive Search and Intelligent Optimization

Reactive Search and Intelligent Optimization
The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The vehicle routing problem with deliveries and pickups is one of the main problems within reverse logistics. This paper focuses on an important assumption that divides the literature on the topic, namely the restriction that all deliveries must be completed before pickups can be made. A generalised model is presented, together with a mathematical formulation and its resolution. The latter is carried out by adopting a suitable implementation of the reactive tabu search metaheuristic. Results show that significant savings can be achieved by allowing a mixture of delivery and pickup loads on-board and yet not incurring delays and driver inconvenience.