Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

Vehicle Routing Problem with Time Windows and Driving/Working Time Restrictions

Yang, Xiaozhe

Abstract Details

2008, Master of Science (MS), Ohio University, Industrial and Systems Engineering (Engineering and Technology).
In this thesis, a new Vehicle Routing Problem with time windows is introduced where driving time and working time restrictions are imposed on the problem. The objective is to minimize the total traveling distance. A mathematical model and also a genetic algorithm-based solution technique are proposed first and later they are compared. The results show that GA can find the optimal solution with a high frequency for small problems. Two new genetic operators (route-sensitive crossover and route-sensitive mutation) are also proposed to solve this particular problem. The results of the experiments also show that the proposed crossover operator and swap mutation outperformed the classical operators.
Gursel A. Suer (Advisor)
93 p.

Recommended Citations

Citations

  • Yang, X. (2008). Vehicle Routing Problem with Time Windows and Driving/Working Time Restrictions [Master's thesis, Ohio University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1227621524

    APA Style (7th edition)

  • Yang, Xiaozhe. Vehicle Routing Problem with Time Windows and Driving/Working Time Restrictions. 2008. Ohio University, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1227621524.

    MLA Style (8th edition)

  • Yang, Xiaozhe. "Vehicle Routing Problem with Time Windows and Driving/Working Time Restrictions." Master's thesis, Ohio University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1227621524

    Chicago Manual of Style (17th edition)