A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company
Autor(a) principal: | |
---|---|
Data de Publicação: | 2014 |
Outros Autores: | , , |
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://repositorio.inesctec.pt/handle/123456789/3521 http://dx.doi.org/10.1016/j.ejor.2014.02.018 |
Resumo: | Empty repositions are a major problem for car rental companies that deal with special types of vehicles whose number of units is small. In order to meet reservation requirements concerning time and location, companies are forced to transfer cars between rental stations, bearing significant costs and increasing the environmental impact of their activity due to the fuel consumption and CO2 emission. In this paper, this problem is tackled under a vehicle-reservation assignment framework as a network-flow model in which the profit is maximized. The reservations are allocated considering the initial and future availability of each car, interdependencies between rental groups, and different reservation priorities. To solve this model, a relax-and-fix heuristic procedure is proposed, including a constraint based on local branching that enables and controls modifications between iterations. Using real instances, the value of this approach is established and an improvement of 33% was achieved when compared to the company's current practices. |
id |
RCAP_fc424c03d3ee9b3db745d106a1043c4f |
---|---|
oai_identifier_str |
oai:repositorio.inesctec.pt:123456789/3521 |
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 relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental companyEmpty repositions are a major problem for car rental companies that deal with special types of vehicles whose number of units is small. In order to meet reservation requirements concerning time and location, companies are forced to transfer cars between rental stations, bearing significant costs and increasing the environmental impact of their activity due to the fuel consumption and CO2 emission. In this paper, this problem is tackled under a vehicle-reservation assignment framework as a network-flow model in which the profit is maximized. The reservations are allocated considering the initial and future availability of each car, interdependencies between rental groups, and different reservation priorities. To solve this model, a relax-and-fix heuristic procedure is proposed, including a constraint based on local branching that enables and controls modifications between iterations. Using real instances, the value of this approach is established and an improvement of 33% was achieved when compared to the company's current practices.2017-11-20T10:36:03Z2014-01-01T00:00:00Z2014info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://repositorio.inesctec.pt/handle/123456789/3521http://dx.doi.org/10.1016/j.ejor.2014.02.018engBeatriz Brito OliveiraMaria Antónia CarravillaJosé Fernando OliveiraToledo,FMBinfo:eu-repo/semantics/embargoedAccessreponame: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-05-15T10:20:53Zoai:repositorio.inesctec.pt:123456789/3521Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:53:45.513418Repositó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 relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company |
title |
A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company |
spellingShingle |
A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company Beatriz Brito Oliveira |
title_short |
A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company |
title_full |
A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company |
title_fullStr |
A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company |
title_full_unstemmed |
A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company |
title_sort |
A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company |
author |
Beatriz Brito Oliveira |
author_facet |
Beatriz Brito Oliveira Maria Antónia Carravilla José Fernando Oliveira Toledo,FMB |
author_role |
author |
author2 |
Maria Antónia Carravilla José Fernando Oliveira Toledo,FMB |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Beatriz Brito Oliveira Maria Antónia Carravilla José Fernando Oliveira Toledo,FMB |
description |
Empty repositions are a major problem for car rental companies that deal with special types of vehicles whose number of units is small. In order to meet reservation requirements concerning time and location, companies are forced to transfer cars between rental stations, bearing significant costs and increasing the environmental impact of their activity due to the fuel consumption and CO2 emission. In this paper, this problem is tackled under a vehicle-reservation assignment framework as a network-flow model in which the profit is maximized. The reservations are allocated considering the initial and future availability of each car, interdependencies between rental groups, and different reservation priorities. To solve this model, a relax-and-fix heuristic procedure is proposed, including a constraint based on local branching that enables and controls modifications between iterations. Using real instances, the value of this approach is established and an improvement of 33% was achieved when compared to the company's current practices. |
publishDate |
2014 |
dc.date.none.fl_str_mv |
2014-01-01T00:00:00Z 2014 2017-11-20T10:36:03Z |
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://repositorio.inesctec.pt/handle/123456789/3521 http://dx.doi.org/10.1016/j.ejor.2014.02.018 |
url |
http://repositorio.inesctec.pt/handle/123456789/3521 http://dx.doi.org/10.1016/j.ejor.2014.02.018 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/embargoedAccess |
eu_rights_str_mv |
embargoedAccess |
dc.format.none.fl_str_mv |
application/pdf |
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_ |
1799131611209400320 |