Please use this identifier to cite or link to this item:
|Title:||A messy genetic algorithm for the vehicle routing problem with time window constraints||Authors:||Tan, K.C.
|Issue Date:||2001||Citation:||Tan, K.C.,Lee, T.H.,Ou, K.,Lee, L.H. (2001). A messy genetic algorithm for the vehicle routing problem with time window constraints. Proceedings of the IEEE Conference on Evolutionary Computation, ICEC 1 : 679-686. ScholarBank@NUS Repository.||Abstract:||In Vehicle Routing Problems with Time Window Constraints (VRPTW), 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. Combinatorial optimization problems of this kind are NP-hard and are best solved to the near optimum by heuristics. This paper describes the authors' research on a rare class of genetic algorithms, known as the Messy Genetic Algorithms (mGA) in solving the VRPTW problem. The raGA has the merit of directly realizing the relational search needed in VRPTW representation, which cannot be easily realized using simple heuristic methods. The raGA was applied to solve the benchmark Solomon's 56 VRPTW 100-customer instances, and yielded 23 solutions better than or equivalent to the best solutions e ver published in literature.||Source Title:||Proceedings of the IEEE Conference on Evolutionary Computation, ICEC||URI:||http://scholarbank.nus.edu.sg/handle/10635/51081|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 11, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.