Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths

European Journal of Operational Research

Volumn 188, Issue 1, 2008, Pages 101-108

  Holmberg, Kaj ^a   Joborn, Martin ^b   Melin, Kennet ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

^b Jeppesen Systems AB   (Sweden)

Author keywords

Fixed charges; Heuristics; Lagrange; Network flow; Railways

Indexed keywords

COSTS; INFORMATION ANALYSIS; LAGRANGE MULTIPLIERS; PROBLEM SOLVING;

CAPACITY RESTRICTIONS; FIXED CHARGES; NETWORK FLOW; RAILWAYS;

HEURISTIC PROGRAMMING;

EID: 37449028914     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.04.029     Document Type: Article

References (8)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows. Theory, Algorithms and Applications (1993), Prentice Hall
2. Geoffrion A.M. Lagrangian relaxation for integer programming. Mathematical Programming Study 2 (1974) 82-114
3. Holmberg K., and Hellstrand J. Solving the uncapacitated network design problem by a Lagrangian heuristic and branch-and-bound. Operations Research 46 (1998) 247-259
4. K. Holmberg, M. Joborn, K. Melin, Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths, Research Report LiTH-MAT-R-2004-15, Department of Mathematics, Linköping Institute of Technology, Sweden 2004.
5. Holmberg K., and Yuan D. A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Operations Research 48 (2000) 461-481
6. Joborn M., Crainic T., Gendreau M., Holmberg K., and Lundgren J. Economies of scale in empty freight car distribution in scheduled railways. Transportation Science 28 (2004) 121-134
7. Magnanti T.L., and Wong R.T. Network design and transportation planning: Models and algorithms. Transportation Science 18 (1984) 1-55
8. Poljak B.T. A general method of solving extremum problems. Soviet Mathematics Doklady 8 (1967) 593-597