Results 141 to 150 of about 1,727,456 (275)

An enhanced adaptive large neighborhood search algorithm for the multiple allocation p‐hub location problem with a mesh backbone network in video‐on‐demand services

International Transactions in Operational Research, EarlyView.
Abstract This study tackles the multiple allocation p$p$‐hub location problem (MApHLP) in the context of video‐on‐demand services, where digital content is partitioned into segments and stored exclusively at selected hub locations. Users, distributed across a wide geographical area, can connect to multiple hubs based on demand patterns, with all hubs ...
Soumen Atta
wiley   +1 more source

Study of Convergence in Metaheuristics Algorithms

Baltic Journal of Modern Computing, 2019
Donatas Kavaliauskas, Leonidas Sakalauskas   +1 more
openaire   +2 more sources

Modeling Bloons Tower Defense as a temporal two‐dimensional knapsack problem with irregular shapes and side constraints: integer programming–based approaches

International Transactions in Operational Research, EarlyView.
Abstract In Tower Defense (TD) games, the objective is to defend a specific point on the game map from mobile units by constructing towers with offensive capabilities. In this work, we focus on Bloons Tower Defense (Bloons TD), one of the earliest and most prominent TD games.
Maxence Delorme, Jakub Malinowski
wiley   +1 more source

Random‐key optimization for 2D irregular packing with reusable area evaluation

International Transactions in Operational Research, EarlyView.
Abstract The diverse constraints of industrial applications lead to variants of two‐dimensional (2D) irregular packing problems that require tailored solution methods. This paper addresses a real‐world industrial challenge by proposing a new problem definition, the maximum reusable contiguous area problem (MRCAP), and a novel metric, the maximum ...
Felipe S. C. Roberto, Victor U. Pugliese, Sanderson L. Gonzaga de Oliveira, Oseias Ferreira, Antonio A. Chaves, Fabio A. Faria   +5 more
wiley   +1 more source

Efficient heuristics for the Steiner forest problem

International Transactions in Operational Research, EarlyView.
Abstract Let G=(V,E)$G = (V, E)$ be a connected undirected graph, V$V$ a set of nodes, E$E$ a set of edges, |V|=n$|V| = n$, and |E|=m$|E| = m$. Given a non‐negative weight function w:E→R+$w: E \rightarrow \mathbb {R}^+$ associated with its edges, a set τ={Ti⊆V|i=1,…,p}$\tau = \lbrace T_i \subseteq V | i = 1, \ldots, p\rbrace$ of terminal sets Ti$T_i ...
Murilo Stockinger, Isabel Rosseti, Simone Martins, Luidi Simonetti, Alexandre Plastino   +4 more
wiley   +1 more source

Balancing efficiency and robustness in project team formation: a hybrid evolutionary‐MCDM approach

International Transactions in Operational Research, EarlyView.
Abstract Effective team formation requires balancing technical skills, personality compatibility, and project constraints when selecting small teams from large candidate pools. Traditional multi‐criteria decision‐making (MCDM) methods provide rigorous evaluation but face scalability limitations.
Georgios Stavrou, Panagiotis Adamidis, Jason Papathanasiou   +2 more
wiley   +1 more source

Typical metaheuristic algorithms used for feature selection in the past three years.

Typical metaheuristic algorithms used for feature selection in the past three years.
Guangwei Liu (181992), Feng Jiang (95012), Ensan Fu (17720428), Zhiqing Guo (578396), Wei Liu (20030)   +4 more
core   +1 more source

A genetic algorithm for scheduling an automated machine cell with tool and pallet–fixture setups

International Transactions in Operational Research, EarlyView.
Abstract This paper solves the scheduling problem of identical parallel machines with tooling and pallet–fixture constraints in a high‐mix, low‐volume, high‐complexity manufacturing environment. The machines are connected through an automated material handling device and in‐between buffer places that allow for autonomous production.
Koen Herps, Quang‐Vinh Dang, Tugce Martagan, Ivo Adan   +3 more
wiley   +1 more source

Efficient exact formulations for the flexible job shop scheduling with flexible maintenance

International Transactions in Operational Research, EarlyView.
Abstract In modern manufacturing systems, integrating preventive maintenance into production scheduling is essential to ensure operational efficiency and equipment reliability. This paper addresses the flexible job shop scheduling problem under machine unavailability constraints caused by non‐fixed maintenance tasks.
Tom Perroux, Taha Arbaoui, Leila Merghem Boulahia, Khaled Hadj‐Hamou, Jean‐Dominique Regazzoni   +4 more
wiley   +1 more source

The one‐dimensional cutting stock problem with sequence‐dependent setups

International Transactions in Operational Research, EarlyView.
Abstract The cutting stock problem (CSP) is a classic operations research problem with several applications in real‐world scenarios. It involves cutting large objects into smaller items to satisfy customer demands, minimizing the number of cut objects.
Eduardo M. Silva, Antônio A. Chaves, Mauricio G. C. Resende, Silvio A. de Araujo   +3 more
wiley   +1 more source