Results 111 to 120 of about 64,962 (224)
A fast metaheuristic approach for the planar multiple obnoxious facility location problem
Abstract The multiple obnoxious facility location problem is one of the most studied problems in the literature of the obnoxious facility location problems family. In this work, we propose an alternative algorithmic approach for this problem, based on an efficient metaheuristic procedure over a discretization of the plane based on Voronoi diagrams ...
Sergio Salazar +2 more
wiley +1 more source
Abstract In this paper, we address the problem of routing a fleet of electric vehicles (EVs) to serve a set of customers, geographically distributed, within their time windows. We assume that EVs may also be recharged en route, and the amount of energy recharged at a recharging station (RS) is a decision variable itself, that is, partial recharges are ...
Maurizio Bruglieri +3 more
wiley +1 more source
An iterated greedy‐based metaheuristic with local search for the rank pricing problem
Abstract The rank pricing problem involves determining optimal prices for a set of products while accounting for customers' budgets and preferences. This study develops an iterated greedy‐based metaheuristic to efficiently solve this problem. The core idea is to generate a sequence of solutions by iteratively applying destruction and reconstruction ...
Herminia I. Calvete +3 more
wiley +1 more source
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
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 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
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
Optimized Scheduling of IoT Devices in Healthcare Facilities: Balancing Cost and Quality of Care
This paper addresses the critical challenge of optimal allocation and scheduling of Internet of Things (IoT) tracking devices for patient monitoring in healthcare facilities, where limited resources must be efficiently distributed to minimize cost and ...
Francesco Nucci +2 more
doaj +1 more source

