Results 101 to 110 of about 12,107 (234)
Integrated location–inventory planning for slow‐moving demands with waiting time limitations
Abstract This paper studies a stochastic facility location problem integrated with inventory and transportation decisions (SFLPIT) for supply chains with slow‐moving stock‐keeping units (SKUs). Local stores often avoid maintaining such SKUs, resulting in customer demand being fulfilled directly by a central distribution center (DC), where the ...
Jie Chu +4 more
wiley +1 more source
Study of Convergence in Metaheuristics Algorithms
Donatas Kavaliauskas +1 more
openaire +1 more source
A matheuristic for the traveling salesman problem with positional consistency constraints
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
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 +7 more
wiley +1 more source
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 +4 more
wiley +1 more source
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 +3 more
wiley +1 more source
Park‐and‐multi‐loop with autonomous delivery robots in last‐mile logistics
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 +4 more
wiley +1 more source
Optimization of structural assembly scheduling in the aeronautics industry
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 +3 more
wiley +1 more source
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
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

