A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands

DOI10.1016/J.EJOR.2023.07.015OpenAlexW4384469745MaRDI QIDQ6087494

Abdullah Zareh Andaryan, Nader Ghaffari-Nasab, Kasra Mousighichi

Publication date: 15 November 2023

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2023.07.015

zbMATH Keywords

tabu searchBernoulli demandslocationmathematical formulationstochastic hub location

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Stochastic uncapacitated hub location
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• A hybrid modified PSO approach to VaR-based facility location problems with variable capacity in fuzzy random uncertainty
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• The stochastic \(p\)-hub center problem with service-level constraints
• Heuristic and lower bound for a stochastic location-routing problem
• The transfer point location problem
• A quadratic integer program for the location of interacting hub facilities
• Solution algorithms for the capacitated single allocation hub location problem
• Integer programming formulations of discrete hub location problems
• Three models of fuzzy integer linear programming
• A capacitated hub location problem under hose demand uncertainty
• An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
• Design of intermodal logistics networks with hub delays
• Stochastic single-allocation hub location
• Perspectives on modeling hub location problems
• Stochastic hub location problems with Bernoulli demands
• Network hub location problems: The state of the art
• Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem
• Solving the Hub location problem in telecommunication network design: A local search approach
• Tabu Search—Part I
• Tabu Search—Part II
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands

This page was built for publication: A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands