An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
From MaRDI portal
Publication:262934
DOI10.1007/s11067-011-9162-yzbMath1332.90145OpenAlexW2020648520MaRDI QIDQ262934
Mohammad Saeed Jabalameli, Farnaz Barzinpour, Ragheb Rahmaniani, Abdolsalam Ghaderi
Publication date: 31 March 2016
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-011-9162-y
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (7)
A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization ⋮ Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows ⋮ A continuous location and maintenance routing problem for offshore wind farms: mathematical models and hybrid methods ⋮ Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs ⋮ Market coordination under non-equilibrium dynamics ⋮ A combined facility location and network design problem with multi-type of capacitated links ⋮ Mitigating partial-disruption risk: a joint facility location and inventory model considering customers' preferences and the role of substitute products and backorder offers
Uses Software
Cites Work
- Unnamed Item
- New genetic algorithms based approaches to continuous \(p\)-median problem
- Facility location models for distribution system design
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- Solving the semi-desirable facility location problem using bi-objective particle swarm
- Attraction probabilities in variable neighborhood search
- Allocation search methods for a generalized class of location-allocation problems
- Facility location and supply chain management. A review
- An optimal method for solving the (generalized) multi-Weber problem
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- Kohonen maps for solving a class of location-allocation problems
- A projection method for \(l_ p\) norm location-allocation problems
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- A bibliography for some fundamental problem categories in discrete location science
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- A fast swap-based local search procedure for location problems
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
- Location-Allocation Problems
- Properties and Solution Methods for Large Location-Allocation Problems
- TSPLIB—A Traveling Salesman Problem Library
- A computation procedure for the exact solution of location-allocation problems with rectangular distances
- Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
- Tabu search for large location–allocation problems
- Heuristic Methods for Location-Allocation Problems
- Decomposition strategies for large-scale continuous location–allocation problems
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Exact and approximate solutions to the multisource weber problem
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Simulated \(N\)-body: New particle physics-based heuristics for a Euclidean location-allocation problem
This page was built for publication: An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
