A tabu-search based heuristic for the hub covering problem over incomplete hub networks

DOI10.1016/j.cor.2008.11.023zbMath1177.90201OpenAlexW2103363891MaRDI QIDQ833521

Sibel A. Alumur, Hatice Calik, Bahar Yetis Kara, Oya Ekin Karaşan

Publication date: 14 August 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/22531

zbMATH Keywords

network designhub locationhub covering problem

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (40)

Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Multi-product capacitated single-allocation hub location problems: formulations and inequalities ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ A branch-and-cut algorithm for the hub location and routing problem ⋮ Heuristics for the capacitated modular hub location problem ⋮ Benders decomposition applied to a robust multiple allocation incomplete hub location problem ⋮ Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems ⋮ \(p\)-hub median problem for non-complete networks ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem ⋮ Exact and heuristic approaches for the cycle hub location problem ⋮ An efficient model for the multiple allocation hub maximal covering problem ⋮ A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands ⋮ An \(M/M/c\) queue model for hub covering location problem ⋮ Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation ⋮ Machine learning augmented approaches for hub location problems ⋮ Allocation strategies in hub networks ⋮ Parcel Distribution Timetabling Problem with Incomplete Hub Network ⋮ Relay network design with direct shipment and multi-relay assignment ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ Proprietor and customer costs in the incomplete hub location-routing network topology ⋮ A mixed integer linear program and tabu search approach for the complementary edge covering problem ⋮ LTL logistics networks with differentiated services ⋮ The capacitated directed cycle hub location and routing problem under congestion ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution ⋮ Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm ⋮ A biobjective and trilevel programming model for hub location problem in design of a resilient power projection network ⋮ Multi-period hub set covering problems with flexible radius: a modified genetic solution ⋮ Design of a reliable logistics network with hub disruption under uncertainty ⋮ Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm ⋮ A bi-objective incomplete hub location-routing problem with flow shipment scheduling ⋮ A single allocation hub location and pricing problem ⋮ A leader-follower single allocation hub location problem under fixed markups ⋮ A competitive hub location and pricing problem ⋮ Metaheuristic applications on discrete facility location problems: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
• Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
• Uncapacitated single and multiple allocation \(p\)-hub center problems
• A quadratic integer program for the location of interacting hub facilities
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Integer programming formulations of discrete hub location problems
• On tabu search for the location of interacting hub facilities
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Network hub location problems: The state of the art
• An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems
• Hub Arc Location Problems: Part I—Introduction and Results
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• A hub covering network design problem for cargo applications in Turkey
• A hub covering model for cargo delivery systems
• Hub network design with single and multiple allocation: A computational study
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Hub Location and the p-Hub Median Problem
• The single-assignment hub covering problem: Models and linearizations

This page was built for publication: A tabu-search based heuristic for the hub covering problem over incomplete hub networks