| Article ID: | iaor20082532 |
| Country: | South Korea |
| Volume: | 33 |
| Issue: | 3 |
| Start Page Number: | 303 |
| End Page Number: | 311 |
| Publication Date: | Sep 2007 |
| Journal: | Journal of the Korean Institute of Industrial Engineers |
| Authors: | Hwang Hark, Oh Yong Hui, Park Keum Ae |
| Keywords: | heuristics, programming: travelling salesman, distribution |
This study deals with a type of vehicle routing problem faced by managers of some department stores during peak sales periods. The problem is to find a set of traveling paths of vehicles that leave a department store and arrive at a destination specified for each vehicle after visiting customers without violating time and capacity constraints. The mathematical model is formulated with the objective of maximizing the sum of the rewards collected by each vehicle. Since the problem is known to be NP-hard, a heuristic algorithm is developed to find the solution. The performance of the algorithm is compared with the optimum solutions obtained from CPLEX for small size problems and a priority-based Genetic Algorithm for large size problems.