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

Wassan, N.A. and Nagy, G. and Ahmadi, S. (2008) A heuristic method for the vehicle routing problem with mixed deliveries and pickups. Journal of Scheduling, 11 (2). pp. 149-161. ISSN 1094-6136. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1007/s10951-008-0055-y

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.

Item Type: Article
Uncontrolled keywords: vehicle routing; deliveries and pickups; heuristic; reactive tabu search
Subjects: Q Science > Operations Research - Theory
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Niaz Ahmed Wassan
Date Deposited: 18 Mar 2009 17:37
Last Modified: 14 Jan 2010 14:38
Resource URI: http://kar.kent.ac.uk/id/eprint/10019 (The current URI for this page, for reference purposes)
  • Depositors only (login required):