Home > Research > Publications & Outputs > A Tabu Search algorithm for the vehicle routing...

Electronic data

  • TSforVRPDSPDP_Acepted by COR

    Rights statement: This is the author’s version of a work that was accepted for publication in Computers & Operations Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computers & Operations Research, 100, 2018 DOI: 10.1016/j.cor.2018.07.021

    Accepted author manuscript, 1 MB, PDF document

    Embargo ends: 24/01/20

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Links

Text available via DOI:

View graph of relations

A Tabu Search algorithm for the vehicle routing problem with discrete split deliveries and pickups

Research output: Contribution to journalJournal article

Published
Close
<mark>Journal publication date</mark>12/2018
<mark>Journal</mark>Computers and Operations Research
Volume100
Number of pages15
Pages (from-to)102-116
Publication statusPublished
Early online date24/07/18
Original languageEnglish

Abstract

The Vehicle Routing Problem with Discrete Split Deliveries and Pickups is a variant of the Vehicle Routing Problem with Split Deliveries and Pickups, in which customers’ demands are discrete in terms of batches (or orders). It exists in the practice of logistics distribution and consists of designing a least cost set of routes to serve a given set of customers while respecting constraints on the vehicles’ capacities. In this paper, its features are analyzed. A mathematical model and Tabu Search algorithm with specially designed batch combination and item creation operation are proposed. The batch combination operation is designed to avoid unnecessary travel costs, while the item creation operation effectively speeds up the search and enhances the algorithmic search ability. Computational results are provided and compared with other methods in the literature, which indicate that in most cases the proposed algorithm can find better solutions than those in the literature.

Bibliographic note

This is the author’s version of a work that was accepted for publication in Computers & Operations Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computers & Operations Research, 100, 2018 DOI: 10.1016/j.cor.2018.07.021