文档介绍：Brock University
Department puter Science
A Hybrid Search Based on ic Algorithms and Tabu Search for Vehicle Routing
. Ombuki, M. Nakamura, M. Osamu
Technical Report # CS-02-07
May 2002
Brock University
Department puter Science
St. Catharines, Ontario
Canada L2S 3A1
.ca
A HYBRID SEARCH BASED ON IC ALGORITHMS AND
TABU SEARCH FOR VEHICLE ROUTING
Beatrice M. Ombuki Morikazu Nakamura Maeda Osamu
Department puter Science Dept. of Information Engineering Dept. of Information Engineering
Brock University University of the Ryukyus University of the Ryukyus
St. Catharines, ON, Canada L2S 3A1 Okinawa 903-0213, Japan Okinawa 903-0213, Japan
******@ ******@- ******@-
ABSTRACT the customers without violating the capacity and time win-
We present a hybrid search technique based on meta- dow constraints, while minimizing the total distance trav-
heuristics for approximately solving the vehicle routing eled and the number of vehicles employed.
problem with time windows (VRPTW). The approach is
The VRPTW is a classical example of plete
two phased; a global customer clustering phase based on
multi-objective optimization problems. binatorial
ic algorithms (GAs) and a post-optimization local
explosion is obvious and finding exact optimal s