Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
From MaRDI portal
Publication:1652521
DOI10.1016/j.cor.2017.09.022zbMath1391.90377OpenAlexW2758903715MaRDI QIDQ1652521
Alireza Motallebzadeh, Younis Jabarzadeh, Bahar Yetis Kara, Nader Ghaffari-Nasab
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/49852
Transportation, logistics and supply chain management (90B06) Microeconomic theory (price theory and economic markets) (91B24) Discrete location and assignment (90B80)
Related Items (8)
Competitive multiple allocation hub location problem considering primary and backup routes ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand ⋮ Environmental impact analysis of hub-and-spoke network operation ⋮ Nature inspired meta-heuristic algorithms for solving the load-balancing problem in cloud environments ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms ⋮ Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
Cites Work
- Optimization by Simulated Annealing
- Hub location under competition
- A Stackelberg hub arc location model for a competitive environment
- A leader-follower model for discrete competitive facility location
- Sequential competitive location on networks
- Solving the uncapacitated hub location problem using genetic algorithms
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- A conditional \(p\)-hub location problem with attraction functions
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- A quadratic integer program for the location of interacting hub facilities
- Solution algorithms for the capacitated single allocation hub location problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Location of hubs in a competitive environment
- Practical bilevel optimization. Algorithms and applications
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Solution approaches to hub location problems
- Preprocessing and cutting for multiple allocation hub location problems.
- Foundations of bilevel programming
- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
- A leader-follower game in competitive facility location
- A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
- A competitive hub location and pricing problem
- A note on ``Location of hubs in a competitive environment
- Network hub location problems: The state of the art
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- A hub covering model for cargo delivery systems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- STACKELBERG HUB LOCATION PROBLEM
- Equation of State Calculations by Fast Computing Machines
- HUB NETWORK DESIGN MODEL IN A COMPETITIVE ENVIRONMENT WITH FLOW THRESHOLD
This page was built for publication: Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
