局外k—出租车问题及其动态规划求法

局内问题及其解法在研究是优化领域研究热点之一，而有关局内问题解法的研究必将涉及相应的局外问题。提出了局外k-出租车调度问题，给出了问题的动态规划求解方法，并给出该问题的一个具体算例。同时简要地介绍了局外k-卡车调度问题的动态规划求解方法。

Off-line scheduling of k-taxi problem and its dynamic programming procedure optimal algorithm

In the field of the optimization, the research concerning on-line problem and its solutions is 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. This paper proposes off-line scheduling of k-taxi problem and off-line scheduling of k-truck problem and gives the optimal off-line algorithms, which use the dynamic programming, concerning k-taxi and k-truck problem. Moreover, paper gives an example to illustrate the algorithms.