全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

配送网络流问题探讨

, PP. 151-153

Keywords: 混和整数规划,拉格朗日松弛,网络单纯形法,试探法,mixedintegerprogramming,Lagrangianrelaxation,networksimplexmethod,heuristic

Full-Text   Cite this paper   Add to My Lib

Abstract:

:?考虑物流配送中的网络流问题,即由某些供应点向各个需求点通过某种运输工具(货车、轮船等)供应货物的问题,目的是尽可能的降低配送成本.通过一个混和整数规划模型来描述该问题,利用网络单纯形法、拉格朗日松弛算法以及试探法为主要研究方法,有效地得到该问题~个近似程度较高的可行解.

References

[1]  Ahuja R K,Magnanti TL,Orlin J B.Network flows:the-ory,algorithms and applications[M].NJ,Prentice Hall,Englewood Cliffs,1993.
[2]  YAN S Y,CHEN HL.A scheduling model and a solutionalgorithm for inter-city bus carriers[J].TransportationResearch Part A,2002,36:805-825.
[3]  YAN S Y,LIN C G.Airline scheduling for the temporaryclosure of airports[J].Transportation Science,1997,31:72-83.
[4]  YAN S Y,YOUNG HF.A decision support framework formulti-fleet routing and multi-stop flight scheduling[J].Transportation Research Part A,1996,30:379-398.
[5]  Marshall L,Fisher.The lagrangian relaxation Method forsolving integer Programming Problems[J].ManagementScience,1981,27:1-18.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133