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

DOI10.1016/0377-2217(94)00334-3zbMath0916.90096OpenAlexW2098617448MaRDI QIDQ1266512

Javier Salmeron, ángel G. Marín

Publication date: 21 July 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00334-3

zbMATH Keywords

heuristicssimulated annealingtabu searchbranch-and-boundlocal searchnon-convex optimizationnetwork designdescendingrail freight networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06)

Related Items (7)

Integrating traffic routing optimization and train formation plan using simulated annealing algorithm ⋮ Matheuristics for optimizing the network in German wagonload traffic ⋮ Modeling formulation and a new heuristic for the railroad blocking problem ⋮ Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité ⋮ Tactical design of rail freight networks. II: Local search methods with statistical analysis ⋮ An operation optimization for express freight trains based on shipper demands ⋮ Scheduled Service Network Design for Freight Rail Transportation

Cites Work

• Unnamed Item
• Upper and lower bounds for the two-level simple plant location problem
• The multiobjective equilibrium network design problem revisited: A simulated annealing approach
• A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
• Tabu Search—Part I
• Tabu Search—Part II
• Designing Railroad Operating Plans: A Dual Adjustment Method for Implementing Lagrangian Relaxation

This page was built for publication: Tactical design of rail freight networks. I: Exact and heuristic methods