检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《系统工程》2006年第11期6-12,共7页Systems Engineering
摘 要:分析大规模突发性公共事件或自然灾害情况下救援物资运输与商业运输的不同特点,指出救援物资运输问题综合了多货物多起止点网络流问题与多种运输方式满载车辆调度问题,在此基础上为描述该问题设计一种多模式分层网络,并利用延期费用和划分时段的方法构建问题的多目标数学规划模型。提出一个基于拉格朗日松弛法的解决方法,将原问题分解为货物流与车辆流问题两个子问题,通过多货物流与最小费用循环流算法分别求解,最后通过实例计算验证该解法具有良好的收敛性与计算效率。Different Characteristics between relief commodities transportation under large-scale public emergency and disaster and commercial commodities transportation were analyzed. The state that relief commodity transportation integrates MCMODFP (multi-commodities and multiple outset-destination flow problem) with MTMFLVSP (multiple-transportmode and full-load vehicle scheduling problem) was pointed out. Based on above conclusion authors brought forward the concept of multi-mode layer network to stimulate problem circumstances and built a modal of Multi-objective programming by means of delay cost and time period. One solution based on Lagrangian relaxation was presented. It separates the original problem into commodity flow and vehicle flow sub-problems and two sub-problems were individually solved by means of multicommdity flow algorithm and minimum-cost circulation algorithm. At last the convergence of the proposed solution was proved by means of test instances. Computational results on test instances show that this solution takes on good convergence rate and the computational efficiency.
分 类 号:O221[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.12.146.79