Application of genetic algorithm to a parallel path selection problem

International Journal of Systems Science

Volumn 27, Issue 2, 1996, Pages 269-274

  Sannomiya, Nobuo ^a   Tatemura, Kyoichi ^b  

^a KYOTO INSTITUTE OF TECHNOLOGY   (Japan)

^b NIPPON STEEL CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; CRITICAL PATH ANALYSIS; CRUDE PETROLEUM; GRAPH THEORY; OPTIMIZATION; PETROLEUM TRANSPORTATION;

PARALLEL PATH SELECTION PROBLEM; SUBNETWORK;

GENETIC ALGORITHMS;

EID: 0030085167     PISSN: 00207721     EISSN: 14645319     Source Type: Journal    
DOI: 10.1080/00207729608929213     Document Type: Article

References (5)

1. Dijkstra, E. W., 1959, A note on two problems in connexion with graphs. Numerische Mathemalik, 1, 269-271.
2. Goldberg, D. E., 1989, Genetic Algorithms in Search, Optimization and Machine Learning (Reading, Mass.: Addison-Wesley).
3. Iima, H., and Sannomiya, N., 1992, Genetic algorithm approach to a production ordering problem, Transactions of the Society of Instrument and Control Engineers, 28, 1337-1344 (in Japanese).
4. Jones, D. R., and Beltramo, M. A., 1991, Solving partitioning problem with genetic algorithms. Proceedings of the Fourth International Conference on Generic Algorithms (Morgan Kaufmann), pp. 442-449.
5. Tatemura, K., and Sannomiya, N., 1992, A solution of parallel path selection problem by using genetic algorithm. Transactions of the Institute of Systems, Control and Information Engineers, 5, 524-526 (in Japanese).