A single-level mixed integer linear formulation for a bi-level discrete network design problem

► An approximately equivalent single-level formulation for a bi-level discrete network design problem. ► An MILP formulation for discrete network design problem, handling side constraints. ► An efficient unimodular linear approximation scheme for nonlinear travel time function. Discrete network desi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Transportation research. Part E, Logistics and transportation review Ročník 47; číslo 5; s. 623 - 640
Hlavní autoři: Farvaresh, Hamid, Sepehri, Mohammad Mehdi
Médium: Journal Article
Jazyk:angličtina
Vydáno: Exeter Elsevier India Pvt Ltd 01.09.2011
Elsevier
Elsevier Sequoia S.A
Edice:Transportation Research Part E: Logistics and Transportation Review
Témata:
Approximation
Bi-level programming
Discrete network design problem
Discrete network design problem Bi-level programming Transportation network Multi-commodity flows
Formulations
Ganzzahlige Optimierung
Güterverkehr
Integer programming
Linear programming
Mathematical analysis
Mathematical functions
Mathematical problems
Mixed integer
Multi-commodity flows
Networks
Nonlinearity
Time functions
Transportation
Transportation network
Validation studies
Verkehrsinfrastruktur
Verkehrsplanung
Multi-commodity flows
Bi-level programming
Discrete network design problem
Transportation network
ISSN:1366-5545, 1878-5794
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:► An approximately equivalent single-level formulation for a bi-level discrete network design problem. ► An MILP formulation for discrete network design problem, handling side constraints. ► An efficient unimodular linear approximation scheme for nonlinear travel time function. Discrete network design problem (DNDP) is generally formulated as a bi-level programming. In this paper, a single-level mixed integer linear programming (SL-MILP) formulation for bi-level DNDP is presented. To cope with the dependency of node-link adjacency matrix on new links, travel time function is appropriately modified. The nonlinearity of the travel time function is also removed by means of a convex-combination based linear approximation which takes advantage of a unimodular structure. Two valid inequalities is developed which shorten computation time significantly. The validity of the proposed formulation is examined by two test problems. SL-MILP is able to provide optimal solution.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1366-5545
1878-5794
DOI:10.1016/j.tre.2011.02.001