Results 101 to 110 of about 45,948 (211)

Metaheuristic Algorithm and Laser Projection for Adjusting the Model of the Last Lower Surface to a Footprint

Biomimetics
Nowadays, 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

An Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems [PDF]

Journal of Advances in Computer Engineering and Technology, 2020
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near ...
narges jafari, Farhad Soleimanian Gharehchopogh   +1 more
doaj  

Block scheduling in practice: An optimal decomposition strategy for nonidentical operating rooms

Decision Sciences, EarlyView.
Abstract We develop and implement a Master Surgery Schedule for a real‐life hospital, assigning operating room (OR) time to surgical specialties over a multi‐week horizon. Through action research, we identify a critical operational challenge: the issue of split blocks. Split blocks allow two specialties to share an OR on the same day—one in the morning,
Vincent J. J. van Ham, Alex Kuiper, Robert H. Lee   +2 more
wiley   +1 more source

Quokka swarm optimization: A new nature-inspired metaheuristic optimization algorithm

Journal of Intelligent Systems
Metaheuristics are efficient algorithms designed to address a broad spectrum of optimization challenges and offer satisfactory solutions, even in scenarios of limited processing capability or incomplete information.
AL-kubaisy Wijdan Jaber, AL-Khateeb Belal   +1 more
doaj   +1 more source

ACO for continuous function optimization: a performance analysis [PDF]

, 2014
The performance of the meta-heuristic algorithms often depends on their parameter settings. Appropriate tuning of the underlying parameters can drastically improve the performance of a meta-heuristic. The Ant Colony Optimization (ACO), a population based
Abraham, Ajith, Ojha, Varun Kumar, Snášel, Václav   +2 more
core  

Production routing decisions in a two‐echelon supply chain with multiple delivery modes

International Transactions in Operational Research, EarlyView.
Abstract We study an original two‐echelon production routing problem with multiple delivery modes (2E‐PRP‐MDM). In the first echelon, the primary production facility is tasked with satisfying the demands of two distinct entities: a set of warehouses and a set of customers through direct shipments. In the second echelon, warehouses become delivery hubs,
Rachida Benfedel, Fayçal Belkaid, Nadjib Brahimi   +2 more
wiley   +1 more source

A genetic algorithm simheuristic for solving the stochastic project portfolio selection problem with portfolio reliability constraints

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, David Lopez‐Lopez, Laura Calvet, Angel A. Juan   +3 more
wiley   +1 more source

Chaos-enhanced metaheuristics: classification, comparison, and convergence analysis

Complex & Intelligent Systems
Chaos theory, with its unique blend of randomness and ergodicity, has become a powerful tool for enhancing metaheuristic algorithms. In recent years, there has been a growing number of chaos-enhanced metaheuristic algorithms (CMAs), accompanied by a ...
Abdelhadi Limane, Farouq Zitouni, Saad Harous, Rihab Lakbichi, Aridj Ferhat, Abdulaziz S. Almazyad, Pradeep Jangir, Ali Wagdy Mohamed   +7 more
doaj   +1 more source

An efficient variable neighborhood search approach for the facility location problem with the limited choice rule

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, Alberto Herrán, J. Manuel Colmenar   +2 more
wiley   +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, Abraham Duarte, J. Manuel Colmenar   +2 more
wiley   +1 more source