时变网络中国邮路问题的时间自动机模型
作者:
基金项目:

国家自然科学基金(60873256); 国家重点基础研究发展计划(973)(2005CB321904)


Solving Chinese Postman Problem on Time Varying Network with Timed Automata
Author:
  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [23]
  • |
  • 相似文献 [20]
  • |
  • 引证文献
  • | |
  • 文章评论
    摘要:

    基于时间自动机理论,提出了时间窗、时间依赖服务代价以及时间依赖旅行时间这3 类时变网络中国邮路问题的统一建模的语义模型和求解方法.首先,将中国邮路问题可行解条件和时变参数与时间自动机联系起来,建立了3 类问题的统一时间自动机系统(timed automata system,简称TAS)模型;然后,将时变网络中国邮路问题归结为TAS 模型上的一系列可达性判定问题,并利用形式化验证算法给出了有效的求解方法.由于TAS 模型中存在O(|A|+|AR|+1)个时间自动机,限制了问题求解规模.为此,通过扩展时间自动机语义,提出了TAS 模型中的时间自动机合并策略,进而将TAS 模型转换为一个广义时间自动机(GTA)模型.基于GTA 模型,利用UPPAAL 工具对9 组、共54 个随机算例进行实验.实验结果表明,该方法在求解精度上明显优于运筹学领域的方法.

    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.

    参考文献
    [1] Guan MG. Graphic programming using odd or even points. Chinese Mathematics, 1960,10(3):263?266 (in Chinese with English abstract).
    [2] Tan GZ, Gao W. Shortest path algorithm in time-dependent networks. Chinese Journal of Computers, 2002,25(2):165?172. (in Chinese with English abstract)
    [3] Tan GZ, Liu YL, Gao W. K expected shortest path in stochastic and time-dependent network. Chinese Journal of Computers, 2003,26(3):323?331 (in Chinese with English abstract).
    [4] Tan GZ, Li D, Qu XG, Gao W. A distributed routing protocol for heterogeneous time dependent networks. Journal of China Institute of Communications, 2004,25(10):117?126 (in Chinese with English abstract).
    [5] Lin L, Yan CG, Jiang CJ, Zhou XD. Complexity and approximate algorithm of shortest paths in dynamic networks. Chinese Journal of Computers, 2007,30(4):608?614 (in Chinese with English abstract).
    [6] Aminu UF, Eglese RW. A constraint programming approach to the Chinese postman problem with time windows. Computers and Operations Research, 2006,33(12):3423?3431. [doi: org/10.1016/j.cor.2005.02.012]
    [7] Tagmouti M, Gendreau M, Potvin JY. Arc routing problems with time-dependent service costs. European Journal of Operational Research, 2007,181(1):30?39. [doi: org/10.1016/j.ejor.2006.06.028]
    [8] Tan GZ, Sun JH. Time dependent Chinese postman problem: Theory, formulation and algorithm. Technical Report, Dalian: Dalian University of Technology, 2010. 1?16.
    [9] Sun JH, Tan GZ, Hou GJ, Wang BC. Column generation algorithm for time dependent Chinese postman problem. In: Yu L, Wang S, Lai KK, eds. Proc. of the 4th Int’l Conf. on Computational Sciences and Optimization. Kunming: IEEE Computer Society Publications, 2011. 450?454.
    [10] Dror M. Arc Routing: Theory, Solutions and Applications. Boston: Kluwer Academic, 2000.
    [11] Abdedda?m Y, Maler O. Job-Shop scheduling using timed automata. In: Berry G, Comon H, Finkel A, eds. Lecture Notes in Computer Science. Heidelberg, Berlin: Springer-Verlag, 2001. 478?492. [doi: 10.1007/3-540-44585-4_46]
    [12] Abdedda?m Y, Asarin E, Maler O. On optimal scheduling under uncertainty. In: Lecture Notes in Computer Science. Heidelberg, Berlin: Springer-Verlag, 2003. 240?253. [doi: 10.1007/3-540-36577-X_17]
    [13] Abdedda?m Y, Kerbaa A, Maler O. Task graph scheduling using timed automata. In: Proc. of the FMPPTA 2003. Los Alamitos: IEEE Computer Society, 2003.
    [14] Abdedda?m Y, Maler O. Preemptive job-shop scheduling using stopwatch automata. In: Proc. of the TACAS 2002. London: Springer-Verlag, 2002. 113?126. [doi: 10.1007/3-540-46002-0_9]
    [15] Abdedda?m Y, Asarin E, Maler O. Scheduling with timed automata. Theoretical Computer Science, 2006,354(2):272?300. [doi: org/10.1016/j.tcs.2005.11.018]
    [16] Edmonds J, Johnson EL. Matching, euler tours and the Chinese postman. Mathematical Programming, 1973,5(1):88?124. [doi: org/10.1007/BF01580113]
    [17] Alur R, Dill DL. A theory of timed automata. Theoretical Computer Science, 1994,126(2):183?235. [doi: org/10.1016/0304-3975 (94)90010-8]
    [18] Kaynar DK, Lynch N, Segala R, Vaandrager F. Timed I/O automata: A mathematical framework for modeling and analyzing realtime systems. In: Proc. of the 24th IEEE Int’l Real-Time Systems Symp. Washington: IEEE Computer Society, 2003. 166?177. [doi: 10.1109/REAL.2003.1253264]
    [19] Henzinger TA, Nicollin X, Sifakis J, Yovine S. Symbolic model checking for real-time systems. Information and Computation, 1994,111:193?244. [doi: org/10.1006/inco.1994.1045]
    [20] Chen W, Xue YZ, Zhao C, Li MS. A method for testing real-time system based on timed automata. Journal of Software, 2007,18(1):62?73 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/18/62.htm [doi: 10.1360/jos180062]
    [21] Yan RJ, Li GY, Xu YB, Liu CM, Tang ZS. Reachability checking of finite precision timed automata. Journal of Software, 2006,17(1):1?10 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/17/1.htm [doi: 10.1360/jos170001]
    [22] Larsen KG, Pettersson P, Yi W. Uppaal in a nutshell. Int’l Journal on Software Tools for Technology Transfer, 1997,1:134?152. [doi: org/10.1007/s100090050010]
    [23] Ecoll PE, Ribeiro CC, de Souza CC. Multiprocessor scheduling under precedence constraints: Polyhedral results. Discrete Applied Mathematics, 2006,154(5):770?801. [doi: org/10.1016/j.dam.2004.07.009]
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

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

复制
分享
文章指标
  • 点击次数:9811
  • 下载次数: 9811
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2010-07-09
  • 最后修改日期:2011-03-29
文章二维码
您是第20239727位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号