Results 111 to 120 of about 52,555 (294)
Cluster validity indices for automatic clustering: A comprehensive review
HeliyonThe Cluster Validity Index is an integral part of clustering algorithms. It evaluates inter-cluster separation and intra-cluster cohesion of candidate clusters to determine the quality of potential solutions.
Abiodun M. Ikotun +2 more
doaj +1 more source
Metaheuristic algorithms for the quadratic assignment problem
2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS), 2013 This paper presents two meta-heuristic algorithms to solve the quadratic assignment problem. The iterated greedy algorithm has two main components, which are destruction and construction procedures. The algorithm starts from an initial solution and then iterates through a main loop, where first a partial candidate solution is obtained by removing a ...
Mehmet Fatih Tasgetiren +3 more
openaire +3 more sources
Conservation Science and Practice, EarlyView.We compare simulated annealing (SA, Marxan) and integer linear programming (ILP, prioritizr) to evaluate their performance in developing spatial conservation priorities for the proposed Weddell Sea Marine Protected Area Phase 1. While both approaches identify largely overlapping priority areas, ILP consistently produces more compact and cost‐efficient ...
Katharina Teschke +2 more
wiley +1 more source
Investigation on New Metaheuristic Algorithms for Solving Dynamic Combined Economic Environmental Dispatch Problems [PDF]
, 2022 Benyekhlef Larouci +7 more
openalex +1 more source
International Transactions in Operational Research, EarlyView.Abstract In response to the increasing complexity of modern products, dynamic markets, and intensified competition, project‐based organizations are actively seeking methodologies to efficiently manage their expanding project portfolios. This paper analyzes the project portfolio selection problem in uncertain environments. Despite recent advances in the
Miguel Saiz +3 more
wiley +1 more source
BiomimeticsNowadays, metaheuristic algorithms have been applied to optimize last lower-surface models. Also, the last lower-surface model has been adjusted through the computational algorithms to perform custom shoe lasts.
J. Apolinar Muñoz Rodríguez
doaj +1 more source
Heuristics based on greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem [PDF]
, 2007 This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible.
Consoli, S +3 more
core
International Transactions in Operational Research, EarlyView.Abstract One of the most common problems in the expansion of a company consists of deciding the most appropriate locations for their facilities. This decision problem, known as the facility location problem, has been studied from different perspectives, considering a number of different constraints.
Enrique García‐Galán +2 more
wiley +1 more source
A novel approach for optimization of handover mechanism using metaheuristics algorithms
, 2022 Mithun B. Patil, Laxmi Math
openalex +1 more source
Solving the minimum labelling spanning tree problem using hybrid local search [PDF]
, 2007 Given a connected, undirected graph whose edges are labelled (or coloured), the minimum labelling spanning tree (MLST) problem seeks a spanning tree whose edges have the smallest number of distinct labels (or colours).
Consoli, S +3 more
core