Heuristics for the p-hub location problem

DOI10.1016/0377-2217(91)90090-IzbMATH Open0726.90042OpenAlexW1971918127MaRDI QIDQ803033FDOQ803033

Authors: John G. Klincewicz 

Publication date: 1991

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(91)90090-i

Recommendations

• Hub Location and the p-Hub Median Problem
• On tabu search for the location of interacting hub facilities
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Network hub location problems: The state of the art

zbMATH Keywords

facility locationnetwork designexchange heuristicsp-hub problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Cites Work

• A quadratic integer program for the location of interacting hub facilities
• Title not available (Why is that?)
• Facility location models for distribution planning
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Large-Scale Network Topological Optimization

Cited In (52)

• Title not available (Why is that?)
• Star \(p\)-hub median problem with modular arc capacities
• Allocation strategies in hub networks
• Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations
• Hub location-allocation in intermodal logistic networks
• A polynomial algorithm for balanced clustering via graph partitioning
• Solving the uncapacitated hub location problem using genetic algorithms
• HubLocator: An exact solution method for the multiple allocation hub location problem
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• New simple and efficient heuristics for the uncapacitated single allocation hub location problem
• A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
• Benders decomposition for the uncapacitated multiple allocation hub location problem
• The single allocation problem in the interacting three-hub network
• The tree of hubs location problem
• Dual-based approach for a hub network design problem under non-restrictive policy
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
• Integer programming formulations of discrete hub location problems
• A hybrid heuristic for the uncapacitated hub location problem
• A linear program for the two-hub location problem
• Hub-and-spoke network design with congestion
• An improved algorithm for fixed-hub single allocation problems
• Hub location problems: the location of interacting facilities
• Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
• The planar hub location problem: a probabilistic clustering approach
• Reliable single allocation hub location problem under hub breakdowns
• A hybrid genetic/optimization algorithm for a task allocation problem
• On tabu search for the location of interacting hub facilities
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Solving large single allocation \(p\)-hub problems with two or three hubs
• Network hub location problems: The state of the art
• Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
• A genetic algorithm for the uncapacitated single allocation planar hub location problem
• A clustering approach to the planar hub location problem
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• Heuristics for budget facility location-network design problems with minisum objective
• Heuristics for multiple facility location in a network using the variance criterion
• Location of hubs in a competitive environment
• On ``A quadratic integer program for the location of interacting hub facilities
• Graph clustering
• Capacitated single allocation hub location problem-A bi-criteria approach
• Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
• The hub location and routing problem
• Network cost minimization using threshold-based discounting
• Optimal use of hub facilities: A two-hub model with fixed arc costs
• Hub Location and the p-Hub Median Problem
• An efficient algorithm for solving the median problem on real road networks
• Matheuristics for optimizing the network in German wagonload traffic
• An efficient heuristic for a hub location routing problem
• A fuzzy programming approach for dynamic virtual hub location problem

This page was built for publication: Heuristics for the p-hub location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803033)