摘要
建立了在多资源多出救点的应急系统中基于“出救点个数最少”和“应急开始时间最早”的多目标的调度模型 .分别求出各个目标函数的最优解和最劣解 ,寻找使出救点个数为最优情况下使应急开始时间最早的解 ,在此基础上增加出救点的个数继续寻找 ,并将备选出救点集合缩小为运输时间小于上一次应急开始时间的出救点 ;得到一系列非劣方案后 ,对各目标函数按照具体情况赋予一定的权重 ,将原问题转化为求解使正负理想点接近度最大的非劣调度方案 .
A multi-objective dispatch model based on “the earliest emergency-start-time” and “the fewest number of selected depots” is established. The optimal and worst solutions of each objective function are obtained, and the solution with the earliest start-time under the fewest number is found. A series of noninferior solutions that have the earliest start-time are obtained after increasing the number of selected depots continually. The original model can be converted to search for a solution that has maximum approximation degree of positive-negative perfect point. An example is set to verify the feasibility of this algorithm.
出处
《东南大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2002年第3期510-513,共4页
Journal of Southeast University:Natural Science Edition
基金
国家自然科学基金资助项目 ( 79970 0 96 )