Related Experiment Video
Updated: Apr 27, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
A bio-inspired method for the constrained shortest path problem
Hongping Wang1, Xi Lu1, Xiaoge Zhang1
1School of Computer and Information Science, Southwest University, Chongqing 400715, China.
Abstract:
The constrained shortest path (CSP) problem has been widely used in transportation optimization, crew scheduling, network routing and so on. It is an open issue since it is a NP-hard problem. In this paper, we propose an innovative method which is based on the internal mechanism of the adaptive amoeba algorithm. The proposed method is divided into two parts. In the first part, we employ the original amoeba algorithm to solve the shortest path problem in directed networks. In the second part, we combine the Physarum algorithm with a bio-inspired rule to deal with the CSP. Finally, by comparing the results with other method using an examples in DCLC problem, we demonstrate the accuracy of the proposed method.
Related Concept Videos
Optimization Problems
Short-distance Transport of Resources
Biot-Savart Law: Problem-Solving
Consider a mobile phone battery bank as a source of steady current, which flows through the wire connected between the two. What is the magnitude of the magnetic field created by this current at a field point P?
To estimate the magnitude of the total magnetic field, we first consider a small current element of length dl, at a distance r from the field point. Now the following...
Optimal Foraging
Distance Problem
Statically Indeterminate Problem Solving

