City streets parking enforcement inspection decisions: the Chinese postman's perspective

DOI10.1016/J.EJOR.2014.10.039MaRDI QIDQ726240zbMATH OpenOpenAlexFDO

Authors Nichalin S. Summerfield, Moshe Dror, Morris A. Cohen

Publication date 8 July 2016

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

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

zbMATH Keywords

Chinese postmanroutingsimulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Arc routing for parking enforcement officers: exact and heuristic solutions
• Probabilistic routing for on-street parking search
• scientific article; zbMATH DE number 3984962
• Fare evasion in transit networks
• Designing Inspector Rosters with Optimal Strategies

Cites work

• A branch-and-cut algorithm for the maximum benefit Chinese postman problem
• Approximate solutions for the maximum benefit chinese postman problem
• scientific article; zbMATH DE number 1520350 (Why is no real title available?)
• Networks and vehicle routing for municipal waste collection
• On the complexity of edge traversing
• Recent results on arc routing problems: an annotated bibliography
• Solving the prize-collecting rural postman problem
• The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
• The Multi-Armed Bandit Problem: Decomposition and Computation
• The undirected capacitated arc routing problem with profits

Cited in

(2)

• Arc routing for parking enforcement officers: exact and heuristic solutions
• Probabilistic routing for on-street parking search

This page was built for publication: City streets parking enforcement inspection decisions: the Chinese postman's perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726240)