Efficient metaheuristics to solve the intermodal terminal location problem
From MaRDI portal
Publication:1761128
DOI10.1016/j.cor.2011.10.005zbMath1251.90396OpenAlexW2007839652MaRDI QIDQ1761128
Christine Vanovermeire, Kenneth Sörensen, Sylvie Busschaert
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/10067/1016050151162165141
Related Items (6)
Multimodal freight transportation planning: a literature review ⋮ Efficient model and heuristic for the intermodal terminal location problem ⋮ Two-stage approach to the intermodal terminal location problem ⋮ Integrated multi-level intermodal network design problem: a sustainable approach, based on competition of rail and road transportation systems ⋮ Reliable intermodal freight network expansion with demand uncertainties and network disruptions ⋮ Optimization in multimodal freight transportation problems: a survey
Cites Work
- Unnamed Item
- Hub location-allocation in intermodal logistic networks
- The attribute based hill climber
- Applying the attribute based hill climber heuristic to the vehicle routing problem
- 0-1 reformulations of the multicommodity capacitated network design problem
- Integer programming formulations of discrete hub location problems
- Opportunities for OR in intermodal freight transport research: A review.
- Preprocessing and cutting for multiple allocation hub location problems.
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Network hub location problems: The state of the art
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- On the use of genetic algorithms to solve location problems
This page was built for publication: Efficient metaheuristics to solve the intermodal terminal location problem
