| Article ID: | iaor20023590 |
| Country: | China |
| Volume: | 22 |
| Issue: | 3 |
| Start Page Number: | 245 |
| End Page Number: | 248 |
| Publication Date: | Jun 2001 |
| Journal: | Journal of Northeastern University |
| Authors: | Tang Lixin, Wang Mengguang, Li Jia, Song Jianhai |
| Keywords: | genetic algorithms, tabu search |
A special kind of vehicle routing problem is described and its characteristics are analyzed. By defining the ‘fleet pattern’, a solution framework is presented, and a hybrid genetic algorithm (GA) composed of GA and tabu search (TS) is presented. For solving the heterogeneous fleet vehicle routing problem (VRP), the hybrid algorithm integrates the advantages of GA (good at global searching) and TS (good at mountain climbing). The separate coding and decoding rules for fleet and task model the characteristics of the heterogeneous fleet VRP. The validity of the framework, model and algorithm are proved.