Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach

► Mixed network design problem (MNDP) can be formulated as a mixed-integer linear programming problem (MILP) with the link-based formulation which helps avoiding the path enumeration. ► The global optimality of the approximated MNDP can then be guaranteed following the property of the MILP. ► The pr...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Transportation research. Part B: methodological Jg. 45; H. 5; S. 808 - 827
Hauptverfasser:	Luathep, Paramet, Sumalee, Agachai, Lam, William H.K., Li, Zhi-Chun, Lo, Hong K.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Kidlington Elsevier Ltd 01.06.2011 Elsevier
Schriftenreihe:	Transportation Research Part B: Methodological
Schlagworte:	Algorithms Applied sciences Approximation Discrete network design Exact sciences and technology Global optimization Ground, air and sea transportation, marine construction Linear programming Links Mathematical models Mixed network design Mixed-integer linear programming Network design problem Network design problem Discrete network design Mixed network design Mixed-integer linear programming Global optimization Networks Optimization Road transportation and traffic Transportation networks Transportation planning, management and economics Discrete network design Global optimization Mixed-integer linear programming Network design problem Mixed network design Transportation Mixed integer programming Algorithm Modeling Mixed method Optimization Design Traffic assignment Formulation Transportation network Road traffic
ISSN:	0191-2615, 1879-2367
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!