首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Risky traveling salesman problem
Authors:Nikolaos Papadakos  George Tzallas-Regas
Institution:a Imperial College London, Department of Computing, 180 Queen’s Gate, London SW7 2AZ, UK
b BAE Systems Integrated System Technologies Limited, Lyon Way, Frimley, Camberley, Surrey GU16 7EX, UK
Abstract:In this paper we introduce a methodology for optimizing the expected cost of routing a single vehicle which has a probability of breaking down or failing to complete some of its tasks. More specifically, a calculus is devised for finding the optimal order in which each site should be visited.
Keywords:Uncertainty  Travelling salesman problem  Stochastic vehicle routing
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号