 |
Cho, Byeong Min (조병민)
Email:
Research Area:
Occupation: Woongjin Coway
2007 M.S. Graduation Thesis:
Two-Stage Heuristic for Period Vehicle Routing: Minimizing the Fleet Size
This thesis focuses on period vehicle routing, a multi-period extension of the classical capacitated vehicle routing problem, for the objective of minimizing the maximum number of vehicles simultaneously required over the planning horizon, i.e., the fleet size. In the problem, each customer can be visited one or more times over the planning horizon according to the service combinations of that customer, and the vehicle capacity and the travel time constraints must be satisfied. Due to the complexity of the problem, we suggest a two-stage heuristic algorithm. In the first stage, an initial solution is obtained by assigning a service combination to each customer, updating the routes by inserting each customer to the routes formed so far, and allocating the routes to vehicles while considering the available travel time. Then, the initial solution is improved by changing the service combination assigned to each customer. To show the performance of the two-stage heuristic, computational experiments are done on a number of randomly generated test problems, and the results show that the algorithm suggested in this thesis outperforms the exist ing one.
Lab Seminars:
| 1. |
The periodic vehicle routing problem with intermediate facilities (8.8) |
2006 |
|
