An adaptive amoeba algorithm for constrained shortest paths

作者：

Highlights：

• The classical amoeba model is extended to solve the shortest path problem in directed networks.

• The amoeba algorithm is incorporated with Lagrangian relaxation method to solve the constrained shortest path problem.

• Two examples are used to demonstrate the efficiency of the proposed method.

摘要

•The classical amoeba model is extended to solve the shortest path problem in directed networks.•The amoeba algorithm is incorporated with Lagrangian relaxation method to solve the constrained shortest path problem.•Two examples are used to demonstrate the efficiency of the proposed method.

论文关键词：Constrained shortest path,Adaptive amoeba algorithm,Lagrangian relaxation,Optimization

论文评审过程：Available online 26 July 2013.

论文官网地址：https://doi.org/10.1016/j.eswa.2013.07.054