Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm

DOI10.1016/j.apm.2013.05.063zbMath1427.90193MaRDI QIDQ1792363

Fariborz Jolai, Reza Tavakkoli-Moghaddam, Mehrdad Mohammadi

Publication date: 11 October 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2013.05.063

zbMATH Keywords

stochastic programming; multi-objective optimization; hub location problem; imperialist competitive algorithm; risk factor

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90B80: Discrete location and assignment

Related Items

Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment, Design of a reliable multi-modal multi-commodity model for hazardous materials transportation under uncertainty, A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming, Operating room scheduling by considering the decision-making styles of surgical team members: a comprehensive approach, Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment

Cites Work

• Unnamed Item
• An \(M/M/c\) queue model for hub covering location problem
• Stochastic uncapacitated hub location
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• Stochastic air freight hub location and flight routes planning
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• The stochastic \(p\)-hub center problem with service-level constraints
• 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
• Solution algorithms for the capacitated single allocation hub location problem
• On tabu search for the location of interacting hub facilities
• Location models for airline hubs behaving as \(M/D/c\) queues.
• Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
• Network hub location problems: The state of the art
• Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement
• Colonial competitive algorithm