Premium
A selfish constraint satisfaction genetic algorithm for planning a long‐distance transportation network
Author(s) -
Onoyama Takashi,
Maekawa Takuya,
Kubota Sen,
Tsuruta Setsuo,
Komoda Norihisa
Publication year - 2008
Publication title -
electronics and communications in japan
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.131
H-Index - 13
eISSN - 1942-9541
pISSN - 1942-9533
DOI - 10.1002/ecj.10042
Subject(s) - constraint (computer aided design) , genetic algorithm , convergence (economics) , constraint satisfaction problem , mathematical optimization , constraint satisfaction , computer science , hybrid algorithm (constraint satisfaction) , algorithm , mathematics , local consistency , artificial intelligence , economics , probabilistic logic , economic growth , geometry
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