1. 毕业设计（论文）的内容和要求

内容：

了解多旅行商问题的研究现状和研究内容，学习并掌握目前常用的多旅行商问题求解方法，然后针对已有求解算法的不足进行改进，提高其计算性能，应用matlab软件，完成所设计求解算法的验证。

要求：

2. 参考文献

[1]王大志,汪定伟,闫杨.一类多旅行商问题的计算及仿真分析[J]. 系统仿真学报,2009,21(20):6378-6381.
[2]Ropke S,Cordeau J F.Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows [J].Transportation Science, Institute for Operations Research and the Management Sciences (INFORMS), Linthicum,Maryland, USA, 2009,43(3):267-286.
[3]Marinakis Y,Migdalas A.Annotated bibliography in vehicle routing [J].European Journal of Operational Research,2007,177(3):2069-2099.
[4]Schmid V,Doerner K F,Hartl R F,Savelsbergh M W P,Stoecher W.A Hybrid Solution Approach for Ready -Mixed Concrete Delivery [J].Transportation Science,Institute for Operations Research and the Management Sciences(INFORMS),2009,43(1):70-85.
[5]Gorenstein S.Printing press scheduling for multi-edition periodical[J].Management Science,1970,16(6):373-83.
[6]Zhang T,Gruver W A,Smith M H.Team scheduling by genetic search [C].Proceedings of the 2nd international conference on intelligent processing and manufacturing of materials Honolulu,HI,USA:IEEE Press,1999,2:839-844.

[7]Zhong Y,Liang J H,Gu G C,Zhang B R,Yang H Y.Animplementation of evolutionary computation for path planning of cooperative mobile robots [C].Proceedings of the 4th world congress on intelligent control and automation. Shanghai:IEEE Press,2002,3:1798-802.
[8]Modares A,Somhom S,Enkawa T.A self -organizing neural network approach for multiple traveling salesman and vehicle routing problems [J].InternationalTransactions in Operational Research,1999,6(6):591-606.
[9]Tang L,Liu J,Rong A,Yang Z.A multiple traveling salesman problem model for hot rolling scheduling in Shangai Baoshan Iron amp; Steel Complex [J].European Journal of Operational Research,2000,124(2):267-282.
[10]黄可伟,汪定伟.热轧计划中的多旅行商问题及其计算方法[J]. 计算机应用研究, 2007,24(7):43-45.
[11]李天龙, 吕勇哉. 基于自组织优化算法的一类多旅行商问题[J]. 计算机应用,2010,30(2):458-460.

[12]Bektas T.The multiple traveling salesman problem: an overview of formulations and solution procedures [J].Omega,2006,34(3):209-219.
[13]Liu W M,Li S J,Zhao F G,Zheng A Y.An Ant Colony Optimization Algorithm for the Multiple Traveling Salesmen Problem [C].The 4th IEEE Conference on Industrial Electronics and Applications. Xi'an:IEEE Press,2009:1533-1537.
[14]Pan J J,Wang D W.An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem [C].Proceedings of the First International Conferenceon Innovative Computing, Information and Control.Beijing: IEEE Press,2006,1:210-213.
[15]Kara I,Bektas T.Integer linear programming formulations of multiple salesman problems and its variations [J].European Journal of Operational Research,2006,174(3):1449-1458.

3. 毕业设计（论文）进程安排

见附件