Constraint pre-checking and gene build-in delaying GA for optimizing large-scale distribution networks

To optimize large-scale distribution networks, it is required to solve large-scale vehicle routing problems (VRP) with in interactive response time, with practicable optimality. To satisfy the requirement, a constraint pre-checking method and a gene build-in delaying GA are proposed. This gene build-in delaying GA postpones the reproduction of genes whose fitness cannot be determined only by local conditions, and preferentially reproduces genes which have stronger relation to just reconstructed genes. Moreover, constraint pre-checking method adopts the constraint propagation method into the GA. This method statistically analyses constraints on the VRP, before starting GA and generates a two dimensional array. This array shows the node, which cannot be contained together in one truck route. Therefore, the calculation efficiency of the crossover and mutation operations is improved by using this array in reconstructing individuals. Our experiments prove that this method enables interactive simulations of large-scale distribution networks.

[1]  John N. Hooker,et al.  Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search , 1995, Transp. Sci..

[2]  Setsuo Tsuruta,et al.  Delivery route scheduling method combining knowledge-base with general algorithms , 2000, Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0.

[3]  Atsuko Ikegami,et al.  The Vehicle Routing Problem with Time Constraints , 1995 .

[4]  Setsuo Tsuruta,et al.  Knowledge-Embedded Multi-Stage Genetic Algorithm for Interactively Optimizing a Large-Scale Distribution Network , 2001, FLAIRS Conference.

[5]  Yoshio Taniguchi,et al.  Computer-aided distribution network designing system , 2002, Proceedings of the International Conference on Control Applications.

[6]  Loo Hay Lee,et al.  A messy genetic algorithm for the vehicle routing problem with time window constraints , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[7]  François Laburthe,et al.  Solving Small TSPs with Constraints , 1997, ICLP.

[8]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[9]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..