Results 111 to 120 of about 12,107 (234)

Heuristic approaches for a new variant of the team orienteering problem

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract In this paper, we tackle the team orienteering problem (TOP) with service times, mandatory nodes and incompatibilities arising from two real‐world healthcare applications. We propose two heuristic algorithms: a variable neighbourhood descent algorithm and a matheuristic based on a cut separation approach.
Alberto Guastalla   +2 more
wiley   +1 more source

THE ALGORITHM OF SUBSIDIARY METAHEURISTICS

open access: yesОбразовательные ресурсы и технологии, 2022
V.Ya. Tsvetkov, A.V. Kozlov
openaire   +1 more source

Optimizing equity and efficiency in the aerial firefighting resource allocation problem

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract This study addresses the aerial firefighting resource allocation problem, formulated as the strategic prepositioning of a heterogeneous aerial firefighting fleet across capacity‐constrained airbases. A novel bi‐objective model is proposed that simultaneously optimizes efficiency (aggregate risk‐weighted accessibility) and equity (minimized ...
Konstantinos A. Tasias, George Nenes
wiley   +1 more source

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

open access: yesInternational 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

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

open access: yesInternational Transactions in Operational Research, Volume 34, Issue 1, Page 429-459, January 2027.
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   +3 more
wiley   +1 more source

Metaheuristics for The Solution of Dynamic Vehicle Routing Problem With Time Windows (DVRPTW) With Travel Time Variable

open access: yesJAREE (Journal on Advanced Research in Electrical Engineering), 2017
This research is focusing on the development of metaheuristic algorithm to solve Dynamic Vehicle Routing Problem With Time Windows (DVRPTW) for the service provider of Inter-city Courier. The algorithm is divided into two stages which is static stage and
Nurlita Gamayanti
doaj  

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

open access: yesInternational 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   +3 more
wiley   +1 more source

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

open access: yesInternational 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   +2 more
wiley   +1 more source

Heart rate optimizer: a novel bio-inspired metaheuristic algorithm. [PDF]

open access: yesSci Rep
Hosney ME   +4 more
europepmc   +1 more source

A formulation and a metaheuristic approach for the clustered vehicle routing problem with d‐relaxed priority rule

open access: yesInternational 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   +1 more
wiley   +1 more source

Home - About - Disclaimer - Privacy