带三重容量限制的中转物流选址-分配模型  

Location Allocation Problem of Transfer Logistics with Three Capacity Constraints

作　　者：章海峰[1] 郝春艳[1] 杨超[1] 

机构地区：[1]华中科技大学管理学院,湖北武汉430074

出　　处：《管理工程学报》2008年第1期62-66,共5页Journal of Industrial Engineering and Engineering Management

基　　金：国家自然科学基金资助项目(70471042)

摘　　要：本文分析了一类带三重容量限制的物流选址-分配问题(LAP):在物流网络受边最大单批通行容量、物流中心最大吞吐容量和运输工具总运输容量等三重容量限制下,如何进行中转运输的物流中心选址和相关资源分配,使总的费用最小。模型假设网络系统满足如下条件:商品只能用不同运输工具经过某一物流中心进行中转运输。本文建立了混合整数规划模型,提出了一种先进行选址然后进行资源分配的优化算法,并用优化算法对一个实例进行了求解。This article investigated a kind of location allocation problem（LAP） of logistics with three capacity constraints in transfer logistics network.We considered the following constraints under the goal of minimizing the total cost：（1） the maximum batch capacity of each arc was limited,（2） the total load ＆ unload capacity of each transfer center node was limited,and（3） the total transportation capacity of each kind of vehicle is limited.The model supposed that the goods is transshipped through one of the transfer center nodes by different vehicle.We formulated this problem as a mixed integer programming,put forward a heuristic algorithm,which first planed location,and then planed resources allocation,and give a case to explain how to solve this kind of problem.

关 键 词：选址-分配问题 容量限制 混合整数规划 物流 优化 运输 

分 类 号：F253[经济管理—国民经济]