Capacitated single allocation hub location problem-A bi-criteria approach

DOI10.1016/J.COR.2007.04.005MaRDI QIDQ2483516zbMATH OpenOpenAlexFDO

Authors Maria da Graça Costa, Maria Eugénia Captivo, Joao Carlos Namorado Climaco

Publication date 28 April 2008

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

Full work available at URL https://doi.org/10.1016/j.cor.2007.04.005

zbMATH Keywords

bi-criteria problemshub locationinteractive methods

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10) Multi-objective and goal programming (90C29)

Recommendations

• A Heuristic for the Capacitated Single Allocation Hub Location Problem
• Bicriteria p-hub location problems and evolutionary algorithms
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Formulating and solving splittable capacitated multiple allocation hub location problems
• A decomposition approach for single allocation hub location problems with multiple capacity levels

Cites work

• A multicriteria approach to the location of public facilities
• A quadratic integer program for the location of interacting hub facilities
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Enumeration and search procedures for a hub location problem with economies of scale
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Heuristics for the p-hub location problem
• scientific article; zbMATH DE number 1803765 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 1091320 (Why is no real title available?)
• scientific article; zbMATH DE number 1738108 (Why is no real title available?)
• Hub arc location problems: I. Introduction and results
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• Hub Location and the p-Hub Median Problem
• Integer programming formulations of discrete hub location problems
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
• Location and allocation for distribution systems with transshipments and transportion economies of scale
• Multicriteria hub decision making for rural area telecommunication networks
• On tabu search for the location of interacting hub facilities
• On the Location of Hub Facilities
• Solution algorithms for the capacitated single allocation hub location problem
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• The latest arrival hub location problem
• Tight linear programming relaxations of uncapacitated p-hub median problems

Cited in

(26)

• Lagrangean relaxation for the capacitated hub location problem with single assignment
• Solution algorithms for the capacitated single allocation hub location problem
• Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment
• Variations in the flow approach to CFCLP-TC for multiobjective supply chain design
• A multiobjective hub-airport location problem for an airline network design
• Fathoming rules for biobjective mixed integer linear programs: review and extensions
• Design of intermodal logistics networks with hub delays
• Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems
• Alternate second order conic program reformulations for hub location under stochastic demand and congestion
• Integrated hub location and flow processing schedule problem under renewable capacity constraint
• Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
• A bi-objective incomplete hub location-routing problem with flow shipment scheduling
• Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment
• A decomposition approach for single allocation hub location problems with multiple capacity levels
• Robust optimization approach to capacitated single and multiple allocation hub location problems
• Multi-product capacitated single-allocation hub location problems: formulations and inequalities
• Allocating nodes to hubs for minimizing the hubs processing resources: A case study
• Multiple allocation hub location with service level constraints for two shipment classes
• Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm
• A fuzzy programming approach for dynamic virtual hub location problem
• General variable neighborhood search for the capacitated single allocation hub maximal covering problem
• Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
• New complexity results for the \(p\)-hub median problem
• Multiple allocation hub-and-spoke network design under hub congestion
• Multiple criteria facility location problems: a survey
• The capacitated single-allocation hub location problem revisited: a note on a classical formulation

This page was built for publication: Capacitated single allocation hub location problem-A bi-criteria approach

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