摘要
对大城市邮政投递问题进行了描述，给出了单局多投递路段优化数学模型，并提出了分解算法，把原问题分解为有容约束弧路由和装箱二个子问题。对有容约束弧路由问题提出了随机回路点扫描法，同时给出了联合二个子问题求解原问题次最优解的策略。
The postman delivery problem in big city is descirbed,and the optimization of sin-gle post office/multi-postman routing problem is famulated.The optimization problem is de-composited into two subproblems,Capscitated Arc Routing Problem(CARP)and Bin Pack-ing Problem(BPP).Randomly Cycle-node Scanning Algorithm is proposed to CARP,and astrategy to coordinate the two subproblems to find near-optimun solution of the originalproblem is suggested.
出处
《北京邮电大学学报》
EI
CAS
CSCD
1994年第3期50-55,共6页
Journal of Beijing University of Posts and Telecommunications
关键词
邮递员问题
车辆运行问题
算法
postman problem/capacitated arc routing problem
vehicle routing problem
