An ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windows

This paper presents a solution methodology to solve the heterogeneous vehicle routing problem with time windows (HVRPTW). This problem appears when a limited fleet of vehicles, characterized by different capacities, fixed costs and variable costs, is available for serving a set of customers which ha...

Descripción completa

Detalles Bibliográficos
Autores: Molina Gómez, José Carlos, Salmerón, José L., Eguía Salinas, Ignacio
Tipo de recurso: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2020
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/154264
Acceso en línea:https://hdl.handle.net/11441/154264
https://doi.org/10.1016/j.eswa.2020.113379
Access Level:acceso abierto
Palabra clave:Heterogeneous VRPTW
Ant colony system
Memetic algorithms
VNTS
id ES_a3db6907b3e98498cfd78bcc4cc4d95b
oai_identifier_str oai:idus.us.es:11441/154264
network_acronym_str ES
network_name_str España
repository_id_str
spelling An ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windowsMolina Gómez, José CarlosSalmerón, José L.Eguía Salinas, IgnacioHeterogeneous VRPTWAnt colony systemMemetic algorithmsVNTSThis paper presents a solution methodology to solve the heterogeneous vehicle routing problem with time windows (HVRPTW). This problem appears when a limited fleet of vehicles, characterized by different capacities, fixed costs and variable costs, is available for serving a set of customers which have to be visited within a predefined time window. The objective is to perform the route design minimizing the total fixed vehicle costs and distribution costs and satisfying all problem constraints. The problem is solved using an Ant Colony System (ACS) algorithm which has been successfully applied to combinatorial optimization problems. Moreover, to improve the performance of the ACS on the HVRPTW, a hybridized ACS with local search, called memetic ACS algorithm is proposed where the local search is performed by a variable neighborhood Tabu Search algorithm. Experiments are conducted on sets of benchmark instances from the scientific literature to evaluate the performance of the proposed algorithm. The results show that the algorithm has a good performance on the HVRPTW. In particular, out of the 80 instances, it obtained 65 new best solutions and matched 6 within reasonable computational times.Junta de Andalucía P10-TEP-6332ElsevierOrganización Industrial y Gestión de Empresas ITEP216: Tecnologías de la Información e Ingeniería de OrganizaciónJunta de Andalucía2020info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/154264https://doi.org/10.1016/j.eswa.2020.113379reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésExpert Systems with Applications, 157, 113379.P10-TEP-6332https://www.sciencedirect.com/science/article/pii/S0957417420302037info:eu-repo/semantics/openAccessoai:idus.us.es:11441/1542642026-06-17T12:51:07Z
dc.title.none.fl_str_mv An ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windows
title An ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windows
spellingShingle An ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windows
Molina Gómez, José Carlos
Heterogeneous VRPTW
Ant colony system
Memetic algorithms
VNTS
title_short An ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windows
title_full An ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windows
title_fullStr An ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windows
title_full_unstemmed An ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windows
title_sort An ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windows
dc.creator.none.fl_str_mv Molina Gómez, José Carlos
Salmerón, José L.
Eguía Salinas, Ignacio
author Molina Gómez, José Carlos
author_facet Molina Gómez, José Carlos
Salmerón, José L.
Eguía Salinas, Ignacio
author_role author
author2 Salmerón, José L.
Eguía Salinas, Ignacio
author2_role author
author
dc.contributor.none.fl_str_mv Organización Industrial y Gestión de Empresas I
TEP216: Tecnologías de la Información e Ingeniería de Organización
Junta de Andalucía
dc.subject.none.fl_str_mv Heterogeneous VRPTW
Ant colony system
Memetic algorithms
VNTS
topic Heterogeneous VRPTW
Ant colony system
Memetic algorithms
VNTS
description This paper presents a solution methodology to solve the heterogeneous vehicle routing problem with time windows (HVRPTW). This problem appears when a limited fleet of vehicles, characterized by different capacities, fixed costs and variable costs, is available for serving a set of customers which have to be visited within a predefined time window. The objective is to perform the route design minimizing the total fixed vehicle costs and distribution costs and satisfying all problem constraints. The problem is solved using an Ant Colony System (ACS) algorithm which has been successfully applied to combinatorial optimization problems. Moreover, to improve the performance of the ACS on the HVRPTW, a hybridized ACS with local search, called memetic ACS algorithm is proposed where the local search is performed by a variable neighborhood Tabu Search algorithm. Experiments are conducted on sets of benchmark instances from the scientific literature to evaluate the performance of the proposed algorithm. The results show that the algorithm has a good performance on the HVRPTW. In particular, out of the 80 instances, it obtained 65 new best solutions and matched 6 within reasonable computational times.
publishDate 2020
dc.date.none.fl_str_mv 2020
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/acceptedVersion
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/154264
https://doi.org/10.1016/j.eswa.2020.113379
url https://hdl.handle.net/11441/154264
https://doi.org/10.1016/j.eswa.2020.113379
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Expert Systems with Applications, 157, 113379.
P10-TEP-6332
https://www.sciencedirect.com/science/article/pii/S0957417420302037
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869415432129085440
score 15,300719

Similares en LA Referencia