Application of genetic algorithm to a parallel path selection problem

DOI10.1080/00207729608929213zbMATH Open0844.90102OpenAlexW1993796847MaRDI QIDQ4882359FDOQ4882359

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

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
• Publication:3489795

zbMATH Keywords

decompositionsubnetworksoptimal selection of multiple parallel paths

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A note on two problems in connexion with graphs

Cited In (4)

• Multiobjective non overlapping path guidance algorithm based on genetic algorithm
• Title not available (Why is that?)
• Determine the optimal carrier selection for a logistics network based on multi-commodity reliability criterion
• Pareto solution set and its genetic algorithm for multi-objective network dissimilar paths

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)