A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
Autor(a) principal: | |
---|---|
Data de Publicação: | 2011 |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/1822/16197 |
Resumo: | In the heterogeneous fixed fleet vehicle routing problem there are different types of vehicles and a given number of vehicles of each type. The resolution of this problem consists of assigning the customers to the existing vehicles and, in relation to each vehicle, defining the order of visiting each customer for the delivery or collection of goods. The objective is to minimize the total costs, satisfying customers’ requirements and visiting each customer exactly once. In this paper a tabu search algorithm is proposed and tested on several benchmark problems. The computational experiments show that the proposed algorithm produces high quality solutions within an acceptable computation time. Four new best solutions are reported for a set of test problems used in the literature. |
id |
RCAP_3af56f91cb80fad119f0932e20edb06e |
---|---|
oai_identifier_str |
oai:repositorium.sdum.uminho.pt:1822/16197 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problemHeterogeneous fixed fleetVehicle routingTabu searchHeuristicsLogisticsScience & TechnologyIn the heterogeneous fixed fleet vehicle routing problem there are different types of vehicles and a given number of vehicles of each type. The resolution of this problem consists of assigning the customers to the existing vehicles and, in relation to each vehicle, defining the order of visiting each customer for the delivery or collection of goods. The objective is to minimize the total costs, satisfying customers’ requirements and visiting each customer exactly once. In this paper a tabu search algorithm is proposed and tested on several benchmark problems. The computational experiments show that the proposed algorithm produces high quality solutions within an acceptable computation time. Four new best solutions are reported for a set of test problems used in the literature.ElsevierUniversidade do MinhoBrandão, José2011-012011-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/1822/16197eng0305-054810.1016/j.cor.2010.04.008http://www.sciencedirect.com/science/article/pii/S0305054810000924info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-07-21T12:29:22Zoai:repositorium.sdum.uminho.pt:1822/16197Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T19:24:20.870944Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem |
title |
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem |
spellingShingle |
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem Brandão, José Heterogeneous fixed fleet Vehicle routing Tabu search Heuristics Logistics Science & Technology |
title_short |
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem |
title_full |
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem |
title_fullStr |
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem |
title_full_unstemmed |
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem |
title_sort |
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem |
author |
Brandão, José |
author_facet |
Brandão, José |
author_role |
author |
dc.contributor.none.fl_str_mv |
Universidade do Minho |
dc.contributor.author.fl_str_mv |
Brandão, José |
dc.subject.por.fl_str_mv |
Heterogeneous fixed fleet Vehicle routing Tabu search Heuristics Logistics Science & Technology |
topic |
Heterogeneous fixed fleet Vehicle routing Tabu search Heuristics Logistics Science & Technology |
description |
In the heterogeneous fixed fleet vehicle routing problem there are different types of vehicles and a given number of vehicles of each type. The resolution of this problem consists of assigning the customers to the existing vehicles and, in relation to each vehicle, defining the order of visiting each customer for the delivery or collection of goods. The objective is to minimize the total costs, satisfying customers’ requirements and visiting each customer exactly once. In this paper a tabu search algorithm is proposed and tested on several benchmark problems. The computational experiments show that the proposed algorithm produces high quality solutions within an acceptable computation time. Four new best solutions are reported for a set of test problems used in the literature. |
publishDate |
2011 |
dc.date.none.fl_str_mv |
2011-01 2011-01-01T00:00:00Z |
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.uri.fl_str_mv |
http://hdl.handle.net/1822/16197 |
url |
http://hdl.handle.net/1822/16197 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
0305-0548 10.1016/j.cor.2010.04.008 http://www.sciencedirect.com/science/article/pii/S0305054810000924 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799132722577276928 |