The Library
Dynamic multi-period vehicle routing with touting
Tools
Keskin, Merve, Branke, Juergen, Deineko, Vladimir G. and Strauss, Arne (2023) Dynamic multi-period vehicle routing with touting. European Journal of Operational Research, 310 (1). pp. 168-184. doi:10.1016/j.ejor.2023.02.037 ISSN 0377-2217.
|
PDF
WRAP-dynamic-multi-period-vehicle-routing-touting-2023.pdf - Published Version - Requires a PDF viewer. Available under License Creative Commons Attribution 4.0. Download (1804Kb) | Preview |
|
PDF
WRAP-dynamic-multi-period-vehicle-routing-touting-2023.pdf - Accepted Version Embargoed item. Restricted access to Repository staff only - Requires a PDF viewer. Download (2769Kb) |
Official URL: https://doi.org/10.1016/j.ejor.2023.02.037
Abstract
This paper introduces a dynamic multi-period vehicle routing problem with touting as demand management technique, where customers that have not yet placed an order can be actively encouraged to order a service sooner. Touting the right customers, such as those located nearby customers who already placed orders, allows for more efficient routes over time. However, it also increases the frequency of visits at such touted customers as they are serviced before they would normally require, which leads to smaller demand volumes per visit. To tackle this trade-off, we propose several strategies to decide which customers to tout and when, using the characteristics of the customers as well as the current plan at the time of touting. Specifically, using the demand and the location information, we approach the ones which are close to the current tour, relatively far from the depot and not likely to easily be covered in the near future. This information is then used as a part of different touting strategies, which are further embedded in a rolling-time horizon vehicle routing algorithm to address the multi-period nature of the problem. These different strategies are empirically compared in a simulation based on a real-world waste collection problem. We demonstrate that touting indeed allows to significantly reduce the travel distance in a dynamic vehicle routing problem.
Item Type: | Journal Article | ||||||||
---|---|---|---|---|---|---|---|---|---|
Subjects: | H Social Sciences > HE Transportation and Communications Q Science > QA Mathematics Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software |
||||||||
Divisions: | Faculty of Social Sciences > Warwick Business School | ||||||||
Library of Congress Subject Headings (LCSH): | Vehicle routing problem -- Mathematical models, Transportation demand management, Metaheuristics | ||||||||
Journal or Publication Title: | European Journal of Operational Research | ||||||||
Publisher: | Elsevier Science BV | ||||||||
ISSN: | 0377-2217 | ||||||||
Official Date: | 1 October 2023 | ||||||||
Dates: |
|
||||||||
Volume: | 310 | ||||||||
Number: | 1 | ||||||||
Page Range: | pp. 168-184 | ||||||||
DOI: | 10.1016/j.ejor.2023.02.037 | ||||||||
Status: | Peer Reviewed | ||||||||
Publication Status: | Published | ||||||||
Access rights to Published version: | Open Access (Creative Commons) | ||||||||
Date of first compliant deposit: | 9 March 2023 | ||||||||
Date of first compliant Open Access: | 9 March 2023 | ||||||||
RIOXX Funder/Project Grant: |
|
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |
Downloads
Downloads per month over past year