A dynamic game approach for the vehicle routing problem with returns

In this article, a dynamic game approach is proposed to deal with the vehicle routing problem with random product returns. A mixed-integer programming model is developed. Then, a three-phase procedure is designed for sequencing the delivery with random returns. The first phase uses a local search-ba...

Full description

Saved in:
Bibliographic Details
Published in:Engineering optimization 2023-06, Vol.55 (6), p.891-906
Main Authors: Tuyen, Do Thi Thanh, Van Hop, Nguyen
Format: Article
Language:English
Subjects:
game theory
Integer programming
Mixed integer
product returns
Vehicle routing
Vehicle routing problem
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this article, a dynamic game approach is proposed to deal with the vehicle routing problem with random product returns. A mixed-integer programming model is developed. Then, a three-phase procedure is designed for sequencing the delivery with random returns. The first phase uses a local search-based procedure to generate the initial delivery sequence without returns. Then, the estimated probability of return is embedded in the game model to choose the best near Nash equilibrium solution to modify the delivery sequence. Finally, the distribution sequence is updated with the actual returns for the best-expected pay-off solution. To confirm the advantage of the proposed method, numerical experiments and sensitivity analyses are conducted for a real case of an e-commerce company in Viet Nam.
ISSN:0305-215X
1029-0273
DOI:10.1080/0305215X.2022.2048829