Please use this identifier to cite or link to this item:
|Title:||Using group role assignment to solve Dynamic Vehicle Routing Problem|
|Keywords:||dynamic vehicle routing;ridesharing;group role assignment;Modified Insertion Heuristic Routing;Modified Pairing Or-opt Routing|
|Abstract:||The Dynamic Vehicle Routing Problem (DVRP) is a more complex problem than the traditional Vehicle Routing Problem (VRP) in the combinatorial optimization of operations research. With more degrees of freedom, DVRP introduces new challenges while judging the merit of a given route plan. This thesis utilized the time slice strategy to solve dynamic and deterministic routing problems. Based on Group Role Assignment (GRA) and two different routing methods (Modified Insertion heuristic routing and Modified Composite Pairing Or-opt routing), a new ridesharing system has been designed to provide services in the real world. Simulation results are presented in this thesis. A qualitative comparison has been made to outline the advantages and performance of our solution framework. From the numerical results, the proposed method has a great potential to put into operation in the real world and provides a new transit option for the public.|
|Appears in Collections:||Computational Sciences - Master's theses|
Files in This Item:
|Bo Lei final thesis 0906.pdf||1.38 MB||Adobe PDF|
Items in LU|ZONE|UL are protected by copyright, with all rights reserved, unless otherwise indicated.