Results 81 to 90 of about 26,115 (210)

Exact solution algorithms for biobjective mixed integer programming problems

International Transactions in Operational Research, EarlyView.
Abstract We consider criterion space algorithms for biobjective mixed integer programs. The algorithms solve scalarization models in order to explore predetermined regions of the objective space called boxes, defined by two nondominated points. When exploring, the algorithm exploits information on its corner points and chooses the scalarization problem
Deniz Emre, Özlem Karsu, Firdevs Ulus
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

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

An EPTAS for Scheduling on Unrelated Machines of Few Different Types

, 2017
In the classical problem of scheduling on unrelated parallel machines, a set of jobs has to be assigned to a set of machines. The jobs have a processing time depending on the machine and the goal is to minimize the makespan, that is the maximum machine ...
A Asadpour, C Imreh, DS Hochbaum, E Horowitz, F Eisenbrand, GJ Woeginger, HW Lenstra Jr, I Bezáková, JC Gehrke, JK Lenstra, K Jansen, L Chen, R Bleuse, R Kannan   +13 more
core   +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

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

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 Scheduling Model for Optimizing Joint UAV-Truck Operations in Last-Mile Logistics Distribution

Aerospace
This paper investigates the joint scheduling problem of unmanned aerial vehicles (UAVs) and trucks for community logistics, where UAVs act as service providers for last-mile delivery and trucks serve as mobile storage platforms for drone deployment.
Xiaocheng Liu, Yuhan Wang, Meilong Le, Zhongye Wang, Honghai Zhang   +4 more
doaj   +1 more source

On optimizing over lift-and-project closures [PDF]

, 2010
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by computing all mixed integer Gomory cuts read from all tableau's corresponding
Bonami, Pierre
core   +2 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