Results 81 to 90 of about 26,837 (219)

An effective and efficient matheuristic for the electric vehicle routing problem with capacitated recharging stations

International Transactions in Operational Research, EarlyView.
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, Daniele Ferone, Paola Festa, Ornella Pisacane   +3 more
wiley   +1 more source

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

Intent-Driven UAM Scheduling: An Explainable Hybrid AI Framework

Aerospace
This paper presents a hybrid AI framework for rescheduling tasks within UAM vertiports. This scheduling challenge is approached as a resource-constrained project scheduling problem (RCPSP), typically solved via mixed-integer linear programming (MILP ...
Jeongseok Kim, Kangjin Kim
doaj   +1 more source

Mixed Integer Linear Programming For Exact Finite-Horizon Planning In Decentralized Pomdps [PDF]

, 2007
We consider the problem of finding an n-agent joint-policy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity (NEXP-hard in n >= 2).
Aras, Raghav, Charpillet, François, Dutech, Alain   +2 more
core   +3 more sources

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

International Transactions in Operational Research, EarlyView.
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

Handling software upgradeability problems with MILP solvers

, 2010
Upgradeability problems are a critical issue in modern operating systems. The problem consists in finding the "best" solution according to some criteria, to install, remove or upgrade packages in a given installation.
Chris Tucker, Claude Michel, Ewald Speckenmeyer, Fabio Mancinelli, Inês Lynce, Josep Argelich, Josep Argelich, Michel Rueher, Olivier Roussel, Ralf Treinen, Ralf Treinen, Tobias Achterberg, Ulrich Junker, Vasco M. Manquinho   +13 more
core   +2 more sources

Scheduling optimization of optical lens polishing

International Transactions in Operational Research, EarlyView.
Abstract Optical systems have achieved notable progress in focusing and imaging technologies; however, manual grinding remains indispensable, resulting in elevated costs, extended timelines, and inefficiencies. These difficulties are compounded by operational constraints, uneven machine utilization, and risks of order delays and escalating expenses ...
Tzu‐Chin Lin, Bertrand M. T. Lin
wiley   +1 more source

MPC-Based Surveillance over Graphs by Multiple Agents

SICE Journal of Control, Measurement, and System Integration, 2017
The multi-agent surveillance problem over graphs is to find trajectories of multiple agents that travel each node as evenly as possible. This problem has several applications such as city safety management and disaster rescue.
Mifuyu Kido, Koichi Kobayashi, Yuh Yamashita   +2 more
doaj   +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