Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs
From MaRDI portal
Publication:1993202
DOI10.1155/2017/8306732zbMath1426.90262OpenAlexW2625381362WikidataQ57717599 ScholiaQ57717599MaRDI QIDQ1993202
Igor Stojanović, Lev A. Kazakovtsev, Zoran Zdravev, Predrag S. Stanimirović, Ivona Brajević
Publication date: 5 November 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/8306732
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (3)
Extensions to the planar \(p\)-median problem ⋮ A new bio-heuristic hybrid optimization for constrained continuous problems ⋮ A novel hybrid AGWO-PSO algorithm in mitigation of power network oscillations with STATCOM
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- A review of chaos-based firefly algorithms: perspectives and research challenges
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
- The Weber problem in congested regions with entry and exit points
- Empirical analysis of a modified Artificial Bee Colony for constrained numerical optimization
- Imperialist competitive algorithm combined with chaos for global optimization
- On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- An efficient constraint handling method for genetic algorithms
- A novel artificial bee colony algorithm for function optimization
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
- A review of particle swarm optimization. I: Background and development
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- Optimization in Signal and Image Processing
- Firefly Algorithms for Multimodal Optimization
- An Algorithm for a Constrained Weber Problem
- Constrained Location and the Weber-Rawls Problem
- The central warehouse location problem revisited
- ALGORITHM FOR WEBER PROBLEM WITH A METRIC BASED ON THE INITIAL FARE
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
This page was built for publication: Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs