| 大城市邮政投递问题及其算法探讨 |
| |
| 引用本文： | 忻展红.大城市邮政投递问题及其算法探讨[J].北京邮电大学学报,1994,17(3):50-55. |
| |
| 作者姓名： | 忻展红 |
| |
| 作者单位： | 北京邮电大学管理工程系 |
| |
| 摘 要： | 对大城市邮政投资递问题进行了描述，给出了单局多投递路段优化数学模型，并提出了分解算法，把原问题分解为有容约束弧路由和装箱二个子问题，对有容约束弧路由问题提出了随机回路点扫描法，同时给出了联合二个子问题求解原问题次最优解的策略。
|
| 关 键 词： | 邮递员问题 车辆运行问题 算法 |
Postman Delivery Problem in Big City and Its Algorithm |
| |
| Xin Zhanhong.Postman Delivery Problem in Big City and Its Algorithm[J].Journal of Beijing University of Posts and Telecommunications,1994,17(3):50-55. |
| |
| Authors: | Xin Zhanhong |
| |
| Abstract: | 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. |
| |
| Keywords: | postman problem/capacitated arc routing problem vehicle routing problem |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《北京邮电大学学报》浏览原始摘要信息 |
|
点击此处可从《北京邮电大学学报》下载全文 |
