An M/M/c queue model for hub covering location problem

DOI10.1016/J.MCM.2011.06.038zbMATH Open1235.90077OpenAlexW2022922020MaRDI QIDQ409968FDOQ409968

Authors Mehrdad Mohammadi, Fariborz Jolai, Hamideh Rostami 

Publication date 15 April 2012

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mcm.2011.06.038

zbMATH Keywords

locationfacilities planning and designevolutionary computationsqueuingimperialist competitive algorithmhub covering location

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Discrete location and assignment (90B80)

Recommendations

• Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems
• An efficient model for the multiple allocation hub maximal covering problem
• Modeling congestion and service time in hub location problems
• Location models for airline hubs behaving as \(M/D/c\) queues.
• An M/M/c queue model for vehicle routing problem in multi-door cross-docking environments
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
• The \(q\)-ad hoc hub location problem for multi-modal networks
• Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
• A location model for a facility operating as anM/G/k queue

Cites Work

• scientific article; zbMATH DE number 3488392 (Why is no real title available?)
• A branch and cut algorithm for hub location problems with single assignment
• A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
• A quadratic integer program for the location of interacting hub facilities
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• Branch and price for large-scale capacitated hub location problems with single assignment
• Colonial competitive algorithm
• Formulating and solving splittable capacitated multiple allocation hub location problems
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• Hub Location and the p-Hub Median Problem
• Hub-and-spoke network design with congestion
• Integer programming formulations of discrete hub location problems
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
• Location models for airline hubs behaving as \(M/D/c\) queues.
• Lower Bounds for the Hub Location Problem
• Network hub location problems: The state of the art
• On tabu search for the location of interacting hub facilities
• Path relinking approach for multiple allocation hub maximal covering problem
• Preprocessing and cutting for multiple allocation hub location problems.
• Projecting the flow variables for hub location problems
• Solution algorithms for the capacitated single allocation hub location problem
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• The single-assignment hub covering problem: Models and linearizations
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems

Cited In (26)

• Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
• Design of a reliable multi-modal multi-commodity model for hazardous materials transportation under uncertainty
• Hub location with congestion and time-sensitive demand
• Multi-period hub location problem considering polynomial time-dependent demand
• A soft computing-based approach to optimise queuing-inventory control problem
• Robust optimization approach to capacitated single and multiple allocation hub location problems
• Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm
• Reliable design of a logistics network under uncertainty: A fuzzy possibilistic-queuing model
• A queue-based aggregation approach for performance evaluation of a production system with an AMHS
• Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm
• The capacitated directed cycle hub location and routing problem under congestion
• Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
• Modeling congestion and service time in hub location problems
• A competitive hub location and pricing problem
• Location models for airline hubs behaving as \(M/D/c\) queues.
• A single allocation hub location and pricing problem
• Skyport location problem for urban air mobility system
• An M/M/c queue model for vehicle routing problem in multi-door cross-docking environments
• A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming
• The two-echelon island fuel distribution problem
• Optimizing an inventory model with fuzzy demand, backordering, and discount using a hybrid imperialist competitive algorithm
• Multi-period hub set covering problems with flexible radius: a modified genetic solution
• Design of a reliable logistics network with hub disruption under uncertainty
• Multiple allocation hub location with service level constraints for two shipment classes
• A learning-based metaheuristic for a multi-objective agile inspection planning model under uncertainty
• Risk-averse hub location: formulation and solution approach

This page was built for publication: An \(M/M/c\) queue model for hub covering location problem

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