| Article ID: | iaor20083281 |
| Country: | Netherlands |
| Volume: | 53 |
| Issue: | 2 |
| Start Page Number: | 252 |
| End Page Number: | 262 |
| Publication Date: | Sep 2007 |
| Journal: | Computers & Industrial Engineering |
| Authors: | Hwang Hark, Kim Kap Hwan, Ko Chang Seong, Chung Ki Ho, Shin Jae Young |
| Keywords: | vehicle routing & scheduling, heuristics, programming: travelling salesman |
This study deals with some practical problems of the container road transportation in Korean trucking industries. We examine the workflow in container transportation and then develop mathematical models integrating the various operating and design characteristics of the containers. Several types of formulations are developed utilizing the standard formulations of well known TSP (Traveling Salesman Problem) and VRP (Vehicle Routing Problem). Heuristic algorithms are also presented to solve the models. An example problem is illustrated to explain how to apply the models to the real world through the data set collected from a container trucking company in Korea.