Optimization Online


Decomposition methods based on projected gradient for network equilibrium problems

Andrea Cassioli(cassioli***at***dsi.unifi.it)
David Di Lorenzo(david.dilorenzo***at***yahoo.it)
Marco Sciandrone(sciandro***at***dsi.unifi.it)

Abstract: In this work we consider the symmetric network equilibrium problem formulated as convex minimization problem whose variables are the path flows. In order to take into account the difficulties related to the large dimension of real network problems we adopt a column generation strategy and we employ a gradient projection method within an inexact decomposition framework. We present a general decomposition algorithm model and we derive several specific algorithms for network equilibrium problems. Global convergence results are established. Computational experiments performed on medium-large dimension problems show the validity and the effectiveness of the proposed approach.

Keywords: decomposition method, network equilibrium, projected gradi- ent, column generation, Gauss-Seidel method

Category 1: Convex and Nonsmooth Optimization (Convex Optimization )

Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )

Category 3: Applications -- OR and Management Sciences (Transportation )


Download: [PDF]

Entry Submitted: 09/13/2011
Entry Accepted: 09/13/2011
Entry Last Modified: 09/13/2011

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society