Kohonen maps for solving a class of location-allocation problems
From MaRDI portal
Publication:1296007
DOI10.1016/S0377-2217(97)00046-5zbMath0943.90007OpenAlexW2135662653MaRDI QIDQ1296007
F. Guerrero, Juan Larraneta, Luis Onieva, Sebastián Lozano
Publication date: 10 September 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00046-5
Learning and adaptive systems in artificial intelligence (68T05) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (5)
Self-organizing feature maps for solving location--allocation problems with rectilinear distances. ⋮ Combined location-routing problems -- a neural network approach ⋮ Solving probabilistic multi-facility Weber problem by vector quantization ⋮ Multi-facility green Weber problem ⋮ An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A study of the application of Kohonen-type neural networks to the travelling salesman problem
- Self-organization and associative memory
- Self-organization of neurons described by the maximum-entropy principle
- Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
- A comparative study of heuristics for a two-level routing-location problem
- Self-organized formation of topologically correct feature maps
- An optimal method for solving the (generalized) multi-Weber problem
- The Guilty net for the traveling salesman problem
- A comparison of SOM neural network and hierarchical clustering methods
- Easing the conscience of the guilty net
- Neural methods for the traveling salesman problem: Insights from operations research
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- Cluster Analysis: An Application of Lagrangian Relaxation
- Heuristic cluster algorithm for multiple facility location-allocation problem
- Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons
- Location-Allocation Problems
- An efficient algorithm for the location-allocation problem with rectangular regions
- Properties and Solution Methods for Large Location-Allocation Problems
- Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
- Heuristic Methods for Location-Allocation Problems
- On computer sampling from trivariate and multivariate discrete distributions
- A Self-Organizing Approach to Managerial Nonlinear Discriminant Analysis: A Hybrid Method of Linear Discriminant Analysis and Neural Networks
- An Analysis of Private and Public Sector Location Models
- Exact and approximate solutions to the multisource weber problem
This page was built for publication: Kohonen maps for solving a class of location-allocation problems
