A Routing/Assignment Problem in Garden Maintenance Services
Autor(a) principal: | |
---|---|
Data de Publicação: | 2015 |
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://hdl.handle.net/10400.22/11095 |
Resumo: | We address a routing/assignment problem posed by Neoturf, which is a Portuguese company working in the area of project, building and garden’s main- tenance. The aim is to define a procedure for scheduling and routing efficiently its clients of garden maintenance services. The company has two teams available throughout the year to handle all the maintenance jobs. Each team consists of two or three employees with a fully-equipped vehicle capable of carrying out every kind of maintenance service. At the beginning of each year, the number and frequency of maintenance interventions to conduct during the year, for each client, are agreed. Time windows are established so that visits to the client should occur only within these periods. There are clients that are supposed to be always served by the same team, but other clients can be served indifferently by any of the two teams. Since clients are geographically spread over a wide region, the total distance traveled while visiting clients is a factor that weighs heavily on the company costs. Neoturf is con- cerned with reducing these costs, while satisfying agreements with its clients. We give a mixed integer linear programming formulation for the problem, discuss lim- itations on the size of instances that can be solved to guarantee optimality, present a modification of the Clarke and Wright heuristic for the vehicle routing with time windows, and report preliminary computational results obtained with Neoturf data. |
id |
RCAP_accede65f69da02b4ea7dbe616c0cac2 |
---|---|
oai_identifier_str |
oai:recipp.ipp.pt:10400.22/11095 |
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 Routing/Assignment Problem in Garden Maintenance ServicesOptimizationVehicle routing problem with time windowsMixed integer linear programmingClarke and Wright heuristicWe address a routing/assignment problem posed by Neoturf, which is a Portuguese company working in the area of project, building and garden’s main- tenance. The aim is to define a procedure for scheduling and routing efficiently its clients of garden maintenance services. The company has two teams available throughout the year to handle all the maintenance jobs. Each team consists of two or three employees with a fully-equipped vehicle capable of carrying out every kind of maintenance service. At the beginning of each year, the number and frequency of maintenance interventions to conduct during the year, for each client, are agreed. Time windows are established so that visits to the client should occur only within these periods. There are clients that are supposed to be always served by the same team, but other clients can be served indifferently by any of the two teams. Since clients are geographically spread over a wide region, the total distance traveled while visiting clients is a factor that weighs heavily on the company costs. Neoturf is con- cerned with reducing these costs, while satisfying agreements with its clients. We give a mixed integer linear programming formulation for the problem, discuss lim- itations on the size of instances that can be solved to guarantee optimality, present a modification of the Clarke and Wright heuristic for the vehicle routing with time windows, and report preliminary computational results obtained with Neoturf data.SpringerRepositório Científico do Instituto Politécnico do PortoCerdeira, J. O.Cruz, M.Moura, A.2018-03-12T16:13:21Z20152015-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.22/11095eng978-3-319-20328-710.1007/978-3-319-20328-7_9info: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-03-13T12:52:49Zoai:recipp.ipp.pt:10400.22/11095Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:31:13.123383Repositó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 Routing/Assignment Problem in Garden Maintenance Services |
title |
A Routing/Assignment Problem in Garden Maintenance Services |
spellingShingle |
A Routing/Assignment Problem in Garden Maintenance Services Cerdeira, J. O. Optimization Vehicle routing problem with time windows Mixed integer linear programming Clarke and Wright heuristic |
title_short |
A Routing/Assignment Problem in Garden Maintenance Services |
title_full |
A Routing/Assignment Problem in Garden Maintenance Services |
title_fullStr |
A Routing/Assignment Problem in Garden Maintenance Services |
title_full_unstemmed |
A Routing/Assignment Problem in Garden Maintenance Services |
title_sort |
A Routing/Assignment Problem in Garden Maintenance Services |
author |
Cerdeira, J. O. |
author_facet |
Cerdeira, J. O. Cruz, M. Moura, A. |
author_role |
author |
author2 |
Cruz, M. Moura, A. |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Repositório Científico do Instituto Politécnico do Porto |
dc.contributor.author.fl_str_mv |
Cerdeira, J. O. Cruz, M. Moura, A. |
dc.subject.por.fl_str_mv |
Optimization Vehicle routing problem with time windows Mixed integer linear programming Clarke and Wright heuristic |
topic |
Optimization Vehicle routing problem with time windows Mixed integer linear programming Clarke and Wright heuristic |
description |
We address a routing/assignment problem posed by Neoturf, which is a Portuguese company working in the area of project, building and garden’s main- tenance. The aim is to define a procedure for scheduling and routing efficiently its clients of garden maintenance services. The company has two teams available throughout the year to handle all the maintenance jobs. Each team consists of two or three employees with a fully-equipped vehicle capable of carrying out every kind of maintenance service. At the beginning of each year, the number and frequency of maintenance interventions to conduct during the year, for each client, are agreed. Time windows are established so that visits to the client should occur only within these periods. There are clients that are supposed to be always served by the same team, but other clients can be served indifferently by any of the two teams. Since clients are geographically spread over a wide region, the total distance traveled while visiting clients is a factor that weighs heavily on the company costs. Neoturf is con- cerned with reducing these costs, while satisfying agreements with its clients. We give a mixed integer linear programming formulation for the problem, discuss lim- itations on the size of instances that can be solved to guarantee optimality, present a modification of the Clarke and Wright heuristic for the vehicle routing with time windows, and report preliminary computational results obtained with Neoturf data. |
publishDate |
2015 |
dc.date.none.fl_str_mv |
2015 2015-01-01T00:00:00Z 2018-03-12T16:13:21Z |
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/10400.22/11095 |
url |
http://hdl.handle.net/10400.22/11095 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
978-3-319-20328-7 10.1007/978-3-319-20328-7_9 |
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 |
Springer |
publisher.none.fl_str_mv |
Springer |
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_ |
1799131407578038272 |