收藏本站
收藏 | 手机打开
二维码
手机客户端打开本文

Dial-a-Ride Problem with Time-Windows and On-Line Algorithms

【摘要】:正In this paper results on dial-a-ride problem with time-windows are pre-sented. Requests for rides appearing over time consist of two points in a metric space,a source and a destination.Servers transport objects of requests from sources to des-tinations. Each request specifies a deadlines. If a request is not be served by itsdeadline, it will be called off.The goal is to plan the motion of servers in an on-lineway so that the maximum number of requests is met by their deadline. We performcompetitive analysis of two deterministic strategies for the problem in two cases sep-arately, when the server has finite capacity (z=1) and when the server has infinitecapacity (z =∞). Then we obtain their competitive ratios.

知网文化
中国知网广告投放
 快捷付款方式  订购知网充值卡  订购热线  帮助中心
  • 400-819-9993
  • 010-62982499
  • 010-62783978