.png){kind=icon}
Return
An adaptive amoeba algorithm for constrained shortest paths
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2013.07.054.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The constrained shortest path problem (CSP) is one of the basic network optimization problems, which plays an important part in real applications. In this paper, an adaptive amoeba algorithm is combined with the Lagrangian relaxation algorithm to solve the CSP problem. The proposed method is divided into two steps: (1) the adaptive amoeba algorithm is modified to solve the shortest path problem (SPP) in a directed network; (2) the modified adaptive amoeba algorithm is combined with the Lagrangian relaxation method to solve the CSP problem. In addition, the evolving processes of the adaptive amoeba model have been detailed in the paper. Two examples are used to illustrate the efficiency of the proposed method. The results show that the proposed method can deal with the CSP problem effectively. (C) 2013 Elsevier Ltd. All rights reserved.
Keywords:
Constrained shortest path
Adaptive amoeba algorithm
Lagrangian relaxation
Optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
View more organizations
Cited Papers
ShareSaveShareSaveIFSJSP: A novel methodology for the Job-Shop Scheduling Problem based on intuitionistic fuzzy sets
PREAI
ShareSave
ShareSaveA sulfonated Schiff base dimethyltin(iv) coordination polymer: synthesis, characterization and application as a catalyst for ultrasound- or microwave-assisted Baeyer–Villiger oxidation under solvent-free conditions.png)
RSC Advances
RSC AdvancesIF0
PREAI
ShareSave View more