Results 101 to 110 of about 14,420 (223)

Straddle carrier routing optimization at container terminals utilizing telemetry‐based prediction

International Transactions in Operational Research, EarlyView.
Abstract Efficient vehicle routing and scheduling for horizontal transport means on container terminals can reduce lead times and travel distances, resulting in fuel savings and productivity gains. We apply machine learning to emulate operational processes, bridging the gap between theoretical optimization models and real‐world practices at container ...
Julian Neugebauer, Ahmet Cürebal, Leonard Heilig, Stefan Voß   +3 more
wiley   +1 more source

Park‐and‐multi‐loop with autonomous delivery robots in last‐mile logistics

International Transactions in Operational Research, EarlyView.
Abstract This paper deals with the park‐and‐multi‐loop routing problem, in the context of last‐mile logistics, in which a fleet of traditional vehicles equipped with several autonomous delivery robots leaves from a depot to service a set of customer requests.
Tommaso Adamo, Gianpaolo Ghiani, Emanuela Guerriero, Emanuele Manni, Gianluca Solazzo   +4 more
wiley   +1 more source

Fifty years of metaheuristics

European Journal of Operational Research
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rafael Martí, Marc Sevaux, Kenneth Sörensen   +2 more
openaire   +2 more sources

Optimization of structural assembly scheduling in the aeronautics industry

International Transactions in Operational Research, EarlyView.
Abstract In the aeronautical industry, structural assembly refers to the stage in which parts, subassemblies, and main aircraft structures are fitted together, forming aerostructures. Aircraft structural assembly requires many complex activities to be performed over an intricate precedence network and is subject to interactions among the various ...
Bruno Jensen Virginio da Silva, Mateus Martin, Reinaldo Morabito, Vitoria Pureza   +3 more
wiley   +1 more source

A Bibliometric Analysis of a Genetic Algorithm for Supply Chain Agility

Mathematics
As a famous population-based metaheuristic algorithm, a genetic algorithm can be used to overcome optimization complexities. A genetic algorithm adopts probabilistic transition rules and is suitable for parallelism, which makes this algorithm attractive ...
Weng Hoe Lam, Weng Siew Lam, Pei Fun Lee
doaj   +1 more source

Deep reinforcement learning for multi‐restart metaheuristics: an environment design for a hybrid of unbiased exploratory search and covariance matrix adaptation evolution strategy

International Transactions in Operational Research, EarlyView.
Abstract Multi‐restart metaheuristics can be highly effective for complex optimization problems, yet their performance depends critically on how restarts and algorithmic parameters are selected. This paper introduces a reinforcement learning approach for managing restart‐level decisions and parameter configurations in the UES–CMA‐ES hybrid ...
Antonio Bolufé‐Röhler, Bowen Xu
wiley   +1 more source

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

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

International Transactions in Operational Research, Volume 33, Issue 6, Page 4039-4071, November 2026.
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

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

International Transactions in Operational Research, Volume 33, Issue 6, Page 3905-3933, November 2026.
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 formulation and a metaheuristic approach for the clustered vehicle routing problem with d‐relaxed priority rule

International Transactions in Operational Research, Volume 33, Issue 6, Page 3714-3743, November 2026.
Abstract This paper investigates an extension of the vehicle routing problem in which, in addition to minimizing the distance traveled, the sequencing of customer visits is subject to precedence constraints that impose visiting priorities among customers.
Eduardo dos Santos Teixeira, Silvio Alexandre de Araujo   +1 more
wiley   +1 more source