期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
极小化总加权完工时间的Dial-a-Ride问题的在线随机算法(英文)
1
作者 鲁习文 《高校应用数学学报(A辑)》 CSCD 北大核心 2004年第B12期535-542,共8页
讨论一般度量空间上带单服务器的极小化总加权完工时间在线Dial-a-Ride问题.通过应用贪婪区间的技巧,提出了一个一般在线随机算法.根据这个算法,对于容量为1或者任意容量的一般度量空间上的在线Dial-a-Ride问题能得到一个竞争比为(2+2)/... 讨论一般度量空间上带单服务器的极小化总加权完工时间在线Dial-a-Ride问题.通过应用贪婪区间的技巧,提出了一个一般在线随机算法.根据这个算法,对于容量为1或者任意容量的一般度量空间上的在线Dial-a-Ride问题能得到一个竞争比为(2+2)/ln(1+2)的在线随机算法,这个算法不仅具有当前最好的竞争比,而且也改进了Krumke等人的结果. 展开更多
关键词 在线 随机算法 dial-a-ride 竞争比
下载PDF
A Dial-a-Ride Problem Applied to Saharan Countries: The Case of Taxi Woro-Woro
2
作者 Moustapha Diaby Brou Laurent Anicet Koua Etienne Soro 《Open Journal of Optimization》 2020年第4期138-147,共10页
In a context of increasing competition and sustainable development, service prices and unused capacity enhancement play a crucial role in freight or people transportation management. The focus of the paper is on a Dia... In a context of increasing competition and sustainable development, service prices and unused capacity enhancement play a crucial role in freight or people transportation management. The focus of the paper is on a Dial-a-ride Problem in the Saharan country context, for the particular of Taxi “woro-woro”1. More precisely, these taxis help to transport groups of people without any affinity, from point A to point B without stopping. Also, we propose for this problem an exact solution based on a mix integer program (MIP). A secondary study on a random instance generation algorithm is presented, which allows us to have a diversified and varied benchmark on which to apply our MIP program. 展开更多
关键词 Mix Integer Programming dial-a-ride Problem Instance Generation Saharan Countries Taxi “Woro-Woro”
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部