An efficient physarum algorithm for solving the bicriteria traffic assignment problem

Xiaoge Zhang (Corresponding Author)

Research output: Journal article publicationJournal articleAcademic researchpeer-review

4 Citations (Scopus)

Abstract

We develop a Physarum-inspired approach to address the bicriteria traffic equilibrium problem, where the path cost function considered has two attributes: travel time and toll. These attributes are combined into a nonlinear generalized cost. The proposed method is implemented using a three-step procedure. First, Physarum model is generalized to solve the shortest path problem in directed networks. Second, we extend it to network optimization problem with multiple sources and sinks. Third, a novel function is proposed to combine the current cost and the cost in the next iteration. This function guarantees Physarum algorithm’s convergence to the optimal traffic flow distribution through the network. Two numerical examples with different link cost functions are conducted to demonstrate the feasibility of the proposed algorithm in this class of traffic equilibrium problems.

Original languageEnglish
Pages (from-to)473-490
Number of pages18
JournalInternational Journal of Unconventional Computing
Volume11
Issue number5-6
Publication statusPublished - 2015
Externally publishedYes

Keywords

  • Network optimization
  • Physarum
  • Shortest path
  • Traffic equilibrium

ASJC Scopus subject areas

  • General Computer Science

Fingerprint

Dive into the research topics of 'An efficient physarum algorithm for solving the bicriteria traffic assignment problem'. Together they form a unique fingerprint.

Cite this