Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)
- Volume 22 Issue 53
- /
- Pages.37-44
- /
- 1999
- /
- 2005-0461(pISSN)
- /
- 2287-7975(eISSN)
A 3-D Genetic Algorithm for Finding the Number of Vehicles in VRPTW
- Paik, Si-Hyun (Industrial Engineering department of Ajou University) ;
- Ko, Young-Min (Industrial Engineering department of Ajou University) ;
- Kim, Nae-Heon (Industrial Engineering department of Ajou University)
- Published : 1999.12.01
Abstract
The problem to be studied here is the minimization of the total travel distance and the number of vehicles used for delivering goods to customers. Vehicle routes must also satisfy a variety of constraints such as fixed vehicle capacity, allowed operating time. Genetic algorithm to solve the VRPTW with heterogeneous fleet is presented. The chromosome of the proposed GA in this study has the 3-dimension. We propose GA that has the cubic-chromosome for VRPTW with heterogeneous fleet. The newly suggested ‘Cubic-GA (or 3-D GA)’ in this paper means the 2-D GA with GLS(Genetic Local Search) algorithms and is quite flexible. To evaluate the performance of the algorithm, we apply it to the Solomon's VRPTW instances. It produces a set of good routes and the reasonable number of vehicles.
Keywords
- VRP(Vehicle Routing Problem);
- VRPTW(Vehicle Routing Problem with Time Windows);
- VRPTWHtF(Vehicle Routing Problem with Time Windows and Heterogeneous Fleet);
- GA (Genetic Algorithm);
- GLS(Genetic Local Search)