A tabu-search based heuristic for the hub covering problem over incomplete hub networks
From MaRDI portal
Publication:833521
DOI10.1016/J.COR.2008.11.023zbMATH Open1177.90201OpenAlexW2103363891MaRDI QIDQ833521FDOQ833521
Authors: Sibel A. Alumur, Hatice Calik, Bahar Y. Kara, Oya Ekin Karasan 
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
Recommendations
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
- HUBBI: iterative network design for incomplete hub location problems
- Network based heuristics for the set covering problem
- A hybrid heuristic for the uncapacitated hub location problem
- A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
- An efficient model for the multiple allocation hub maximal covering problem
- Heuristics for the p-hub location problem
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
- An efficient heuristic for a hub location routing problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Search theory (90B40)
Cites Work
- 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
- Network hub location problems: The state of the art
- Title not available (Why is that?)
- A hub covering model for cargo delivery systems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- 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
- On tabu search for the location of interacting hub facilities
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Hub location problems in urban traffic networks
- An efficient procedure for designing single allocation hub and spoke systems
- Hub arc location problems: I. Introduction and results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Hub network design with single and multiple allocation: A computational study
- A hub covering network design problem for cargo applications in Turkey
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- The single-assignment hub covering problem: Models and linearizations
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
Cited In (45)
- Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
- A hub covering network design problem for cargo applications in Turkey
- Multiple allocation tree of hubs location problem for non-complete networks
- Model formulations for hub covering problems
- Metaheuristic applications on discrete facility location problems: a survey
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities
- Hub location with congestion and time-sensitive demand
- Allocation strategies in hub networks
- Relay network design with direct shipment and multi-relay assignment
- An efficient model for the multiple allocation hub maximal covering problem
- \(p\)-hub median problem for non-complete networks
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- An \(M/M/c\) queue model for hub covering location problem
- Approximation algorithm for cycle-star hub network design problems and cycle-metric labeling problems
- The single-assignment hub covering problem: Models and linearizations
- Scalable vertiport hub location selection for air taxi operations in a metropolitan region
- Parcel Distribution Timetabling Problem with Incomplete Hub Network
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
- Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- Heuristics for the capacitated modular hub location problem
- An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
- The capacitated directed cycle hub location and routing problem under congestion
- Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
- A branch-and-cut algorithm for the hub location and routing problem
- A leader-follower single allocation hub location problem under fixed markups
- On tabu search for the location of interacting hub facilities
- LTL logistics networks with differentiated services
- A competitive hub location and pricing problem
- A single allocation hub location and pricing problem
- A biobjective and trilevel programming model for hub location problem in design of a resilient power projection network
- Proprietor and customer costs in the incomplete hub location-routing network topology
- A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands
- A bi-objective incomplete hub location-routing problem with flow shipment scheduling
- Exact and heuristic approaches for the cycle hub location problem
- Multi-period hub set covering problems with flexible radius: a modified genetic solution
- A mixed integer linear program and tabu search approach for the complementary edge covering problem
- Design of a reliable logistics network with hub disruption under uncertainty
- Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation
- Machine learning augmented approaches for hub location problems
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
- HUBBI: iterative network design for incomplete hub location problems
- 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
This page was built for publication: A tabu-search based heuristic for the hub covering problem over incomplete hub networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833521)
