Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard
Published Online:1 Nov 1998https://doi.org/10.1287/trsc.32.4.370
References
- An algorithm for solving traveling salesman and related network optimization problems. (1958) . Presented in ORSA congress, St Louis Google Scholar
- Méthodes de Simulation et d'Optimisation Appliquées à la Gestion Opérationnelle des Chantiers de Transbordement Rapide. (1996) . Doctorate thesis, École Centrale Paris, Chätenay Malabry Google Scholar
- The container allocation problem in rail–rail transshipment shunting yards: Models and algorithms. (1998) . CER no. 96-15, École Centrale Paris, Laboratoire Productique Logistique Google Scholar
- Gams, A User's Guide (1992) (The Scientific Press) . Release 2.25 Google Scholar
- A method for solving traveling salesman problems. Oper. Res. (1958) 6 791 812 Link, Google Scholar
- (1994) . European Research Program, Doc.Euret/387/94, economic and technical research of the transfer of goods: Design and evaluation of rapid transfer. Management summary, Brussels, June Google Scholar
- (1994) . European Research Program, Doc.Euret/405/94, traffic volume: Present and future. Final report, Brussels Google Scholar
- GAMS, the solver manuals (GAMS/CPLEX 3.0) (1994) (Gams Development Corporation) Google Scholar
- Transports combinés, infrastructures et terminaux. (1992) . Euromodal, Copenhagen, March 12–13 Google Scholar
- Les Transbordements Rapides: Système Commutor, Revue Généraie des Chemin de fer. (1990) April Google Scholar
- Computer solutions to the traveling salesman problem. Bell System Tech. J. (1965) 44 2245 2269 Crossref, Google Scholar
- An effective heuristic for the traveling salesman problem. Oper. Res. (1973) 21 498 516 Link, Google Scholar
- Marché Européen des Transports de Marchandises (1988) December (Bàle) Google Scholar

