The location routing problem using electric vehicles with constrained distance
Almouhanna, Abdullah (University of Portsmouth. Department of Mathematics)
Quintero Araujo, Carlos Leonardo (Universidad de La Sabana. International School of Economics and Administrative Sciences)
Panadero, Javier (Universitat Oberta de Catalunya. Internet Interdisciplinary Institute (IN3))
Khosravi, Banafsheh (University of Portsmouth. Department of Mathematics)
Ouelhadj, Djamila (University of Portsmouth. Department of Mathematics)
Juan, Ángel A (Universitat Oberta de Catalunya. Internet Interdisciplinary Institute (IN3))

Data:	2020
Descripció:	16 pàg.
Resum:	The introduction of Electric Vehicles (EVs) in modern fleets facilitates a shift towards greener road transportation practices. However, the driving ranges of EVs are limited by the duration of their batteries, which raises some operational challenges. This paper discusses the Location Routing Problem with a Constrained Distance (LRPCD), which is a natural extension of the Location Routing Problem when EVs are utilized. A fast multi-start heuristic and a metaheuristic are proposed to solve the LRPCD. The former combines biased-randomization techniques with the well-known Tillman's heuristic for the Multi-Depot Vehicle Routing Problem. The latter incorporates the biased-randomized approach into the Variable Neighborhood Search (VNS) framework. A series of computational experiments show that the multi-start heuristic is able to generate good-quality solutions in just a few seconds, while the biased-rendomized VNS metaheuristic provides higher-quality solutions by employing more computational time.
Ajuts:	Ministerio de Economía y Competitividad TRA2015-71883-REDT
Drets:	Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, i la comunicació pública de l'obra, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original. No es permet la creació d'obres derivades.
Llengua:	Anglès
Document:	Article ; recerca ; Versió acceptada per publicar
Matèria:	Biased randomization ; Green logistics ; Location routing problem ; Variable neighborhood search
Publicat a:	Computers and Operations Research, Vol. 115 (March 2020) , art. 104864, ISSN 1873-765X

DOI: 10.1016/j.cor.2019.104864

Postprint 35 p, 682.2 KB

El registre apareix a les col·leccions:
Articles > Articles de recerca
Articles > Articles publicats