An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem (Q262934): Difference between revisions

Revision as of 17:23, 11 July 2024

scientific article

Language	Label	Description	Also known as
English	An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem	scientific article

Statements

instance of

scholarly article

0 references

title

An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem (English)

0 references

author

Abdolsalam Ghaderi

0 references

Mohammad Saeed Jabalameli

0 references

Farnaz Barzinpour

0 references

Ragheb Rahmaniani

0 references

published in

Networks and Spatial Economics

0 references

publication date

31 March 2016

0 references

zbMATH Keywords

location

0 references

allocation

0 references

networks

0 references

local search

0 references

particle swarm optimization

0 references

hybrid algorithm

0 references

describes a project that uses

TSPLIB

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1007/s11067-011-9162-y

0 references

cites work

Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps

0 references

Allocation search methods for a generalized class of location-allocation problems

0 references

An efficient solution method for Weber problems with barriers based on genetic algorithms

0 references

A projection method for \(l_ p\) norm location-allocation problems

0 references

Q4826162

0 references

Attraction probabilities in variable neighborhood search

0 references

Decomposition strategies for large-scale continuous location–allocation problems

0 references

Location-Allocation Problems

0 references

Heuristic Methods for Location-Allocation Problems

0 references

Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

0 references

Heuristic solution of the multisource Weber problem as a \(p\)-median problem

0 references

Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems

0 references

Self-organizing feature maps for solving location--allocation problems with rectilinear distances.

0 references

A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach

0 references

Facility location models for distribution system design

0 references

Exact and approximate solutions to the multisource weber problem

0 references

Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing

0 references

Properties and Solution Methods for Large Location-Allocation Problems

0 references

A computation procedure for the exact solution of location-allocation problems with rectangular distances

0 references

Kohonen maps for solving a class of location-allocation problems

0 references

Facility location and supply chain management. A review

0 references

New genetic algorithms based approaches to continuous \(p\)-median problem

0 references

Tabu search for large location–allocation problems

0 references

TSPLIB—A Traveling Salesman Problem Library

0 references

A fast swap-based local search procedure for location problems

0 references

A bibliography for some fundamental problem categories in discrete location science

0 references

An optimal method for solving the (generalized) multi-Weber problem

0 references

A genetic algorithm based approach for the uncapacitated continuous location-allocation problem

0 references

Simulated \(N\)-body: New particle physics-based heuristics for a Euclidean location-allocation problem

0 references

Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

0 references

A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems

0 references

Solving the semi-desirable facility location problem using bi-objective particle swarm

0 references

Identifiers

zbMATH Open document ID

1332.90145

0 references

DOI

10.1007/s11067-011-9162-y

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:262934

@@ Property / Mathematics Subject Classification ID @@
+B85
@@ Property / Mathematics Subject Classification ID: 90B85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B10
@@ Property / Mathematics Subject Classification ID: 90B10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6561410
@@ Property / zbMATH DE Number: 6561410 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+location
@@ Property / zbMATH Keywords: location / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+allocation
@@ Property / zbMATH Keywords: allocation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+networks
@@ Property / zbMATH Keywords: networks / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+local search
@@ Property / zbMATH Keywords: local search / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+particle swarm optimization
@@ Property / zbMATH Keywords: particle swarm optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+hybrid algorithm
@@ Property / zbMATH Keywords: hybrid algorithm / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+TSPLIB
@@ Property / describes a project that uses: TSPLIB / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11067-011-9162-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2020648520
@@ Property / OpenAlex ID: W2020648520 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
+Normal rank
@@ Property / cites work @@
+Allocation search methods for a generalized class of location-allocation problems
+Normal rank
@@ Property / cites work @@
+An efficient solution method for Weber problems with barriers based on genetic algorithms
+Normal rank
@@ Property / cites work @@
+A projection method for \(l_ p\) norm location-allocation problems
+Normal rank
@@ Property / cites work @@
+Q4826162
@@ Property / cites work: Q4826162 / rank @@
+Normal rank
@@ Property / cites work @@
+Attraction probabilities in variable neighborhood search
+Normal rank
@@ Property / cites work @@
+Decomposition strategies for large-scale continuous location–allocation problems
+Normal rank
@@ Property / cites work @@
+Location-Allocation Problems
@@ Property / cites work: Location-Allocation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic Methods for Location-Allocation Problems
+Normal rank
@@ Property / cites work @@
+Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
+Normal rank
@@ Property / cites work @@
+Heuristic solution of the multisource Weber problem as a \(p\)-median problem
+Normal rank
@@ Property / cites work @@
+Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
+Normal rank
@@ Property / cites work @@
+Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
+Normal rank
@@ Property / cites work @@
+A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
+Normal rank
@@ Property / cites work @@
+Facility location models for distribution system design
+Normal rank
@@ Property / cites work @@
+Exact and approximate solutions to the multisource weber problem
+Normal rank
@@ Property / cites work @@
+Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
+Normal rank
@@ Property / cites work @@
+Properties and Solution Methods for Large Location-Allocation Problems
+Normal rank
@@ Property / cites work @@
+A computation procedure for the exact solution of location-allocation problems with rectangular distances
+Normal rank
@@ Property / cites work @@
+Kohonen maps for solving a class of location-allocation problems
+Normal rank
@@ Property / cites work @@
+Facility location and supply chain management. A review
+Normal rank
@@ Property / cites work @@
+New genetic algorithms based approaches to continuous \(p\)-median problem
+Normal rank
@@ Property / cites work @@
+Tabu search for large location–allocation problems
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank
@@ Property / cites work @@
+A fast swap-based local search procedure for location problems
+Normal rank
@@ Property / cites work @@
+A bibliography for some fundamental problem categories in discrete location science
+Normal rank
@@ Property / cites work @@
+An optimal method for solving the (generalized) multi-Weber problem
+Normal rank
@@ Property / cites work @@
+A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
+Normal rank
@@ Property / cites work @@
+Simulated \(N\)-body: New particle physics-based heuristics for a Euclidean location-allocation problem
+Normal rank
@@ Property / cites work @@
+Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
+Normal rank
@@ Property / cites work @@
+A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
+Normal rank
@@ Property / cites work @@
+Solving the semi-desirable facility location problem using bi-objective particle swarm
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:262934