Dissertation > Excellent graduate degree dissertation topics show

Research on Routing Optimization Problem of 4th Party Logistics with Stochastic Transportation Time

Author: ZhangZuo
Tutor: HuangMin
School: Northeastern University
Course: Systems Engineering
Keywords: 4PL Stochastic Transportation Time Routing Optimization Harmony Search Algorithm
CLC: N945.15;F252
Type: Master's thesis
Year: 2010
Downloads: 120
Quote: 0
Read: Download Dissertation

Abstract


Along with the development of globalization, people have recognized that optimization and integration of supply chain are playing a more and more important role in competition between modern enterprises. The birth of 4th party logistics (4PL) just complies with this trend. The 4PL provider takes on the task of integrating and optimizing the whole logistics system. It is proved that 4PL has improved the efficiency and has reduced the operation cost sharply, so the relevant research has significant meaning.Generally speaking, the main job of 4PL provider is to select suitable 3PL suppliers from a huge amount to find out a path costs the lowest. In pass researches, researchers always abstracted a multi-graph whose arcs represent the 3PL suppliers from logistics system. Although there has been some progresses in this field, most of them are standing on deterministic problems without considering influences by practical changes. In this thesis, we put objective factors that cause disturbances of 3PL transport time into consideration. At this time, we assume these time disturbances follow normal distribution and have their own upper and lower bounds. Under all premises above, we research single point to single point and single point to multi-point 4PL routing optimization problems.After reviewing 4PL, stochastic programming and Harmony Search algorithm (HS), we make our study as follows:Firstly, we start with single point to single point 4PL routing optimization problem with stochastic transportation time and establish expected value model, chance-constrained programming model and approximative equivalent deterministic model of chance-constrained programming based on multi-graph.Moreover, design enumeration algorithm, heuristic algorithm with prejudgement of infeasible graph, HS and HS with constrained Dijkstra. Results come from comparison and analysis of these four algorithms:enumeration algorithm can get the accurate solution, yet time-consumming; the heuristic algorithm shorts this time and can get the same result, but the time is still unsatisfactory; HS can gain relatively good solution in grately shorter time, but the flaws are the low stability and high iterations; aside from guaranteeing solution, HS with constrained Dijkstra can improve stability and can lower down times of iteration sharply.In addition to the points above, we choose HS with constrained Dijkstra to solve three models, and from the results we can conclude that although expected value model consume shorter time in calculation, it’s robustness is far less than that in demand; chance-constrained programming model cost a lot of time in calculation; approximative equivalent deterministic model of chance-constrained programming can keep balance between robustness and calculating time.Finally, we expand research to single point to multi-point 4PL routing optimization problem with stochastic time. Except for establishing mathematic models, we simulate different examples and analyze the data and results.

Related Dissertations

  1. Divided and presentation of the SOA-based 4PL services,TP393.09
  2. Research on Land Carriage Trade Platform Based on 4PL in Tianjin Port,U652
  3. A Study of Optimization Methods for Ship Pipe Routing Design and Applications,U664.84
  4. Research on the Project Logistics Operation Based on the Fourth-party Logistics,F224
  5. The Research of Vehicle Routing Problem Based on Improved Harmony Search Algrithm,F253.9
  6. Fractal Structure and Dynamic Instability Mechanism Research of the Tailing Dam in Xiadian Gold Mine and the Monitoring Early-Warning System,TV698.1
  7. The Research of Meet-all Distribution Mode Based on Ant-colony Algorithm,F252
  8. Study of Distribution Routing Problem Based on Multiple Objective Genetic Algorithm,TB114.1
  9. An Improved Harmony Search Algorithm and Its Application,TP301.6
  10. The Application Research of Improved Harmony Search Algorithm in Vehicle Routing Problem,TP301.6
  11. The Research on Key Techniques of Mobile Network and NEMO Routing Optimization,TN929.5
  12. Research on Routing Theory and Key Technologies in Mobile Internet,TP393.4
  13. Research on Location and Routing Optimization for Hub-and-Spoke Logistics Network Design,F252
  14. Study of Core Operation Mechanisms of Fourth Party Logistics System Based on CAS,F252
  15. Research on Medical Instrument Vehicle Routing Optimization Problem,R197.2
  16. Applied Research of ITS in LaiGang’s Traffic System,U495
  17. An Analysis of the Fourth Party Logistics and Study on Its Model,F224
  18. Based on Tabu Genetic Optimization of network congestion control,TP393.07
  19. On the Developing Logistics Industry of China and Its Investment Opportunities,F259.2
  20. Optimization Study on Operation Organization of Urban Rail Transit,U239.5
  21. Study of Intra-Domain Route Optimization Based on HMIPV6,TP393.05

CLC: > Economic > Economic planning and management > Material economic > Material flow
© 2012 www.DissertationTopic.Net  Mobile