全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用：99美元
投递稿件

查看量下载量

相关文章

更多...

带指定点集的团队定向问题及算法研究

DOI: 10.3969/j.issn.1674-0696.2015.02.27, PP. 128-132

Keywords: 交通运输工程,指定点集,团队定向问题,蚁群优化算法,traffictransportationengineering,specifiedpointset,teamorienteeringproblem(TOP),antcolonyoptimization

Full-Text   Cite this paper   Add to My Lib

Abstract:

:？考虑现实世界配送问题中客户性质不同的特点，讨论了一类带指定点集的团队定向问题。建立了在时间限制条件下，带指定点集的以利润最大为目标的团队定向问题模型。提出了带2-opt的最大最小蚂蚁系统的蚁群优化算法，结合实际改进启发信息和信息素更新策略，采取2-opt对最优解进行优化。数值算例验证了算法的有效性，表明了在团队定向问题中考虑指定点集的重要性。

 References

[1]  Vansteenwegen P,Souffriau W,Oudheusden D V.The orienteering problem:a survey[J].European Journal of Operational Research,2011,209(1):1-10.
[2]  柯良军,章鹤,尚可,等.一类求解带时间窗的团队定向问题的改进蚁群算法[J].计算机科学,2012,39 (4):214-216.
[3]  Duan Haibin.Ant Colony Algorithms:Theory and Applications[M].Beijing:Science Press,2005:33-38.
[4]  Dorigo M,Stützle T.Ant Colony Optimization[M].Cambridge,MA:MIT Press,2004:70-75.
[5]  Chao I,Golden B,Wasil E.Theory and methodology——the team orienteering problem[J].European Journal of Operational Research,1996,88:464-474.
[6]  Ke Liangjun,Zhang He,Shang Ke,et al.Improved ant colony optimization approach for the team orienteering problem with time windows[J].Computer Science,2012,39 (4):214-216.
[7]  Lin S W,Yu V F.A simulated annealing heuristic for the team orienteering problem with time windows[J].European Journal of Operational Research,2012,217(1):94-107.
[8]  Lin S W.Solving the team orienteering problem using effective multi-start simulated annealing [J].Applied Soft Computing,2013,13(2):1064-1073.
[9]  Nacima L,Renata M,Jan M,et al.The team orienteering problem with time windows:an LP-based granular variable neighborhood search[J].European Journal of Operational Research,2012,220(1):15-27.
[10]  Souffriau W,Vansteenwegen P,Berghe G V,et al.A path relinking approach for the team orienteering problem[J].Computers & Operations Research,2010,37(11):1853-1859.
[11]  段海滨.蚁群算法原理及其运用[M].北京:科学出版社,2005:33-38.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133