A heuristic method for a congested capacitated transit assignment model with strategies

•The capacitated congested strategy-based transit assignment is solved using an MSA method as result of its VI reformulation.•At each iteration a capacitated linear problem is solved using Lagrangian relaxation, generating the hyperpaths of the solution.•Solutions are always capacity feasible, even...

Full description

Saved in:

Bibliographic Details
Published in:	Transportation research. Part B: methodological Vol. 106; pp. 293 - 320
Main Authors:	Codina, Esteve, Rosell, Francisca
Format:	Journal Article Publication
Language:	English
Published:	Elsevier Ltd 01.12.2017
Subjects:	49 Calculus of variations and optimal control; optimization 49R50 Variational methods for eigenvalues of operators 65 Numerical analysis 65C Probabilistic methods, simulation and stochastic differential equations 90 Operations research, mathematical programming 90C Mathematical programming Anàlisi matemàtica Anàlisi numèrica Calculus of variations Classificació AMS Congested transit assignment Càlcul de variacions Heuristic methods Investigació operativa Matemàtiques i estadística Numerical analysis Probabilitat Programació (Matemàtica) Programming (Mathematics) Simulation methods Strategy-based transit equilibrium Variational inequalities Àrees temàtiques de la UPC Congested transit assignment Strategy-based transit equilibrium Heuristic methods Variational inequalities
ISSN:	0191-2615, 1879-2367
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!