A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem

DOI10.1287/trsc.34.4.364.12319zbMath1014.90006OpenAlexW2098576756MaRDI QIDQ2783901

Tore Grünert, Klaus Büdenbender, Hans-Jürgen Sebastian

Publication date: 17 July 2003

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.34.4.364.12319

Mathematics Subject Classification ID

Search theory (90B40) Deterministic network models in operations research (90B10)

Related Items

Modeling reverse logistic tasks within closed-loop supply chains: an example from the automotive industry, Decomposition based hybrid metaheuristics, Optimizing package express operations in China, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS, Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem, Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Service network design for freight transportation: a review, Network design and flow problems with cross-arc costs, A metaheuristic for stochastic service network design, A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem, Hybridizing exact methods and metaheuristics: a taxonomy, Matheuristics for the capacitated p‐median problem, CORRELATIONS IN STOCHASTIC PROGRAMMING: A CASE FROM STOCHASTIC SERVICE NETWORK DESIGN