摘要
应急物资的调度是一个非常重要而实际的研究课题，首要条件是时间最短，在时间最短的基础上要求费用最低。在此基础上，建立了时间最短、成本最低的多目标带约束的数学模型，并利用理想点法将此多目标问题转化为单目标问题，而后利用粒子群算法中的罚函数法将此蒂约束的问题转化为不带约束的问题，最后用离散的粒子群算法求解。实验表明，用粒子群算法求解应急物资调度问题有效可行。
Emergency materials＂ scheduling problem is a very important and practical research task, first of all the shortest time is asked and besides that, the lowest fees is also asked. Thus, the multi-objective constrained mathematic model with the shortest time and the lowest fees is constructed. First, we use ideal point method to convert the multi-objective model to single-objective model; then, we use penalty function method in PSO （Particle Swarm Optimization） to convert constrained model to unconstrained model; at last, we use discrete PSO to resolve the single-objective unconstrained model. As it is seen, these above ways are effective and practical.
作者
林浩
许维胜
LIN Hao, XU Wei-sheng （1.School of Software Engineering, Tongji University, Shanghai 201804, China; 2.School of Electronic and Information Engineering, Tongji University, Shanghai 201804, China）
出处
《电脑知识与技术》
2008年第9期1503-1505,1511,共4页
Computer Knowledge and Technology
关键词
应急物资
离散粒子群
群体智能
emergency materials
binary pso
swarm intelligence
