Solving Time-dependent Chinese Postman Problem with Time Windows through a Graph Transformation

摘要：

　　This paper studies a Time Dependent Chinese Postman Problem with Time Windows (TDCPPTW). A graph transformation algorithm is described to transform this problem into a Generalized Rural Postman Problem which is formulated as a 0/1 integer linear programming. Computational results show that medium-sized problems can be solved optimally by CPLEX 12.0 within a reasonable time.

关键词： TDCPPTW Graph transformation GRPP 0/1 linear formulation

作者: Guozhen Tan Jinghao Sun Jiaping Chen Xianchao Meng

作者单位: School of Computer Science and Technology, Dalian University of Technology,No.2, Ling Gong Road, China Hi-Tech Industrial Park, Dalian, China

会议类型: 国际会议

会议名称: 第8届国际最优化方法及应用大会

会议地点: 上海

会议语种:英文

页码: 333-334

在线出版日期: 2010-12-10（万方平台首次上网日期，不代表论文的发表时间）