Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm
From MaRDI portal
Publication:2295062
DOI10.1016/j.apm.2017.09.032zbMath1480.90161OpenAlexW2759381347MaRDI QIDQ2295062
Reza Tavakkoli-Moghaddam, Mohammad Rezanezhad, Mahdi Bashiri, Hamid Hasanzadeh
Publication date: 12 February 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2017.09.032
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (4)
A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand ⋮ Skyport location problem for urban air mobility system ⋮ Multi-period hub location problem considering polynomial time-dependent demand ⋮ A combined average-case and worst-case analysis for an integrated hub location and revenue management problem
Cites Work
- Dynamic resource allocation problem for transportation network evacuation
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
- Heuristic algorithms for solving an integrated dynamic center facility location -- network design model
- A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: an NSGA-II with tuned parameters
- Local search heuristics for the mobile facility location problem
- A genetic algorithm for the uncapacitated single allocation planar hub location problem
- An \(M/M/c\) queue model for hub covering location problem
- The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network
- Developing equilibrium optimization methods for hub location problems
- A fuzzy programming approach for dynamic virtual hub location problem
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- Reaction function based dynamic location modeling in Stackelberg-Nash-Cournot competition
- An algorithm for solving the multi-period online fulfillment assignment problem
- Single facility location and relocation problem with time dependent weights and discrete planning horizon
- A comparative study of approaches to dynamic location problems
- Solution algorithms for the capacitated single allocation hub location problem
- On tabu search for the location of interacting hub facilities
- The dynamic relocation and phase-out of a hybrid two-echelon plant/warehousing facility: A multiple objective approach
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
- Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
- Modeling the budget-constrained dynamic uncapacitated facility location-network design problem and solving it via two efficient heuristics: a case study of health care
- Multi-period hub set covering problems with flexible radius: a modified genetic solution
- Design of a reliable logistics network with hub disruption under uncertainty
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- Dynamic-demand capacitated facility location problems with and without relocation
- Optimization models for the dynamic facility location and allocation problem
This page was built for publication: Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm
