<p> Vehicle Routing Problems (VRP) deal with the delivery of vehicles to multiple destinations (or customers). The objective of VRP is to minimize the total travel cost (e.g., time). This thesis investigates and develops algorithms to solve VRP in time-dependent large road networks. An efficient and effective time-dependent shortest path algorithm is developed. Experiment results show that the arc labeling algorithm is more space efficient compared to the classic node labeling algorithm. This thesis also develops assignment algorithms in order to minimize the maximum travel cost while minimizing the total travel cost. Several methods are implemented to investigate the factors that affect computation efficiency of VRP, including road network size and structure, and computer programming. The applicability of Genetic Algorithms is also studied. Computer programs of algorithms are developed in several software environments including General Algebraic Modeling System (GAMS; GAMS Development Corporation, 2013), MATLAB, Microsoft Excel 2013, and Microsoft Visual Studio 2013. The results show that VRP in a time-dependent large road network can be solved efficiently and effectively using the algorithms and methods developed in this thesis.</p>
| Identifer | oai:union.ndltd.org:PROQUEST/oai:pqdtoai.proquest.com:1571932 |
| Date | 29 January 2015 |
| Creators | Zhang, Zhu |
| Publisher | Southern Illinois University at Edwardsville |
| Source Sets | ProQuest.com |
| Language | English |
| Detected Language | English |
| Type | thesis |
Page generated in 0.0017 seconds