摘要
提出一类要求货物尽量在某一给定时间以前如数运抵目的地的运输问题。这是一类含离散目标约束的目标规划问题,我们把它称为D运输问题。建立D运输问题的数学模型,引入可实施解、最优解、解对预警时间的偏差等概念,给出D运输问题的求解方法和一个计算例子。
A new transportation problem in which all the goods are required to be transported from sources to every (destination) before a given time as far as possible is posed.The problem is a goal programming problem in which one objective constraint is discrete. It is said to be D-transportation problem. This paper establishes the mathematical model of (D-transportation) problems, and introduces some definitions and theories, such as function , implementable solution, optimal solution, and the deviation of the optimal solution for the given time and so on. Finally, an example is provided to illustrate the proposed algorithm for solving D-transportation problems.
出处
《系统工程》
CSCD
北大核心
2004年第4期21-25,共5页
Systems Engineering
关键词
D运输问题
数学模型
目标规划
最优解
运筹学
A Given Time
Discrete Constraint
Goal Programming
D-Transportation Problem
Optimal Solution
Deviation
