A genetic algorithm for the optimization of cable routing
- 21 April 2006
- journal article
- Published by Wiley in Systems and Computers in Japan
- Vol. 37 (7), 61-71
- https://doi.org/10.1002/scj.10250
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A genetic algorithm for the multiple destination routing problemsIEEE Transactions on Evolutionary Computation, 1998
- Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithmNetworks, 1995
- Adapting the Evaluation Space to Improve Global Learning,Published by Defense Technical Information Center (DTIC) ,1991
- A computational study of a multiple-choice knapsack algorithmACM Transactions on Mathematical Software, 1983
- The Multiple-Choice Knapsack ProblemOperations Research, 1979