Results 151 to 160 of about 8,018,297 (258)

A matheuristic for the traveling salesman problem with positional consistency constraints

International Transactions in Operational Research, EarlyView.
Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley   +1 more source

A unified formulation for home healthcare routing and scheduling problems

International Transactions in Operational Research, EarlyView.
Abstract Home Healthcare is an essential component of healthcare systems, where caregivers visit patients' homes to deliver services. While presenting advantages with respect to institutional care, such as being cost‐effective and alleviating family burdens, it presents challenges in scheduling and routing caregivers efficiently.
Sara Ceschia, Francesca Da Ros, Luca Di Gaspero, Simona Mancini, Vittorio Maniezzo, Roberto Montemanni, Roberto Maria Rosati, Andrea Schaerf   +7 more
wiley   +1 more source

A review of the Tabu Search Literature on Traveling Salesman Problems [PDF]

The Traveling Salesman Problem (TSP) is one of the most widely studied problems inrncombinatorial optimization. It has long been known to be NP-hard and hence research onrndeveloping algorithms for the TSP has focused on approximate methods in addition ...
Sumanta Basu, Ghosh, Diptesh
core  

Corrections to “An Opposition-Based Great Wall Construction Metaheuristic Algorithm With Gaussian Mutation for Feature Selection”

Presents corrections to the paper, An Opposition-Based Great Wall Construction Metaheuristic Algorithm With Gaussian Mutation for Feature ...
Guojiang Xiong, Farouq Zitouni, Ali Wagdy Mohamed, Saad Harous, Abdulaziz S. Almazyad   +4 more
core   +1 more source

Freight distribution optimization by implementing the team orienteering problem with occasional drivers

International Transactions in Operational Research, EarlyView.
Abstract This research evaluates the effectiveness of a hybrid crowdshipping system that integrates occasional drivers with traditional delivery services (OD+TD) to improve the efficiency of freight distribution. By implementing the team orienteering problem with occasional drivers model, we develop a mathematical model and an agile optimization ...
Alisson Garcia‐Herrera, Xabier A. Martin, Adrian Serrano‐Hernandez, Angel A. Juan, Javier Faulin   +4 more
wiley   +1 more source

Exact and metaheuristic approaches to minimizing makespan in parallel machine scheduling with conflicting jobs

International Transactions in Operational Research, EarlyView.
Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati, Dinh Quy Ta, Minh Hoàng Hà, Andrea Schaerf   +3 more
wiley   +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

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