Industrial and Management Systems Engineering


Date of this Version

Winter 12-3-2010


A Thesis Presented to the Faculty of The Graduate College at University of Nebraska In Partial Fulfillment of Requirements For the Degree of Master of Science, Major: Industrial and Management Systems Engineering, Under the Supervision of Professor Erick C. Jones. Lincoln, Nebraska: December, 2010
Copyright 2010 Jian Han


Vehicle routing problem (VRP) is the main issue of the transportation. It is becoming more and more popular. Trucking companies play an important role in the transportation industry. Most trucking companies are developing their own software to make profit. Often, the software is used for routing optimization models to minimize cost because the first work is organized over the road.

Linear Programming and saving heuristics are traditional algorithms for solving the vehicle routing problems. However, none of the companies want to make a decision of routing by calculating with mathematics models in their companies. So the vehicle routing software is being used in the trucking company. This paper will present two traditional models and one in-house vehicle routing optimization software, running the same data, then compare the result, and see the results of each model. The results of the data demonstrated the best model was located in the in-house optimization software. This research approach can be used in the similar companies.

Adviser: Erick C. Jones

title page.pdf (96 kB)