A Freight Service Design Problem for a Railway Corridor
Published Online:18 Feb 2011https://doi.org/10.1287/trsc.1100.0348
References
- Designing new European rail freight services. J. Oper. Res. Soc. (2009) 60(3):348–360Crossref, Google Scholar
- Modelling corridor freight transport for demonstration of seamless international rail freight services. (2007) . Technical report, University of Maryland, College ParkGoogle Scholar
- Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46(3):316–329Link, Google Scholar
- , Cook W., Schulz A. S. Improved approximation algorithms for resource allocation. Proc. 9th Internat. IPCO Conf. Integer Programming and Combin. Optim. Vol. 2337 (2002) (Springer-Verlag, Berlin/Heidelberg) 401–414Lecture Notes Comput. Sci.Crossref, Google Scholar
- , Jacob R., Müller-Hannemann M. Freight service design for the Italian railways company. ATMOS 2006—6th Workshop on Algorithmic Methods and Models for Optimization of Railways (2006) Dagstuhl, GermanyInternationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, GermanyGoogle Scholar
- , Barnhart C., Laporte G. Passenger railway optimization. Transportation, Handbooks in Operations Research and Management Science (2007) 14(Elsevier, Amsterdam) 129–187Google Scholar
- Optimizing the cargo express service of Swiss federal railways. Transportation Sci. (2008) 42(4):450–465Link, Google Scholar
- A survey of optimization models for train routing and scheduling. Transportation Sci. (1998) 32(4):308–404Link, Google Scholar
- Service network design in freight transportation. Eur. J. Oper. Res. (2000) 122(2):272–288Crossref, Google Scholar
- Planning models for freight transportation. Eur. J. Oper. Res. (1997) 97(3):409–438Crossref, Google Scholar
- ETIS Deliverable 5: Database methodology development and database user manual—Freight transport demand. (2005) . Retrieved June 2010, http://www.etis-eu.org/Google Scholar
- Solving the freight car flow problem to optimality. Electronic Notes Theoret. Comput. Sci. (2002) 66(6):42–52Crossref, Google Scholar
- Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freedman, New York) Google Scholar
- Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound. Oper. Res. (1998) 46(2):247–259Link, Google Scholar
- Dynamic network simulation-assignment platform for multiproduct intermodal freight transportation analysis. Transportation Res. Record (2007) 2032:9–16Crossref, Google Scholar
- Knapsack Problems: Algorithms and Computer Implementations (1990) (John Wiley & Sons, Chichester, UK) Google Scholar
- Market potential for international rail-based intermodal services in Europe: From sea to shining sea. Transportation Res. Record (2008) 2066:21–30Crossref, Google Scholar
- REORIENT Deliverable 0.1: Project management plan. (2004) . Retrieved June 2010, https://www.reorient.org.ukGoogle Scholar
- TRANSTOOLS Deliverable 2: Description of the data sets needed for model estimation and calibration, supported by databases. (2005) . Retrieved June 2010, http://www.inro.tno.nl/transtools/deliverables.htmGoogle Scholar
- Application and validation of a dynamic freight simulation-assignment model to a large-scale intermodal rail network: The pan-European case. Transportation Res. Record (2008) 2066:9–20Crossref, Google Scholar

