An intelligent evolutionary computation approach for solving the shortest path problem
zbMATH Open1400.90291MaRDI QIDQ4963196FDOQ4963196
Authors: Behzad Moradi 
Publication date: 6 November 2018
Full work available at URL: http://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-30-number-4-6-2018/mvlsc-30-4-6-p-335-357/
Recommendations
- A improved evolutionary algorithm for the shortest path routing problem
- Finding shortest path with learning algorithms
- Using genetic algorithm solving shortest path problem
- Nonlinear neural networks for solving the shortest path problem
- Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics
combinatorial optimizationgraph theoryshortest pathevolutionary computationlearnable evolution modelpath encoding
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Title not available (Why is that?)
- Learnable evolution model: Evolutionary processes guided by machine learning
- The LEM3 system for multitype evolutionary optimization
- Evolutionary computation for dynamic optimization problems
- Complex system modelling and control through intelligent soft computations. Selected papers based on the presentations at the 5th international conference on modelling, identification and control, Cairo, Egypt, August 31 -- September 2, 2013
- Evolutionary Multi-Criterion Optimization
- Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem
- An anticipation mechanism for the shortest path problem based onPhysarum polycephalum
Cited In (4)
This page was built for publication: An intelligent evolutionary computation approach for solving the shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4963196)
