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. Index Term -- genetic algorithm, logistics network, cooperative logistics, vehicle routing problem

• Type: Journal
• Year: 2008
• Where: JCP
• Authors: Takashi Onoyama, Takuya Maekawa, Yoshitaka Sakurai, Setsuo Tsuruta, Norihisa Komoda
• Keywords: Cooperative Logistics, JCP 2008, Logistics Network, Many Strict Constraints