Font Size: a A A

The Location Allocation Problem Of The Imported Goods Transshipment

Posted on:2007-03-25Degree:DoctorType:Dissertation
Country:ChinaCandidate:H F ZhangFull Text:PDF
GTID:1119360242962601Subject:Management Science and Engineering
Abstract/Summary:PDF Full Text Request
With the background of the imported iron ore Transshipment of Wuhan Iron & Steel Corporation (WISCO), this dissertation studies some LAP models on the basis of batch transit capacity, and comes out with relevant algorithm.Firstly, the thesis introduces the backgrounds, the significance, and the innovative achievements. It begins with the importance of logistics location-allocation, and then introduces the backgrounds, the motivations of choosing this topic, the innovative achievements and the structure of the paper.Secondly, the thesis summarizes the origination and ramifications of location problems. The paper also appraises the LAP, explains the fundamental principles of some heuristic algorithms used to solve LAP, and states the application status of these algorithms employed in network LAP.Thirdly, the thesis scrutinizes the LAPs with double capacitated constraints which include the maximum batch transit capacity of node. In this chapter, it begins with the mixed integer programming model of basic LAP with the maximum batch transit capacity of node, and discusses its heuristic algorithms. Then it respectively introduces the load & unload capacity of facility, and the total transportation capacity of vehicle to the basic LAP model with the maximum batch transit capacity of node, puts forward the models, and discusses their heuristic algorithms on the basis of the real case.Fourthly, the thesis scrutinizes the LAPs with multiple capacitated constraints which include the maximum batch transit capacity of node. In this chapter, it begins with the model and the algorithm of the LAP with the constraints of the maximum batch transit capacity of node the load & unload capacity of facility, and the total transportation capacity of vehicle. And then, on the basis of the multiple LAP network studied above, it comes out with another multiple LAP model and the algorithm by replacing unit freight and the distances between nodes with correlative freight.Fifthly, the thesis discusses the LAPs with multiple capacitated constraints which include the maximum batch transit capacity of arc. In this chapter, it begins with the model and the algorithm of the LAP with the constraints of the maximum batch transit capacity of arc, the load & unload capacity of facility, and the total transportation capacity of vehicle. And then puts forward the model and the algorithm of the LAP with the constraints of the maximum batch transit capacities of arc and node, the load & unload capacity of facility, and the total transportation capacity of vehicle. In last section of this chapter, it translate the maximum and minimum batch transit capacities of both arc and node to the maximum and minimum batch transit capacities of arc, and comes out with its multiple LAP model and the algorithm to solve it.Sixthly, it discusses the two levels LAP of the imported iron ore Transshipment of WISCO. On the basis of the two levels imported iron ore Transshipment of WISCO, it puts forward the model of two levels LAP and two heuristic algorithms to resolve the two levels WISCO case, on which improves the local greedy algorithm. And then, it expands the load & unload capacity of facility and the total transportation capacity of vehicle, which puts forward further discussion about the two levels WISCO case.Finally, this article concludes the main content, innovated points and presents a prospect on further studies.
Keywords/Search Tags:Location allocation problem, Capacity constraints, Greedy heuristics, Logistics
PDF Full Text Request
Related items