Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs
type: Item
instance of: scholarly article
title: Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs
zbMATH Open document ID: 1426.90262
DOI: 10.1155/2017/8306732
author: Igor Stojanović
author: Ivona Brajević
author: Predrag S. Stanimirović
author: Lev A. Kazakovtsev
author: Zoran Zdravev
published in: Mathematical Problems in Engineering
publication date: 2018-11-05T00:00:00Z
review text: Summary: The continuous planar facility location problem with the connected region of feasible solutions bounded by arcs is a particular case of the constrained Weber problem. This problem is a continuous optimization problem which has a nonconvex feasible set of constraints. This paper suggests appropriate modifications of four metaheuristic algorithms which are defined with the aim of solving this type of nonconvex optimization problems. Also, a comparison of these algorithms to each other as well as to the heuristic algorithm is presented. The artificial bee colony algorithm, firefly algorithm, and their recently proposed improved versions for constrained optimization are appropriately modified and applied to the case study. The heuristic algorithm based on modified Weiszfeld procedure is also implemented for the purpose of comparison with the metaheuristic approaches. Obtained numerical results show that metaheuristic algorithms can be successfully applied to solve the instances of this problem of up to 500 constraints. Among these four algorithms, the improved version of artificial bee algorithm is the most efficient with respect to the quality of the solution, robustness, and the computational efficiency.
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6972564
Wikidata QID: Q57717599
describes a project that uses: ABC
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2017/8306732
OpenAlex ID: W2625381362
cites work: Q4229604
cites work: Q3147656
cites work: Q5403504
cites work: A modified Weiszfeld algorithm for the Fermat-Weber location problem
cites work: Q5480270
cites work: Heuristic solution of the multisource Weber problem as a \(p\)-median problem
cites work: Imperialist competitive algorithm combined with chaos for global optimization
cites work: The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
cites work: A review of particle swarm optimization. I: Background and development
cites work: A review of chaos-based firefly algorithms: perspectives and research challenges
cites work: Optimization in Signal and Image Processing
cites work: A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
cites work: A novel artificial bee colony algorithm for function optimization
cites work: Firefly Algorithms for Multimodal Optimization
cites work: Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
cites work: A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
cites work: Q5259423
cites work: Region-rejection based heuristics for the capacitated multi-source Weber problem
cites work: Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
cites work: An efficient solution method for Weber problems with barriers based on genetic algorithms
cites work: An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
cites work: The Weber problem in congested regions with entry and exit points
cites work: Q5278937
cites work: ALGORITHM FOR WEBER PROBLEM WITH A METRIC BASED ON THE INITIAL FARE
cites work: The central warehouse location problem revisited
cites work: An Algorithm for a Constrained Weber Problem
cites work: Constrained Location and the Weber-Rawls Problem
cites work: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
cites work: An efficient constraint handling method for genetic algorithms
cites work: On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation
cites work: Empirical analysis of a modified Artificial Bee Colony for constrained numerical optimization
description: scientific article; zbMATH DE number 6972564