Results 111 to 120 of about 57,703 (300)
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
A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem
Discrete Dynamics in Nature and Society, 2015 The Just-In-Time (JIT) scheduling problem is an important subject of study. It essentially constitutes the problem of scheduling critical business resources in an attempt to optimize given business objectives.
Sivashan Chetty, Aderemi O. Adewumi
doaj +1 more source
A Stable and Robust Calibration Scheme of the Log-Periodic Power Law Model
, 2013 We present a simple transformation of the formulation of the log-periodic power law formula of the Johansen-Ledoit-Sornette model of financial bubbles that reduces it to a function of only three nonlinear parameters.
Chang +40 more
core +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
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
Pengembangan Algoritma Hybrid Metaheuristik Untuk Penentuan Rute Pengiriman Produk Perishable
Jurnal Teknik Industri, 2017 The decision to dispatch consumers demand has become a strategic and tactical consideration to be solved in an integrated manner. In this study, the problem of determining routing problem take case study of delivery of perishable product.
Luki Trihardani, Oki Anita Candra Dewi
doaj +1 more source
A novel approach for optimization of handover mechanism using metaheuristics algorithms
, 2022 Mithun B. Patil, Laxmi Math
openalex +1 more source
A fast metaheuristic approach for the planar multiple obnoxious facility location problem
International Transactions in Operational Research, EarlyView.Abstract The multiple obnoxious facility location problem is one of the most studied problems in the literature of the obnoxious facility location problems family. In this work, we propose an alternative algorithmic approach for this problem, based on an efficient metaheuristic procedure over a discretization of the plane based on Voronoi diagrams ...
Sergio Salazar +2 more
wiley +1 more source