一类邮递员送信问题  

One Type of Postman Problem

作　　者：黄盛[1] 

机构地区：[1]洛阳师范学院数学科学学院,河南洛阳471022

出　　处：《洛阳师范学院学报》2015年第5期21-23,共3页Journal of Luoyang Normal University

摘　　要：本文讨论了一类有约束的邮递员送信问题,不同于经典的TSP(Travelling Salesman Problem)问题,它要求经过部分顶点一次且仅一次,回到初始点的最短路径.这里建立了0-1规划模型,给出了求解此问题的一种方法,对于类似邮路问题有一定的借鉴意义.This paper discusses a kind of constraint postman problem , which differs from typical TSP problem , requiring a shortest path that passes certain vertexes once and once only , and finally goes back to the initial vertex . We have presented a 0-1 programming model for solving this kind of postman problem , which has certain reference value for similar postman problems .

关 键 词：邮递员送信问题 TSP问题 0-1规划 最短路径 

分 类 号：O157.7[理学—数学]