An Algorithm for the Decomposition of Arc Flows into Path Flows for the General Spatial Price Equilibrium Problem

The general spatial price equilibrium problem (GSPEP) may be formulated in terms of path flow variables or in terms of arc flow variables. When the variables are the path flow, the solution contains the important information regarding the origin-destination (O/D) demand matrix and the paths used to...

Full description

Saved in:
Bibliographic Details
Published in:INFOR. Information systems and operational research 1990-11, Vol.28 (4), p.403
Main Author: Drissi-Kaitouni, Omar
Format: Article
Language:English
Subjects:
Algorithms
Computer networks
Decomposition
Equilibrium
Mathematical models
Operations research
Prices
Statistical analysis
Theory
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The general spatial price equilibrium problem (GSPEP) may be formulated in terms of path flow variables or in terms of arc flow variables. When the variables are the path flow, the solution contains the important information regarding the origin-destination (O/D) demand matrix and the paths used to transport goods. When the problem is solved in terms of the arc flows, the solution gives only the flows on the arcs of the network. The algorithms that have been proposed to solve the GSPEP in terms of arc flows are more efficient than those for the path flow algorithm because of the enormous number of possible paths. An algorithm called CAFPF (conversion of arc flows into path flows) is proposed. It decomposes the arc flow equilibrium into a path flow equilibrium by a sequence of minimal path cost computations. CAFPF is then used after the GSPEP has been solved in terms of arc flows, giving the information on the O/D demand matrix and on the path flows. Numerical results show the efficiency of CAFPF.
ISSN:0315-5986
1916-0615