A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming

DOI10.1007/s00500-016-2398-1zbMath1398.90092OpenAlexW2536320623MaRDI QIDQ1797769

Amirhossein Amiri, Hamid Hasanzadeh, Mahdi Bashiri

Publication date: 22 October 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-016-2398-1

zbMATH Keywords

genetic algorithmgenetic programmingparticle swarm optimizationhub location problemqueuing theory

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Discrete location and assignment (90B80)

Related Items (5)

Performance and cost comparative analysis for M/G/1 repairable machining system with N-policy vacation ⋮ Multi-period hub location problem considering polynomial time-dependent demand ⋮ Multiple allocation hub location with service level constraints for two shipment classes ⋮ Alternate second order conic program reformulations for hub location under stochastic demand and congestion ⋮ Cost optimization and ANFIS computing for admission control of \(M/M/1/K\) queue with general retrial times and discouragement

Cites Work

• Unnamed Item
• A Stackelberg hub arc location model for a competitive environment
• An \(M/M/c\) queue model for hub covering location problem
• The minmax regret gradual covering location problem on a network with incomplete information of demand weights
• Single-allocation ordered median hub location problems
• Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
• Multiple allocation hub-and-spoke network design under hub congestion
• A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
• A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
• Integer programming formulations of discrete hub location problems
• Location models for airline hubs behaving as \(M/D/c\) queues.
• Hub-and-spoke network design with congestion
• Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
• An improved Benders decomposition algorithm for the tree of hubs location problem
• Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
• Model formulations for hub covering problems
• The single-assignment hub covering problem: Models and linearizations

This page was built for publication: A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming