Tactical design of rail freight networks. Part I: Exact and heuristic methods

European Journal of Operational Research

Volumn 90, Issue 1, 1996, Pages 26-44

  Marín, Angel ^a   Salmerón, Javier ^a  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

Branch and bound; Local search; Network design; Rail freight transportation; Simulated annealing; Tabu search

Indexed keywords

COSTS; FREIGHT CARS; FREIGHT TRANSPORTATION; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PIECEWISE LINEAR TECHNIQUES; PLANNING; SIMULATED ANNEALING; STATISTICAL METHODS;

BRANCH AND BOUND; LOCAL SEARCH; NETWORK DESIGN; RAIL FREIGHT NETWORKS; TABU SEARCH;

RAILROAD TRANSPORTATION;

EID: 0030570076     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00334-3     Document Type: Article

References (17)

1. Assad A., "Modeling of rail networks: Toward a routing/makeup model", Transportation Research 14B (1980) 101-114.
2. Crainic T., Ferland, J., and Rousseau, J., "A tactical planning for rail freight transportation," Tansportation Science 18 (1984) 165-183.
3. Crainic, T., and Rousseau, J., "Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem", Transportation Research 20B (1986) 225-242.
4. Crainic, T., "Rail tactical planning: issues, models and tools", in: L. Bianco and A. La Bella (eds.), Lecture Notes in Economics and Mathemathical Systems 317, Springer-Verlag, Berlin, 1988, 463-509.
5. Friesz, T., Cho, H., Mehta, M., Tobin, R., and Anandalingam, G., "A simulated annealing approach to the network design problem with variational inequality constraints", Transportation Science 26 (1992) 18-26.
6. Friesz, T., Anandalingam, G., Mehta, M., Nam, K., Shah, S., and Tobin, R., "The multiobjective equilibrium network design problem revisited: A simulated annealing approach", European Journal of Operational Research 65 (1993) 44-57.
7. Glover, F., "Tabu Search - Part I", ORSA Journal on Computing 1 (1989) 190-206.
8. Glover, F., "Tabu Search - Part II", ORSA Journal on Computing 2 (1990) 4-32.
9. Haghani, A., "Formulation and solution of a combined train routing and makeup, and empty car distribution model", Transportation Research 23B (1989) 433-451.
10. Keaton, M., "Designing optimal railroad operating plans: Lagrangean relaxation and heuristic approaches", Transportation Research 23B (1989) 415-431.
11. Keaton, M., "Designing railroad operations plans: a dual adjustment method for implementing Lagrangean relaxation", Transportation Science 24 (1992) 263-277.
12. Marín, A., and Salmerón, J. (1993), "A heuristic method for the tactical planning in the design problem for railroad freight transportation", Technical Paper, Dpto. de Matemática Aplicada y Est., E.T.S.I. Aeronáuticos, Universidad Politécnica de Madrid.
13. Marín, A., Menéndez, A.L., and Salmeró0n, J., "Planificación táctica del transporte de mercancïas por ferrocarril", Transportes y Communicaciones 61 (1993) 19-33.
14. Paulli, J., "A computational comparison of simulated annealing and tabu search applied to the quadratic assignment problem", in: R.V.V. Vidal (ed.), Applied Simulated Annealing, Springer-Verlag Berlin, 1993, 85-102.
15. Sherali H., and Myers, D., "The design of branch and bound algorithms for a class of nonlinear integer programs", Annals of Operations Research (1985) 463-484.
16. Sutter, A., Chardaire, P., and Lutton, J., "A simulated annealing algorithm for the minimum cost multicommodity flow problem", Second ORSA Telecommunications Conference, Boca Raton, FL, 1992.
17. Van Laarhoven, P., and Aarts, E., Simulated Annealing: Theory and Applications, Kluwer Academic Publishers, Dordrecht, 1988.