A selfish constraint satisfaction genetic algorithm for planning a long-distance transportation network

✍ Scribed by Takashi Onoyama; Takuya Maekawa; Sen Kubota; Setsuo Tsuruta; Norihisa Komoda

• Book ID: 102158811
• Publisher: Wiley (John Wiley & Sons)
• Year: 2008
• Tongue: English
• Weight: 468 KB
• Volume: 91
• Category: Article
• ISSN: 1942-9533
• DOI: 10.1002/ecj.10042

✦ Synopsis

Abstract

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 these strict‐constraint problems, a selfish constraint satisfaction genetic algorithm (GA) is proposed. In this GA, each gene of an individual satisfies only its constraint selfishly, disregarding the constraints of other genes in the same individuals. Moreover, a constraint prechecking method is also applied to improve the GA convergence speed. The experimental result shows the proposed method can obtain an accurate solution in a practical response time. © 2009 Wiley Periodicals, Inc. Electron Comm Jpn, 91(9): 1– 10, 2008; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecj.10042