Please use this identifier to cite or link to this item:
|Title:||Hybrid genetic algorithms in solving vehicle routing problems with time window constraints|
|Authors:||Tan, K.C. |
Vehicle routing problems with time window constraints
|Citation:||Tan, K.C.,Lee, L.H.,Ou, K. (2001-05). Hybrid genetic algorithms in solving vehicle routing problems with time window constraints. Asia-Pacific Journal of Operational Research 18 (1) : 121-130. ScholarBank@NUS Repository.|
|Abstract:||This paper describes the authors' research on Genetic Algorithms (GAs) in solving Vehicle Routing Problems with Time Window Constraints (VRPTW). In the vehicle routing problem, a set of vehicles with limited capacity, are to be routed from a central depot to a set of geographically dispersed customers with known demands and predefined time windows. To solve the problem, the optimized assignment of vehicles to each customer is needed as to achieve the minimal total cost without violating the capacity and time window constraints. VRPTW is NP-hard problem and best solved to optimum or near optimum by heuristics. Here we explore the hybrid Genetic Algorithms (hGAs) which combine with local search method to solve the representation problem in the simple GAs. The implemented heuristic is applied to solve Solomon's 56 VRPTW 100-customer instances, and yield 18 solutions better than or equivalent to the best solutions ever published in literature.|
|Source Title:||Asia-Pacific Journal of Operational Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.