Vehicle allocation problem with uncertain transportation requests over a multi-period rolling horizon

This work investigates optimization techniques for a multi-period vehicle allocation problem with uncertain transportation requests revealed sequentially over a rolling horizon. Policies derived from deterministic scenarios are compared: they are generated either by simple heuristics, or by more com...

Full description

Bibliographic Details
Main Authors: Yves Crama, Thierry Léon Augustin Pironet
Format: Article
Language:English
Published: BVL 2019-02-01
Series:Logistics Research
Subjects:
Online Access:https://www.bvl.de/lore/all-volumes--issues/volume-12/issue-1/vehicle-allocation-problem-with-uncertain-transportation-requests-over-a-multi-period-rolling-horizon
id doaj-ffbc505e55ce4ec1b843880e56197703
record_format Article
spelling doaj-ffbc505e55ce4ec1b843880e561977032020-11-24T21:32:32ZengBVLLogistics Research1865-035X1865-03682019-02-0112110.23773/2019_1Vehicle allocation problem with uncertain transportation requests over a multi-period rolling horizonYves Crama0Thierry Léon Augustin Pironet1QuantOM, HEC-Management School, University of Liège, BelgiumQuantOM, HEC-Management School, University of Liège, BelgiumThis work investigates optimization techniques for a multi-period vehicle allocation problem with uncertain transportation requests revealed sequentially over a rolling horizon. Policies derived from deterministic scenarios are compared: they are generated either by simple heuristics, or by more complex approaches, such as consensus and restricted expectation algorithms, or by network flow formulations over subtrees of scenarios. Myopic and a posteriori deterministic optimization models are used to compute bounds allowing for performance evaluation and for estimating the value of information. The economic benefit of the stochastic model is highlighted: our results show that the the information about future, uncertain orders contained in the stochastic part of the horizon can be used to generate improved profits. Robustness against misspecified probability distributions is examined. Subtree formulations produce the best results, are robust and can be solved efficiently, which makes them appropriate for industrial implementations.https://www.bvl.de/lore/all-volumes--issues/volume-12/issue-1/vehicle-allocation-problem-with-uncertain-transportation-requests-over-a-multi-period-rolling-horizontransportationvehicle allocationpick-up and deliverymulti-periodstochastic
collection DOAJ
language English
format Article
sources DOAJ
author Yves Crama
Thierry Léon Augustin Pironet
spellingShingle Yves Crama
Thierry Léon Augustin Pironet
Vehicle allocation problem with uncertain transportation requests over a multi-period rolling horizon
Logistics Research
transportation
vehicle allocation
pick-up and delivery
multi-period
stochastic
author_facet Yves Crama
Thierry Léon Augustin Pironet
author_sort Yves Crama
title Vehicle allocation problem with uncertain transportation requests over a multi-period rolling horizon
title_short Vehicle allocation problem with uncertain transportation requests over a multi-period rolling horizon
title_full Vehicle allocation problem with uncertain transportation requests over a multi-period rolling horizon
title_fullStr Vehicle allocation problem with uncertain transportation requests over a multi-period rolling horizon
title_full_unstemmed Vehicle allocation problem with uncertain transportation requests over a multi-period rolling horizon
title_sort vehicle allocation problem with uncertain transportation requests over a multi-period rolling horizon
publisher BVL
series Logistics Research
issn 1865-035X
1865-0368
publishDate 2019-02-01
description This work investigates optimization techniques for a multi-period vehicle allocation problem with uncertain transportation requests revealed sequentially over a rolling horizon. Policies derived from deterministic scenarios are compared: they are generated either by simple heuristics, or by more complex approaches, such as consensus and restricted expectation algorithms, or by network flow formulations over subtrees of scenarios. Myopic and a posteriori deterministic optimization models are used to compute bounds allowing for performance evaluation and for estimating the value of information. The economic benefit of the stochastic model is highlighted: our results show that the the information about future, uncertain orders contained in the stochastic part of the horizon can be used to generate improved profits. Robustness against misspecified probability distributions is examined. Subtree formulations produce the best results, are robust and can be solved efficiently, which makes them appropriate for industrial implementations.
topic transportation
vehicle allocation
pick-up and delivery
multi-period
stochastic
url https://www.bvl.de/lore/all-volumes--issues/volume-12/issue-1/vehicle-allocation-problem-with-uncertain-transportation-requests-over-a-multi-period-rolling-horizon
work_keys_str_mv AT yvescrama vehicleallocationproblemwithuncertaintransportationrequestsoveramultiperiodrollinghorizon
AT thierryleonaugustinpironet vehicleallocationproblemwithuncertaintransportationrequestsoveramultiperiodrollinghorizon
_version_ 1725957157494456320