Wassan, Niaz A., Nagy, Gábor, Ahmadi, Samad (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. (doi:10.1007/s10951-008-0055-y) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:10019)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
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 |
---|---|
DOI/Identification number: | 10.1007/s10951-008-0055-y |
Uncontrolled keywords: | vehicle routing; deliveries and pickups; heuristic; reactive tabu search |
Subjects: | Q Science > Operations Research - Theory |
Divisions: | Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems |
Depositing User: | Niaz Wassan |
Date Deposited: | 18 Mar 2009 17:37 UTC |
Last Modified: | 05 Nov 2024 09:43 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/10019 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):