欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
提出了动态物流配送车辆调度优化问题——配送车在一度量空间中进行服务，度量空间中的任何一节点可能在任何时间提出服务请求，要求配送车将该点处的货物运送到另一点，每一个服务请求都有一个服务期限，若在规定的时间内某一服务请求不能被满足则将被取消，在考虑装／卸货所用时间的情况下，决策者如何以局内方式确定调度策略，使配送车完成的服务请求数最多．针对该不确定性条件下的管理决策问题，给出了两种局内管理策略，并利用局内问题及竞争分析理论，给出了不同载重量下（Q=1和Q=∞）的两种策略的竞争比．
英文摘要：
In this paper, we propose the problem of vehicle scheduling in logistic distribution, which can be outlined as follows： transportation requests with deadlines between points in a metric arrive on-line, specifying the objects to be transported and the corresponding sources and destinations. These requests are to be handled by a server which picks up and drops objects at their sources and destinations. The goal is to plan the motion of vehicle in an on-line way so that the maximum number of requests is met by their deadlines, in which the time for loading and/ or tmloading the objects is considered. Two on-line strategies are presented for the indeterminate management of decision problem. And based on the theory of on-line problem and competitive analysis, we obtain the competitive ratios of the strategies in two cases, when the vehicle has infinite capacity and finite capacity.
同期刊论文项目
同项目期刊论文
期刊信息
位置：