Arc routing for parking enforcement officers: exact and heuristic solutions

DOI10.1016/j.ejor.2021.08.001zbMath1495.90221OpenAlexW3191739800MaRDI QIDQ2077993

Margarida Moz, Reinaldo Ferreira, Vasco Móra, Maria Cândida Mourão, João Ribeiro, Leonor Santiago Pinto

Publication date: 23 February 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.08.001

zbMATH Keywords

mixed integer linear programmingroutingimprovement heuristicsdecision support system (DSS)street parking enforcement

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The time-dependent prize-collecting arc routing problem
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
• City streets parking enforcement inspection decisions: the Chinese postman's perspective
• A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal
• An efficiency-based path-scanning heuristic for the capacitated arc routing problem
• A cutting plane algorithm for the capacitated arc routing problem
• Profitable mixed capacitated arc routing and related problems
• A scatter search for the periodic capacitated arc routing problem
• Recent results on Arc Routing Problems: An annotated bibliography
• Arc Routing

This page was built for publication: Arc routing for parking enforcement officers: exact and heuristic solutions