Network design techniques using adapted genetic algorithms

Advances in Engineering Software

Volumn 32, Issue 9, 2001, Pages 731-744

  Gen, Mitsuo ^a   Cheng, Runwei ^a   Oren, Shumuel S ^b  

^a ASHIKAGA INSTITUTE OF TECHNOLOGY   (Japan)

^b DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

And Bicriteria shortest path problem; Centralized network design; Fixed charge transportation problems; Genetic algorithms; Local area network design; Minimum spanning tree; Multistage process planning; Network design

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); DECISION THEORY; GENETIC ALGORITHMS; MATHEMATICAL OPERATORS; TELECOMMUNICATION TRAFFIC; TREES (MATHEMATICS);

BICRITERIA SHORTEST PATH PROBLEMS; MULTISTAGE PROCESS PLANNING;

LOCAL AREA NETWORKS;

EID: 0035451950     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0965-9978(01)00007-2     Document Type: Article

References (49)

1. A computer-aided process planning model based on genetic algorithms
2. An evolution program for the resource-constrained project scheduling problem
3. An adaptive hyperplane approach for multiple objective optimisation problems with complex constraints
4. Location-allocation problems
5. Topological design of centralized computer networks: Formulation and algorithms
6. Augmented Lagrangian-based algorithms for centralized network design
7. Genetic algorithms for solving shortest path problems
8. A spanning tree-based genetic algorithm for bicriteria topological network design
9. Solving multiobjective transportation problem by spanning tree-based genetic algorithm
10. Hybrid genetic algorithms for transportation problem in logistics
11. Hybrid evolutionary method for obstacle location-allocation problem
12. Hybrid evolutionary method for capacitated location-allocation
13. Genetic algorithms for the fixed charge transportation problem
14. A 2n constraint formulation for the capacitated spanning tree problem
15. Experience with a cutting plane algorithm for the capacitated minimal spanning tree problem
16. Facility location in the presence of forbidden regions; I. Formulation and the case of the euclidean distance with one forbidden circle
17. Bicriteria network design using spanning tree-based genetic algorithm
18. A bi-level hierarchical GA for reliable network topology design
19. Selection of process plans in automated manufacturing systems
20. Spanning tree-based genetic algorithm for bicriteria transportation problem with fuzzy coefficients
21. Fixed charge transportation problem by spanning tree-based genetic algorithm
22. A branch and bound algorithm for the capacitated minimum spanning tree problem
23. An efficient method for the muti-depot location-allocation problem
24. Degree-constrained minimum spanning tree
25. Neuer beweis eines satzes über permutation
26. An optimal method for solving (generalized) multi-weber problem
27. A multi-objective routing problem
28. A multi-objective routing problem revisited
29. A tabu search heuristic procedure for the fixed charge transportation problem
30. A genetic algorithm for the linear transportation problem
31. Evolutionary design algorithm for optimal layout of tree networks
32. Evolutionary computation on multicriteria production process planning problem
33. A note on genetic algorithm approach to the degree-constrained spanning tree problems
34. Approach to degree-constrained minimum spanning tree problem using genetic algorithm