An efficient evolutionary algorithm for the orienteering problem

This paper deals with the Orienteering Problem, which is a routing problem. In the Orienteering Problem, each node has a profit assigned and the goal is to find the route that maximizes the total collected profit subject to a limitation on the total route distance. To solve this problem, we propose...

ver descrição completa

Detalhes bibliográficos
Autores: Kobeaga, G., Merino, M., Lozano, J.A.
Formato: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2017
País:España
Recursos:Basque Center for Applied Mathematics (BCAM)
Repositorio:BIRD. BCAM's Institutional Repository Data
OAI Identifier:oai:bird.bcamath.org:20.500.11824/730
Acesso em linha:http://hdl.handle.net/20.500.11824/730
Access Level:acceso abierto
Palavra-chave:Orienteering Problem
Travelling Salesperson Problem
Evolutionary Algorithm
Combinatorial Optimization
id ES_afe1efdef85eee12225d95fbf7b1e07d
oai_identifier_str oai:bird.bcamath.org:20.500.11824/730
network_acronym_str ES
network_name_str España
repository_id_str
spelling An efficient evolutionary algorithm for the orienteering problemKobeaga, G.Merino, M.Lozano, J.A.Orienteering ProblemTravelling Salesperson ProblemEvolutionary AlgorithmCombinatorial OptimizationThis paper deals with the Orienteering Problem, which is a routing problem. In the Orienteering Problem, each node has a profit assigned and the goal is to find the route that maximizes the total collected profit subject to a limitation on the total route distance. To solve this problem, we propose an evolutionary algorithm, whose key characteristic is to maintain unfeasible solutions during the search. Furthermore, it includes a novel solution codification for the Orienteering Problem, a novel heuristic for node inclusion in the route, an adaptation of the Edge Recombination crossover developed for the Travelling Salesperson Problem, specific operators to recover the feasibility of solutions when required, and the use of the Lin-Kernighan heuristic to improve the route lengths. We compare our algorithm with three state-of-the-art algorithms for the problem on 344 benchmark instances, with up to 7397 nodes. The results show a competitive behavior of our approach in instances of low-medium dimensionality, and outstanding results in the large dimensionality instances reaching new best known solutions with lower computational time than the state-of-the-art algorithms.MTM2015-65317-P, TIN2016-78365-R, IT-609-13, IT-928-16, UFI BETS 2011201720172017info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionapplication/pdfhttp://hdl.handle.net/20.500.11824/730reponame:BIRD. BCAM's Institutional Repository Datainstname:Basque Center for Applied Mathematics (BCAM)Ingléshttps://linkinghub.elsevier.com/retrieve/pii/S0305054817302241info:eu-repo/grantAgreement/MINECO//SEV-2013-0323info:eu-repo/grantAgreement/Gobierno Vasco/BERC/BERC.2014-2017Reconocimiento-NoComercial-CompartirIgual 3.0 Españahttp://creativecommons.org/licenses/by-nc-sa/3.0/es/info:eu-repo/semantics/openAccessoai:bird.bcamath.org:20.500.11824/7302026-06-19T12:47:47Z
dc.title.none.fl_str_mv An efficient evolutionary algorithm for the orienteering problem
title An efficient evolutionary algorithm for the orienteering problem
spellingShingle An efficient evolutionary algorithm for the orienteering problem
Kobeaga, G.
Orienteering Problem
Travelling Salesperson Problem
Evolutionary Algorithm
Combinatorial Optimization
title_short An efficient evolutionary algorithm for the orienteering problem
title_full An efficient evolutionary algorithm for the orienteering problem
title_fullStr An efficient evolutionary algorithm for the orienteering problem
title_full_unstemmed An efficient evolutionary algorithm for the orienteering problem
title_sort An efficient evolutionary algorithm for the orienteering problem
dc.creator.none.fl_str_mv Kobeaga, G.
Merino, M.
Lozano, J.A.
author Kobeaga, G.
author_facet Kobeaga, G.
Merino, M.
Lozano, J.A.
author_role author
author2 Merino, M.
Lozano, J.A.
author2_role author
author
dc.subject.none.fl_str_mv Orienteering Problem
Travelling Salesperson Problem
Evolutionary Algorithm
Combinatorial Optimization
topic Orienteering Problem
Travelling Salesperson Problem
Evolutionary Algorithm
Combinatorial Optimization
description This paper deals with the Orienteering Problem, which is a routing problem. In the Orienteering Problem, each node has a profit assigned and the goal is to find the route that maximizes the total collected profit subject to a limitation on the total route distance. To solve this problem, we propose an evolutionary algorithm, whose key characteristic is to maintain unfeasible solutions during the search. Furthermore, it includes a novel solution codification for the Orienteering Problem, a novel heuristic for node inclusion in the route, an adaptation of the Edge Recombination crossover developed for the Travelling Salesperson Problem, specific operators to recover the feasibility of solutions when required, and the use of the Lin-Kernighan heuristic to improve the route lengths. We compare our algorithm with three state-of-the-art algorithms for the problem on 344 benchmark instances, with up to 7397 nodes. The results show a competitive behavior of our approach in instances of low-medium dimensionality, and outstanding results in the large dimensionality instances reaching new best known solutions with lower computational time than the state-of-the-art algorithms.
publishDate 2017
dc.date.none.fl_str_mv 2017
2017
2017
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 http://hdl.handle.net/20.500.11824/730
url http://hdl.handle.net/20.500.11824/730
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv https://linkinghub.elsevier.com/retrieve/pii/S0305054817302241
info:eu-repo/grantAgreement/MINECO//SEV-2013-0323
info:eu-repo/grantAgreement/Gobierno Vasco/BERC/BERC.2014-2017
dc.rights.none.fl_str_mv Reconocimiento-NoComercial-CompartirIgual 3.0 España
http://creativecommons.org/licenses/by-nc-sa/3.0/es/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Reconocimiento-NoComercial-CompartirIgual 3.0 España
http://creativecommons.org/licenses/by-nc-sa/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:BIRD. BCAM's Institutional Repository Data
instname:Basque Center for Applied Mathematics (BCAM)
instname_str Basque Center for Applied Mathematics (BCAM)
reponame_str BIRD. BCAM's Institutional Repository Data
collection BIRD. BCAM's Institutional Repository Data
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869416722797166592
score 15,301603

Registos relacionados