Waiting and Relocation Strategies in Online Stochastic Vehicle Routing
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 1816-1820.
Abstract
This paper considers online stochastic multiple vehicle routing with time windows in which requests arrive dynamically and the goal is to maximize the number of serviced customers. Contrary to earlier algorithms which only move vehicles to known customers, this paper investigates waiting and relocation strategies in which vehicles may wait at their current location or relocate to arbitrary sites. Experimental results show that waiting and relocation strategies may dramatically improve customer service, especially for problems that are highly dynamic and contain many late requests. The decisions to wait and to relocate do not exploit any problem-specific features but rather are obtained by including choices in the online algorithm that are necessarily sub-optimal in an offline setting.
@inproceedings{ijcai2007p293,
title = {Waiting and Relocation Strategies in Online Stochastic Vehicle Routing},
author = {Bent, Russell and Van Hentenryck, Pascal},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {1816--1820},
year = {2007},
url = {https://ijcai.org/proceedings/2007/293},
}
TY - CPAPER TI - Waiting and Relocation Strategies in Online Stochastic Vehicle Routing AU - Bent, Russell AU - Van Hentenryck, Pascal T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 1816 EP - 1820 UR - https://ijcai.org/proceedings/2007/293 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
