A simheuristic algorithm for the capacitated location routing problem with stochastic demands

Carlos L. Quintero-Araujo, Daniel Guimarans and Angel Juan

Journal of Simulation, 2021, vol. 15, issue 3, 217-234

Abstract: The capacitated location routing problem (CLRP) integrates a facility location problem with a multi-depot vehicle routing problem. We consider the CLRP with stochastic demands, whose specific values are only revealed upon reaching each customer. The main goal is to minimise the expected costs of: (i) opening facilities, (ii) using a fleet of vehicles, (iii) executing a routing plan, and (iv) applying corrective actions. The latter are required whenever a route failure occurs due to unexpected high demands. We propose a simheuristic algorithm hybridizing simulation with an iterated local search metaheuristic, aimed at: (i) proposing a safety-stock policy to diminish the likelihood of route failure; and, (ii) estimating the expected cost and the reliability of each “elite” solution. We assess our approach on classical CLRP benchmarks, which are later extended to consider demand uncertainty. Finally, we also discuss the effects of the safety-stock policy on costs and reliability.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/17477778.2019.1680262 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjsmxx:v:15:y:2021:i:3:p:217-234

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjsm20

DOI: 10.1080/17477778.2019.1680262

Access Statistics for this article

Journal of Simulation is currently edited by Christine Currie

More articles in Journal of Simulation from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().