TY - JOUR
T1 - A simheuristic algorithm for solving the stochastic omnichannel vehicle routing problem with pick-up and delivery
AU - Martins, Leandro Do C.
AU - Bayliss, Christopher
AU - Copado-Méndez, Pedro J.
AU - Panadero, Javier
AU - Juan, Angel A.
N1 - Publisher Copyright:
© 2020 by the authors. Licensee MDPI, Basel, Switzerland.
PY - 2020/9
Y1 - 2020/9
N2 - Advances in information and communication technologies have made possible the emergence of new shopping channels. The so-called ‘omnichannel’ retailing mode allows customers to shop for products online and receive them at home. This paper focuses on the omnichannel delivery concept for the retailing industry, which addresses the replenishment of a set of retail stores and the direct shipment of the products to customers within an integrated vehicle routing formulation. Due to its NP-Hardness, a constructive heuristic, which is extended into a biased-randomized heuristic and which is embedded into a multi-start procedure, is introduced for solving the large-sized instances of the problem. Next, the problem is enriched by considering a more realistic scenario in which travel times are modeled as random variables. For dealing with the stochastic version of the problem, a simheuristic algorithm is proposed. A series of computational experiments contribute to illustrate how our simheuristic can provide reliable and low-cost solutions under uncertain conditions.
AB - Advances in information and communication technologies have made possible the emergence of new shopping channels. The so-called ‘omnichannel’ retailing mode allows customers to shop for products online and receive them at home. This paper focuses on the omnichannel delivery concept for the retailing industry, which addresses the replenishment of a set of retail stores and the direct shipment of the products to customers within an integrated vehicle routing formulation. Due to its NP-Hardness, a constructive heuristic, which is extended into a biased-randomized heuristic and which is embedded into a multi-start procedure, is introduced for solving the large-sized instances of the problem. Next, the problem is enriched by considering a more realistic scenario in which travel times are modeled as random variables. For dealing with the stochastic version of the problem, a simheuristic algorithm is proposed. A series of computational experiments contribute to illustrate how our simheuristic can provide reliable and low-cost solutions under uncertain conditions.
KW - Biased-randomized heuristics
KW - Omnichannel retail stores
KW - Pick-up and delivery
KW - Simheuristics
KW - Vehicle routing problem
UR - http://www.scopus.com/inward/record.url?scp=85092516634&partnerID=8YFLogxK
U2 - 10.3390/a13090237
DO - 10.3390/a13090237
M3 - Article
AN - SCOPUS:85092516634
SN - 1999-4893
VL - 13
JO - Algorithms
JF - Algorithms
IS - 9
M1 - 237
ER -