Arc routing for parking enforcement officers : exact and heuristic solutions

Detalhes bibliográficos
Autor(a) principal: Ferreira, Reinaldo
Data de Publicação: 2022
Outros Autores: Móra, Ferreira, Mourão, M. Cândida, Mós, Margarida, Pinto, Leonor S., Ribeiro, João
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.5/27976
Resumo: This paper presents exact and approximate methods for constructing daily walking tours for parking enforcement officers the Parking Enforcement Routing Problem (PERP), a problem faced by EMEL, a municipal company that manages parking in Lisbon. Parking Enforcement Officers (PEO) must ensure that the users of the street parking lots pay the corresponding fee, and that they also comply with the parking rules imposed by the legislation in force. The duration of the tours must be compatible with the PEO daily work schedules. A street cannot be supervised more than once in consecutive hours, nor supervised simultaneously by two PEOs. The PERP is a new generalisation of an Arc Routing Problem with profits aiming to maximise the total criticality, a concept defined to represent the need for enforcement of the street segments, related to the number of vehicles parked in transgression. Moreover, parking rules lead to some specificities regarding the underlying network, which needs to be built with additional unusual characteristics. A flow-based mixed integer linear programming model and heuristics which return two daily trips for each PEO are proposed. Computational results carried out on 50 instances based on real data show that it was appropriate to propose both types of methods, exact and heuristic. Furthermore, PEOs working for EMEL reacted positively to the trips corresponding to the generated solutions. A Decision Support System built on the heuristics was also developed to be easily used by practitioners in EMEL
id RCAP_caa2543b31df608e07384dee347dc8c2
oai_identifier_str oai:www.repository.utl.pt:10400.5/27976
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 Arc routing for parking enforcement officers : exact and heuristic solutionsRoutingRouting Street Parking EnforcementStreet Parking EnforcementImprovement HeuristicsMixed Integer Linear ProgrammingDecision Support System (DSS)This paper presents exact and approximate methods for constructing daily walking tours for parking enforcement officers the Parking Enforcement Routing Problem (PERP), a problem faced by EMEL, a municipal company that manages parking in Lisbon. Parking Enforcement Officers (PEO) must ensure that the users of the street parking lots pay the corresponding fee, and that they also comply with the parking rules imposed by the legislation in force. The duration of the tours must be compatible with the PEO daily work schedules. A street cannot be supervised more than once in consecutive hours, nor supervised simultaneously by two PEOs. The PERP is a new generalisation of an Arc Routing Problem with profits aiming to maximise the total criticality, a concept defined to represent the need for enforcement of the street segments, related to the number of vehicles parked in transgression. Moreover, parking rules lead to some specificities regarding the underlying network, which needs to be built with additional unusual characteristics. A flow-based mixed integer linear programming model and heuristics which return two daily trips for each PEO are proposed. Computational results carried out on 50 instances based on real data show that it was appropriate to propose both types of methods, exact and heuristic. Furthermore, PEOs working for EMEL reacted positively to the trips corresponding to the generated solutions. A Decision Support System built on the heuristics was also developed to be easily used by practitioners in EMELElsevierRepositório da Universidade de LisboaFerreira, ReinaldoMóra, FerreiraMourão, M. CândidaMós, MargaridaPinto, Leonor S.Ribeiro, João2023-07-07T16:27:39Z20222022-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.5/27976engFerreira, Reinaldo ... [et al.].(2022) "Arc routing for parking enforcement officers : exact and heuristic solutions" . European Journal of Operational Research, Vol. 288-3010377-221710.1016/j.ejor.2021.08.001metadata only accessinfo: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-09T01:30:28Zoai:www.repository.utl.pt:10400.5/27976Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T18:02:51.962054Repositó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 Arc routing for parking enforcement officers : exact and heuristic solutions
title Arc routing for parking enforcement officers : exact and heuristic solutions
spellingShingle Arc routing for parking enforcement officers : exact and heuristic solutions
Ferreira, Reinaldo
Routing
Routing Street Parking Enforcement
Street Parking Enforcement
Improvement Heuristics
Mixed Integer Linear Programming
Decision Support System (DSS)
title_short Arc routing for parking enforcement officers : exact and heuristic solutions
title_full Arc routing for parking enforcement officers : exact and heuristic solutions
title_fullStr Arc routing for parking enforcement officers : exact and heuristic solutions
title_full_unstemmed Arc routing for parking enforcement officers : exact and heuristic solutions
title_sort Arc routing for parking enforcement officers : exact and heuristic solutions
author Ferreira, Reinaldo
author_facet Ferreira, Reinaldo
Móra, Ferreira
Mourão, M. Cândida
Mós, Margarida
Pinto, Leonor S.
Ribeiro, João
author_role author
author2 Móra, Ferreira
Mourão, M. Cândida
Mós, Margarida
Pinto, Leonor S.
Ribeiro, João
author2_role author
author
author
author
author
dc.contributor.none.fl_str_mv Repositório da Universidade de Lisboa
dc.contributor.author.fl_str_mv Ferreira, Reinaldo
Móra, Ferreira
Mourão, M. Cândida
Mós, Margarida
Pinto, Leonor S.
Ribeiro, João
dc.subject.por.fl_str_mv Routing
Routing Street Parking Enforcement
Street Parking Enforcement
Improvement Heuristics
Mixed Integer Linear Programming
Decision Support System (DSS)
topic Routing
Routing Street Parking Enforcement
Street Parking Enforcement
Improvement Heuristics
Mixed Integer Linear Programming
Decision Support System (DSS)
description This paper presents exact and approximate methods for constructing daily walking tours for parking enforcement officers the Parking Enforcement Routing Problem (PERP), a problem faced by EMEL, a municipal company that manages parking in Lisbon. Parking Enforcement Officers (PEO) must ensure that the users of the street parking lots pay the corresponding fee, and that they also comply with the parking rules imposed by the legislation in force. The duration of the tours must be compatible with the PEO daily work schedules. A street cannot be supervised more than once in consecutive hours, nor supervised simultaneously by two PEOs. The PERP is a new generalisation of an Arc Routing Problem with profits aiming to maximise the total criticality, a concept defined to represent the need for enforcement of the street segments, related to the number of vehicles parked in transgression. Moreover, parking rules lead to some specificities regarding the underlying network, which needs to be built with additional unusual characteristics. A flow-based mixed integer linear programming model and heuristics which return two daily trips for each PEO are proposed. Computational results carried out on 50 instances based on real data show that it was appropriate to propose both types of methods, exact and heuristic. Furthermore, PEOs working for EMEL reacted positively to the trips corresponding to the generated solutions. A Decision Support System built on the heuristics was also developed to be easily used by practitioners in EMEL
publishDate 2022
dc.date.none.fl_str_mv 2022
2022-01-01T00:00:00Z
2023-07-07T16:27:39Z
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.5/27976
url http://hdl.handle.net/10400.5/27976
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Ferreira, Reinaldo ... [et al.].(2022) "Arc routing for parking enforcement officers : exact and heuristic solutions" . European Journal of Operational Research, Vol. 288-301
0377-2217
10.1016/j.ejor.2021.08.001
dc.rights.driver.fl_str_mv metadata only access
info:eu-repo/semantics/openAccess
rights_invalid_str_mv metadata only access
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_ 1799131694173782016