An \(M/M/c\) queue model for hub covering location problem
From MaRDI portal
Publication:409968
DOI10.1016/j.mcm.2011.06.038zbMath1235.90077OpenAlexW2022922020MaRDI QIDQ409968
Fariborz Jolai, Mehrdad Mohammadi, 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
locationqueuingevolutionary computationsfacilities planning and designimperialist competitive algorithmhub covering location
Related Items
Robust optimization approach to capacitated single and multiple allocation hub location problems, Risk-averse hub location: formulation and solution approach, An M/M/c queue model for vehicle routing problem in multi-door cross-docking environments, Skyport location problem for urban air mobility system, The two-echelon island fuel distribution problem, A learning-based metaheuristic for a multi-objective agile inspection planning model under uncertainty, Multi-period hub location problem considering polynomial time-dependent demand, 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, Design of a reliable multi-modal multi-commodity model for hazardous materials transportation under uncertainty, The capacitated directed cycle hub location and routing problem under congestion, Reliable design of a logistics network under uncertainty: A fuzzy possibilistic-queuing model, Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm, Multi-period hub set covering problems with flexible radius: a modified genetic solution, A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming, A queue-based aggregation approach for performance evaluation of a production system with an AMHS, Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system, Design of a reliable logistics network with hub disruption under uncertainty, Optimizing an inventory model with fuzzy demand, backordering, and discount using a hybrid imperialist competitive algorithm, Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm, A single allocation hub location and pricing problem, A soft computing-based approach to optimise queuing-inventory control problem, A competitive hub location and pricing problem
Cites Work
- Unnamed Item
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- Path relinking approach for multiple allocation hub maximal covering problem
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Preprocessing and cutting for multiple allocation hub location problems.
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Hub-and-spoke network design with congestion
- A branch and cut algorithm for hub location problems with single assignment
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Network hub location problems: The state of the art
- Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Projecting the flow variables for hub location problems
- Colonial competitive algorithm
- Hub Location and the p-Hub Median Problem
- The single-assignment hub covering problem: Models and linearizations
- Lower Bounds for the Hub Location Problem
