Application of genetic algorithm to a parallel path selection problem

DOI10.1080/00207729608929213MaRDI QIDQ4882359zbMATH OpenOpenAlexFDO

Authors Nobuo Sannomiya, Kyoichi Tatemura

Publication date 2 September 1996

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207729608929213

zbMATH Keywords

decompositionoptimal selection of multiple parallel pathssubnetworks

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1501196
• Using genetic algorithm solving shortest path problem
• A network parallel genetic algorithm for the one machine sequencing problem
• scientific article; zbMATH DE number 4162668

Cites work

• A note on two problems in connexion with graphs
• scientific article; zbMATH DE number 194544 (Why is no real title available?)

Cited in

(4)

• Determine the optimal carrier selection for a logistics network based on multi-commodity reliability criterion
• scientific article; zbMATH DE number 6006777 (Why is no real title available?)
• Pareto solution set and its genetic algorithm for multi-objective network dissimilar paths
• Multiobjective non overlapping path guidance algorithm based on genetic algorithm

This page was built for publication: Application of genetic algorithm to a parallel path selection problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882359)