摘要
结合进口物资的江海联合中转运输,提出了一类带三重能力约束的中转站选址-分配问题(LAP)模型,即在物流网络节点有最大单批通行能力、中转站吞吐能力、运输工具总运输能力三重能力约束下,如何进行中转站选址,并相关资源分配,使总的费用最小。针对该问题构建了混合整数规划模型,提出了一种先进行选址然后进行资源分配的优化算法。还给出了该模型在武汉钢铁(集团)公司进口铁矿石江海联合运输的中转站选址-分配问题的研究实例。
Based on the imported goods transportation from sea to river, this paper proposed a location allocation problem (LAP) with the following three capacity constraints in logistics network: the maximum batch capacity of each node, the total capacity of each distribute center, and the total transportation capacity of each vehicle were limited. The problem is formulated as a mixed integer programming and an corresponding algorithm is put forward, which first planed location, and then planed resources allocation, and solved the location allocation problem of WlSCO imported iron ore transportation case by the model and algorithm.
出处
《工业工程与管理》
2007年第4期20-24,共5页
Industrial Engineering and Management
基金
国家自然科学基金资助项目(70471042)
关键词
选址-分配问题
能力约束
混合整数规划
物流
location allocation problem
capacitated
mixed integer programming
logistics