Next Article in Journal
Study on Multi-Objective Optimization-Based Climate Responsive Design of Residential Building
Next Article in Special Issue
Scheduling Algorithms for a Hybrid Flow Shop under Uncertainty
Previous Article in Journal
Special Issue “New Frontiers in Parameterized Complexity and Algorithms”: Foreward by the Guest Editors
Open AccessArticle

A Simheuristic Algorithm for Solving the Stochastic Omnichannel Vehicle Routing Problem with Pick-up and Delivery

Internet Interdisciplinary Institute (IN3)–Computer Science Department, Universitat Oberta de Catalunya, 08018 Barcelona, Spain
*
Author to whom correspondence should be addressed.
Algorithms 2020, 13(9), 237; https://doi.org/10.3390/a13090237
Received: 24 August 2020 / Revised: 14 September 2020 / Accepted: 15 September 2020 / Published: 19 September 2020
(This article belongs to the Special Issue Simulation-Optimization in Logistics, Transportation, and SCM)
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. View Full-Text
Keywords: omnichannel retail stores; vehicle routing problem; pick-up and delivery; biased-randomized heuristics; simheuristics omnichannel retail stores; vehicle routing problem; pick-up and delivery; biased-randomized heuristics; simheuristics
Show Figures

Figure 1

MDPI and ACS Style

Martins, L.d.C.; Bayliss, C.; Copado-Méndez, P.J.; Panadero, J.; Juan, A.A. A Simheuristic Algorithm for Solving the Stochastic Omnichannel Vehicle Routing Problem with Pick-up and Delivery. Algorithms 2020, 13, 237.

AMA Style

Martins LdC, Bayliss C, Copado-Méndez PJ, Panadero J, Juan AA. A Simheuristic Algorithm for Solving the Stochastic Omnichannel Vehicle Routing Problem with Pick-up and Delivery. Algorithms. 2020; 13(9):237.

Chicago/Turabian Style

Martins, Leandro d.C.; Bayliss, Christopher; Copado-Méndez, Pedro J.; Panadero, Javier; Juan, Angel A. 2020. "A Simheuristic Algorithm for Solving the Stochastic Omnichannel Vehicle Routing Problem with Pick-up and Delivery" Algorithms 13, no. 9: 237.

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop