Solving Chinese Postman Problem on Time Varying Network with Timed Automata
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    This work presents timed automata as a natural tool for solving Chinese postman problems on time varying network. This study shows that the optimal Chinese tour can be equivalently casted as the shortest run in this automaton system, which can be obtained efficiently by solving a series of decision problems for reachability. A composition strategy is then proposed to adapt to the current model, such that the number of timed automaton is reduced from O(|A|+|AR|+1) to O(1). Computational results show that the improved model can solve small-sized instances optimally, and that it can obtain a better gap between the lower bound and upper bound than the ones obtained by the cutting plane and column generation algorithms.

    Reference
    Related
    Cited by
Get Citation

谭国真,孙景昊,王宝财,姚卫红.时变网络中国邮路问题的时间自动机模型.软件学报,2011,22(6):1267-1280

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 09,2010
  • Revised:March 29,2011
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063