Solving the time varying postman problems with timed automata

DOI10.1080/10556788.2014.991959zbMath1330.90124OpenAlexW1973488948MaRDI QIDQ3458818

Yakun Meng, Jingchang Sun, Jinghao Sun, Guozhen Tan

Publication date: 28 December 2015

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2014.991959

zbMATH Keywords

timed automatatime dependenttime windowtime varyingpostman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Uses Software

• Uppaal

Cites Work

• Test generation for interaction detection in feature-rich communication systems
• Arc routing problems with time-dependent service costs
• Routeing winter gritting vehicles
• A theory of timed automata
• Modeling and solving several classes of arc routing problems as traveling salesman problems
• Transforming arc routing into node routing problems
• Scheduling with timed automata
• A constraint programming approach to the Chinese postman problem with time windows
• Solving capacitated arc routing problems using a transformation to the CVRP
• The time-dependent rural postman problem: polyhedral results
• Solving Chinese Postman Problem on Time Varying Network with Timed Automata
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Arc Routing Problems, Part II: The Rural Postman Problem
• A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem

This page was built for publication: Solving the time varying postman problems with timed automata