A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem.
Autor(a) principal: | |
---|---|
Data de Publicação: | 2016 |
Outros Autores: | , , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UFOP |
Texto Completo: | http://www.repositorio.ufop.br/handle/123456789/6895 https://doi.org/10.1016/j.eswa.2015.08.030 |
Resumo: | The Multi-Depot Vehicle Routing Problem (MDVRP) is an important variant of the classical Vehicle Routing Problem (VRP), where the customers can be served from a number of depots. This paper introduces a cooperative coevolutionary algorithm to minimize the total route cost of the MDVRP. Coevolutionary algorithms are inspired by the simultaneous evolution process involving two or more species. In this approach, the problem is decomposed into smaller subproblems and individuals from different populations are combined to create a complete solution to the original problem. This paper presents a problem decomposition approach for the MDVRP in which each subproblem becomes a single depot VRP and evolves independently in its domain space. Customers are distributed among the depots based on their distance from the depots and their distance from their closest neighbor. A population is associated with each depot where the individuals represent partial solutions to the problem, that is, sets of routes over customers assigned to the corresponding depot. The fitness of a partial solution depends on its ability to cooperate with partial solutions from other populations to form a complete solution to the MDVRP. As the problem is decomposed and each part evolves separately, this approach is strongly suitable to parallel environments. Therefore, a parallel evolution strategy environment with a variable length genotype coupled with local search operators is proposed. A large number of experiments have been conducted to assess the performance of this approach. The results suggest that the proposed coevolutionary algorithm in a parallel environment is able to produce high-quality solutions to the MDVRP in low computational time. |
id |
UFOP_f42565f4af35913cfb607df6e7f48085 |
---|---|
oai_identifier_str |
oai:localhost:123456789/6895 |
network_acronym_str |
UFOP |
network_name_str |
Repositório Institucional da UFOP |
repository_id_str |
3233 |
spelling |
Oliveira, Fernando Bernardes deEnayatifar, RasulSadaei, Hossein JavedaniGuimarães, Frederico GadelhaPotvin, Jean Yves2016-08-19T18:59:52Z2016-08-19T18:59:52Z2016OLIVEIRA, F. B. de et al. A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem. Expert Systems with Applications, v. 43, p. 117-130, 2016. Disponível em: <http://www.sciencedirect.com/science/article/pii/S0957417415005771>. Acesso em: 11 jul. 2016.0957-4174http://www.repositorio.ufop.br/handle/123456789/6895https://doi.org/10.1016/j.eswa.2015.08.030The Multi-Depot Vehicle Routing Problem (MDVRP) is an important variant of the classical Vehicle Routing Problem (VRP), where the customers can be served from a number of depots. This paper introduces a cooperative coevolutionary algorithm to minimize the total route cost of the MDVRP. Coevolutionary algorithms are inspired by the simultaneous evolution process involving two or more species. In this approach, the problem is decomposed into smaller subproblems and individuals from different populations are combined to create a complete solution to the original problem. This paper presents a problem decomposition approach for the MDVRP in which each subproblem becomes a single depot VRP and evolves independently in its domain space. Customers are distributed among the depots based on their distance from the depots and their distance from their closest neighbor. A population is associated with each depot where the individuals represent partial solutions to the problem, that is, sets of routes over customers assigned to the corresponding depot. The fitness of a partial solution depends on its ability to cooperate with partial solutions from other populations to form a complete solution to the MDVRP. As the problem is decomposed and each part evolves separately, this approach is strongly suitable to parallel environments. Therefore, a parallel evolution strategy environment with a variable length genotype coupled with local search operators is proposed. A large number of experiments have been conducted to assess the performance of this approach. The results suggest that the proposed coevolutionary algorithm in a parallel environment is able to produce high-quality solutions to the MDVRP in low computational time.O periódico Expert Systems with Applications concede permissão para depósito deste artigo no Repositório Institucional da UFOP. Número da licença: 3914201233520.info:eu-repo/semantics/openAccessVehicle routingCooperative coevolutionary algorithmEvolution strategiesA cooperative coevolutionary algorithm for the multi-depot vehicle routing problem.info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleengreponame:Repositório Institucional da UFOPinstname:Universidade Federal de Ouro Preto (UFOP)instacron:UFOPLICENSElicense.txtlicense.txttext/plain; charset=utf-8924http://www.repositorio.ufop.br/bitstream/123456789/6895/3/license.txt62604f8d955274beb56c80ce1ee5dcaeMD53ORIGINALARTIGO_CooperativeCoevutionaryAlgorithm.pdfARTIGO_CooperativeCoevutionaryAlgorithm.pdfapplication/pdf1262930http://www.repositorio.ufop.br/bitstream/123456789/6895/1/ARTIGO_CooperativeCoevutionaryAlgorithm.pdfe04a64eb7fbc8113f4c049954c0bbdeeMD51Erratum.pdfErratum.pdfapplication/pdf342644http://www.repositorio.ufop.br/bitstream/123456789/6895/2/Erratum.pdffcd0c8f841a4a8744c84e57ee6c713eaMD52123456789/68952019-10-09 08:31:33.268oai:localhost:123456789/6895RGVjbGFyYcOnw6NvIGRlIGRpc3RyaWJ1acOnw6NvIG7Do28tZXhjbHVzaXZhCgpPIHJlZmVyaWRvIGF1dG9yOgoKYSlEZWNsYXJhIHF1ZSBvIGRvY3VtZW50byBlbnRyZWd1ZSDDqSBzZXUgdHJhYmFsaG8gb3JpZ2luYWwgZSBxdWUgZGV0w6ltIG8gZGlyZWl0byBkZSBjb25jZWRlciBvcyBkaXJlaXRvcyBjb250aWRvcyBuZXN0YSBsaWNlbsOnYS4gRGVjbGFyYSB0YW1iw6ltIHF1ZSBhIGVudHJlZ2EgZG8gZG9jdW1lbnRvIG7Do28gaW5mcmluZ2UsIHRhbnRvIHF1YW50byBsaGUgw6kgcG9zc8OtdmVsIHNhYmVyLCBvcyBkaXJlaXRvcyBkZSBxdWFscXVlciBwZXNzb2Egb3UgZW50aWRhZGUuCgpiKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIGNvbnTDqW0gbWF0ZXJpYWwgZG8gcXVhbCBuw6NvIGRldMOpbSBvcyBkaXJlaXRvcyBkZSBhdXRvciwgZGVjbGFyYSBxdWUgb2J0ZXZlIGF1dG9yaXphw6fDo28gZG8gZGV0ZW50b3IgZG9zIGRpcmVpdG9zIGRlIGF1dG9yIHBhcmEgY29uY2VkZXIgw6AgVW5pdmVyc2lkYWRlIEZlZGVyYWwgZGUgT3VybyBQcmV0by9VRk9QIG9zIGRpcmVpdG9zIHJlcXVlcmlkb3MgcG9yIGVzdGEgbGljZW7Dp2EgZSBxdWUgZXNzZSBtYXRlcmlhbCwgY3Vqb3MgZGlyZWl0b3Mgc8OjbyBkZSB0ZXJjZWlyb3MsIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3UgY29udGXDumRvcyBkbyBkb2N1bWVudG8gZW50cmVndWUuCgpjKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIMOpIGJhc2VhZG8gZW0gdHJhYmFsaG8gZmluYW5jaWFkbyBvdSBhcG9pYWRvIHBvciBvdXRyYSBpbnN0aXR1acOnw6NvIHF1ZSBuw6NvIGEgVUZPUCwgZGVjbGFyYSBxdWUgY3VtcHJpdSBxdWFpc3F1ZXIgb2JyaWdhw6fDtWVzIGV4aWdpZGFzIHBlbG8gY29udHJhdG8gb3UgYWNvcmRvLgoKRepositório InstitucionalPUBhttp://www.repositorio.ufop.br/oai/requestrepositorio@ufop.edu.bropendoar:32332019-10-09T12:31:33Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)false |
dc.title.pt_BR.fl_str_mv |
A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem. |
title |
A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem. |
spellingShingle |
A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem. Oliveira, Fernando Bernardes de Vehicle routing Cooperative coevolutionary algorithm Evolution strategies |
title_short |
A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem. |
title_full |
A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem. |
title_fullStr |
A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem. |
title_full_unstemmed |
A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem. |
title_sort |
A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem. |
author |
Oliveira, Fernando Bernardes de |
author_facet |
Oliveira, Fernando Bernardes de Enayatifar, Rasul Sadaei, Hossein Javedani Guimarães, Frederico Gadelha Potvin, Jean Yves |
author_role |
author |
author2 |
Enayatifar, Rasul Sadaei, Hossein Javedani Guimarães, Frederico Gadelha Potvin, Jean Yves |
author2_role |
author author author author |
dc.contributor.author.fl_str_mv |
Oliveira, Fernando Bernardes de Enayatifar, Rasul Sadaei, Hossein Javedani Guimarães, Frederico Gadelha Potvin, Jean Yves |
dc.subject.por.fl_str_mv |
Vehicle routing Cooperative coevolutionary algorithm Evolution strategies |
topic |
Vehicle routing Cooperative coevolutionary algorithm Evolution strategies |
description |
The Multi-Depot Vehicle Routing Problem (MDVRP) is an important variant of the classical Vehicle Routing Problem (VRP), where the customers can be served from a number of depots. This paper introduces a cooperative coevolutionary algorithm to minimize the total route cost of the MDVRP. Coevolutionary algorithms are inspired by the simultaneous evolution process involving two or more species. In this approach, the problem is decomposed into smaller subproblems and individuals from different populations are combined to create a complete solution to the original problem. This paper presents a problem decomposition approach for the MDVRP in which each subproblem becomes a single depot VRP and evolves independently in its domain space. Customers are distributed among the depots based on their distance from the depots and their distance from their closest neighbor. A population is associated with each depot where the individuals represent partial solutions to the problem, that is, sets of routes over customers assigned to the corresponding depot. The fitness of a partial solution depends on its ability to cooperate with partial solutions from other populations to form a complete solution to the MDVRP. As the problem is decomposed and each part evolves separately, this approach is strongly suitable to parallel environments. Therefore, a parallel evolution strategy environment with a variable length genotype coupled with local search operators is proposed. A large number of experiments have been conducted to assess the performance of this approach. The results suggest that the proposed coevolutionary algorithm in a parallel environment is able to produce high-quality solutions to the MDVRP in low computational time. |
publishDate |
2016 |
dc.date.accessioned.fl_str_mv |
2016-08-19T18:59:52Z |
dc.date.available.fl_str_mv |
2016-08-19T18:59:52Z |
dc.date.issued.fl_str_mv |
2016 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.citation.fl_str_mv |
OLIVEIRA, F. B. de et al. A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem. Expert Systems with Applications, v. 43, p. 117-130, 2016. Disponível em: <http://www.sciencedirect.com/science/article/pii/S0957417415005771>. Acesso em: 11 jul. 2016. |
dc.identifier.uri.fl_str_mv |
http://www.repositorio.ufop.br/handle/123456789/6895 |
dc.identifier.issn.none.fl_str_mv |
0957-4174 |
dc.identifier.doi.none.fl_str_mv |
https://doi.org/10.1016/j.eswa.2015.08.030 |
identifier_str_mv |
OLIVEIRA, F. B. de et al. A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem. Expert Systems with Applications, v. 43, p. 117-130, 2016. Disponível em: <http://www.sciencedirect.com/science/article/pii/S0957417415005771>. Acesso em: 11 jul. 2016. 0957-4174 |
url |
http://www.repositorio.ufop.br/handle/123456789/6895 https://doi.org/10.1016/j.eswa.2015.08.030 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFOP instname:Universidade Federal de Ouro Preto (UFOP) instacron:UFOP |
instname_str |
Universidade Federal de Ouro Preto (UFOP) |
instacron_str |
UFOP |
institution |
UFOP |
reponame_str |
Repositório Institucional da UFOP |
collection |
Repositório Institucional da UFOP |
bitstream.url.fl_str_mv |
http://www.repositorio.ufop.br/bitstream/123456789/6895/3/license.txt http://www.repositorio.ufop.br/bitstream/123456789/6895/1/ARTIGO_CooperativeCoevutionaryAlgorithm.pdf http://www.repositorio.ufop.br/bitstream/123456789/6895/2/Erratum.pdf |
bitstream.checksum.fl_str_mv |
62604f8d955274beb56c80ce1ee5dcae e04a64eb7fbc8113f4c049954c0bbdee fcd0c8f841a4a8744c84e57ee6c713ea |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 |
repository.name.fl_str_mv |
Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP) |
repository.mail.fl_str_mv |
repositorio@ufop.edu.br |
_version_ |
1801685738807361536 |