Results 81 to 90 of about 16,981 (186)
Online path planning based on MILP for unmanned surface vehicles
This paper presents an algorithm for online path planning of USVs to navigate safely in dynamic, sophisticated environments of oceans. The proposed algorithm is based on Mixed Integer Linear Programming (MILP) which integrated with Velocity Obstacle (VO)
Liu J(刘健) +2 more
core
Scheduling dynamic positioned tankers with variable travel time for offshore offoading operations [PDF]
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Engenharia de Automação e Sistemas, Florianópolis, 2015.A operação de campos de petróleo em alto mar implica na transferência de óleo que ...
Assis, Leonardo Salsano de
core
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
MILP-based trajectory generation in relative velocity coordinates
Mixed-integer linear programming (MILP) for trajectory generation of mobile robot suffers from nonlinear constraints due to complex obstacle contours and dynamic environment.
Tan DL(谈大龙) +2 more
core
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
An Efficient Mixed Integer Linear Programming Model for the Minimum Spanning Tree Problem
Finding a minimum spanning tree in a given network is a famous combinatorial optimization problem that appears in different engineering applications.
Tamer F. Abdelmaguid
doaj +1 more source
An MILP-based heuristic for staff scheduling problems with acceptance levels
We present a real-world staff-assignment problem that was reported to us by a provider of an online workforce scheduling software. The problem consists of assigning employees to work shifts subject to a large variety of requirements related to work laws,
Rihm, Tom
core
Large-scale MILP solution via a multi-agent reformulation [PDF]
LAUREA MAGISTRALEI programmi lineari misto-interi (MILPs) si presentano in diversi contesti e applicazioni ingegneristiche e permettono di formulare una grande varietà di problemi decisionali che coinvolgono sistemi formati da componenti continue e ...
Manieri, Lucrezia
core
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
A Mixed Integer Programming Approach to the Rechargeable Rover Routing Problem on Mars
In this paper, we introduce a novel variant of the Vehicle Routing Problem (VRP), the Rechargeable Rover Routing Problem (RRRP), which addresses the routing of energy-constrained autonomous electric rovers for Martian missions.
Burzyński Wojciech, Kaleta Mariusz
doaj +1 more source

