局外k-卡车调度问题及其MCMF法求解

马卫民;陈国青

系统工程理论与实践 ›› 2005, Vol. 25 ›› Issue (5) : 108-112.

PDF(116 KB)
PDF(116 KB)
系统工程理论与实践 ›› 2005, Vol. 25 ›› Issue (5) : 108-112. DOI: 10.12011/1000-6788(2005)5-108
论文

局外k-卡车调度问题及其MCMF法求解

    马卫民(1)(2),陈国青(1)
作者信息 +

Off-line Scheduling of k-Truck Problem and Its MCMF Algorithm

    Wei Min MA(1)(2),Guo Qing CHEN(1)
Author information +
文章历史 +

摘要

局内问题及其解法的研究是优化领域研究热点之一,而有关局内问题解法的研究必将涉及相应的局外问题.针对局外k 卡车调度问题,给出了如下研究结果:给出了一种通过构造加权有向图,进而应用最小费用最大流法(MinimalCostMaximalFlow,简记为MCMF)求解该问题的方法;给出了应用动态规划(DynamicProgramming,简记为DP)以及MCMF求解该问题的算法复杂性并给予证明;通过一个具体的实例来说明MCMF求解的思路.

Abstract

In the field of the optimization, the research concerning on-line problem and its solutions becomes an attractive research direction. When we do some research on the on-line problem and its solutions, the off-line problem and its solution must be involved. For the off-line scheduling of k-truck problem, some results were obtained in this paper: a MCMF algorithm, which is used to solve the problem after constructing a weighted directed graph, is presented; the complexities of the DP and MCMF algorithms are g...

关键词

局外k卡车问题 / MCMF法 / 算法复杂性

Key words

off-line scheduling of k-trcuck problem / MCMF algorithm / complexity of algorithm

引用本文

导出引用
马卫民 , 陈国青. 局外k-卡车调度问题及其MCMF法求解. 系统工程理论与实践, 2005, 25(5): 108-112 https://doi.org/10.12011/1000-6788(2005)5-108
Wei Min MA , Guo Qing CHEN. Off-line Scheduling of k-Truck Problem and Its MCMF Algorithm. Systems Engineering - Theory & Practice, 2005, 25(5): 108-112 https://doi.org/10.12011/1000-6788(2005)5-108
PDF(116 KB)

328

Accesses

0

Citation

Detail

段落导航
相关文章

/