Selfish Constraint Satisfaction Genetic Algorithm for Planning a Long-distance Transportation Network

To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints are imposed on this type of problem. To solve this problem efficiently, a selfish-constraint-satisfaction genetic algorithm (GA) is proposed. In this type GA, each gene of an individual satisfies only its constraints selfishly, disregarding constraints of other genes even in the same individual. Further, to some extent, even individual that violates constraints can survive over several generations and has the chance of reparation. Moreover, a constraint pre-checking and dynamic penalty control methods are also applied to improve convergence of GA. Our experimental result shows that the proposed method can obtain an accurate solution in a practical response time.

[1]  Gilbert Laporte,et al.  Tabu Search Heuristics for the Vehicle Routing Problem , 2005 .

[2]  Mitsuo Gen,et al.  Solution Method of Multi-Product Two-Stage Logistics Problem with Constraints of Delivery Course , 2008 .

[3]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[4]  M. Wasner,et al.  An integrated multi-depot hub-location vehicle routing model for network planning of parcel service , 2004 .

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

[6]  David Simchi-Levi,et al.  The logic of logistics , 1997 .

[7]  Takuya Maekawa,et al.  High-speed planning method for cooperative logistics networks using mixed integer programming model and dummy load , 2005 .

[8]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[9]  R. Lewontin ‘The Selfish Gene’ , 1977, Nature.

[10]  Takahiro Watanabe,et al.  COST ALLOCATION ON VEHICLE ROUTING PROBLEM , 1997 .

[11]  Takuya Maekawa,et al.  Vehicle Routing Problem Solving Method for a Cooperative Logistics Network by Using Multi-Stage GA , 2007 .

[12]  Hiroshi Imai,et al.  A PATH-EXCHANGE-TYPE LOCAL SEARCH ALGORITHM FOR VEHICLE ROUTING AND ITS EFFICIENT SEARCH STRATEGY , 2000 .

[13]  Sadiq M. Sait,et al.  Iterative computer algorithms with applications in engineering - solving combinatorial optimization problems , 2000 .

[14]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[15]  Patricia J. Daugherty,et al.  The impact of operating environment on the formation of cooperative logistics relationships , 1997 .

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

[17]  Paolo Toth,et al.  Exact Solution of the Vehicle Routing Problem , 1998 .

[18]  Setsuo Tsuruta,et al.  A method for solving nested combinatorial optimization problems - a case of optimizing a large-scale distribution network , 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.