在线客服: 点击这里给我发消息  新用户使用步骤:会员注册→充值→重新登入→进入资源
标题:The Travelling Salesman Problem with pick-up and delivery
时间:2020-01-15 18:02:34
DOI:10.1016/0377-2217(94)90360-3
作者:Gur Mosheiov
关键词:Theoretical or Mathematical/ heuristic programming; travelling salesman problems/ travelling salesman problem; pick-up; delivery; demand points; shortest feasible tour; real life application; simple heuristic; travelling salesman tour; asymptotic behavior; worst case analysis; alternative solution method; cheapest insertion heuristic; simulated problems/ C1180 Optimisation techniques C1160 Combinatorial mathematics C1290H Systems theory applications in transportation E0210E Combinatorial mathematics E0210G Optimisation E1540 Systems theory applications
出版源: 《European Journal of Operational Research》 ,79 (2) :299-310
摘要:Demand points for pick-up and delivery are located in the plane. A single vehicle of a given capacity performs both pick-ups and deliveries. The objective is to find the shortest feasible tour. A real life application is described. We compare this problem to the classic travelling salesman problem. Based on their similarity we develop a simple heuristic consisting of pick-up and delivery along the travelling salesman tour. Asymptotic behavior and worst case analysis are provided. We then introduce an alternative solution method which is an extension of the well known ldquocheapest insertion heuristicrdquo. Performance of both heuristics is tested on various-size simulated problems
大小:1351 kb
页数:13 PAGES
下载: 点击下载
预览:

浏览器不支持嵌入PDF阅读,打开新页面在线阅读

本页内容由网络收集而来,版权归原创者所有,如有侵权请及时联系