Location Allocation Problem of Transfer Logistics with Three Capacity Constraints

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.