Matheuristics for optimizing the network in German wagonload traffic
From MaRDI portal
Publication:1707082
DOI10.1007/s13675-016-0076-9zbMath1384.90061OpenAlexW2562680129MaRDI QIDQ1707082
Uwe Clausen, Julia Sender, Petra Mutzel, Thomas Siwczyk
Publication date: 28 March 2018
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-016-0076-9
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90) Traffic problems in operations research (90B20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Hub location-allocation in intermodal logistic networks
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Heuristics for the p-hub location problem
- New formulations for the uncapacitated multiple allocation hub location problem
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- Tactical design of rail freight networks. I: Exact and heuristic methods
- Solution algorithms for the capacitated single allocation hub location problem
- Location of hubs in a competitive environment
- On tabu search for the location of interacting hub facilities
- Solution approaches to hub location problems
- Matheuristics for optimizing the network in German wagonload traffic
- Enumeration and search procedures for a hub location problem with economies of scale
- Solving a capacitated hub location problem
- Network hub location problems: The state of the art
- Hub Location Problems with Choice of Different Hub Capacities and Vehicle Types
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Solving the Hub location problem in telecommunication network design: A local search approach
- Matheuristics
- On the Complexity of Timetable and Multicommodity Flow Problems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Airline network design and hub location problems
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- A Benders Decomposition for Hub Location Problems Arising in Public Transport
- Handbook of metaheuristics
- HubLocator: An exact solution method for the multiple allocation hub location problem
