Please use this identifier to cite or link to this item:
Title: A physarum polycephalum optimization algorithm for the bi-objective shortest path problem
Authors: Zhang, X
Wang, Q
Chan, FTS 
Mahadevan, S
Deng, Y
Issue Date: 2013
Source: International journal of unconventional computing, 2013, v. 10, no. 41671, p. 143-162
Abstract: Multi-objective shortest path problem (MOSP) plays an important role in practical applications, which seeks for the efficient paths satisfying several conflicting objectives between two nodes of a network. In this paper, we present an algorithm based on Physarum Polycephalum model to solve the bi-objective shortest path problem. By aggregating the two attributes into one by weighted sum, we successfully convert the bi-objective shortest path problem (BOSP) into the shortest path problem. Here, in order to reduce the computational time, binary weight allocation (BWA) technique is implemented to distribute the weight for each criterion. To check the quality of the proposed method and the accuracy of the algorithm, experimental analyzes are conducted. Random networks are generated to verify the accuracy of the proposed algorithm. Results on the testing problems are compared with label correcting algorithm known as an efficient algorithm for solving the BOSP. The results demonstrate the proposed Physarum Polycephalum optimization algorithm can produce the non-dominated solutions successfully when dealing with the BOSP.
Keywords: Biobjective shortest path problem
Pareto frontiers
Physarum polycephalum
Shortest path problem
Publisher: Old City Publishing Inc
Journal: International Journal of Unconventional Computing 
ISSN: 1548-7199
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Aug 19, 2020


Last Week
Last month
Citations as of Sep 19, 2020

Page view(s)

Last Week
Last month
Citations as of Sep 20, 2020

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.