In the era of smart manufacturing, autonomous mobile robots have become affordable for numerous companies, although fleet management remains a challenging problem. A novel approach is proposed, supporting solution vehicle assignment The method relies on adaptive workstation clustering that considers not only complex environment layout, but also main characteristics material flow. technique comb...

We are interested in the problem of determining size a fleet robots able to perform transport operations logistics warehouse. The divided into several phases: loading, loaded travel, unloading and empty travel. first determine minimum number needed set homogeneous loads from point A B over determined time interval. For same robots, many assignments exist. assignment that minimizes makespan, whi...

In this paper, an event-Mixed Integer Linear Programming (MILP)-based algorithm is proposed to solve the task allocation problem in a Robotic Sensor Network (RSN). A fleet of two types vehicles considered, giving, as result, heterogeneous configuration network, since each type vehicle has nominal velocity and set allowed paths go. The can be applied distributed estimation solar irradiance on pa...

Fleet automation often involves solving several strongly correlated sub-problems, including task allocation, motion planning, and coordination. Solutions need to account for very specific, domaindependent constraints. In addition, several aspects of the overall fleet management problem become known only online. We propose a method for solving the fleet-management problem grounded on a heuristic...

The transit network design problem (TNDP) aims to find a set of routes and corresponding frequencies for an urban public transportation system. We model the TNDP as a multi-objective combinatorial optimization problem whose resolution involves finding a Pareto front that represents different trade-off levels between opposite objectives, the travel and waiting times and the required fleet of bus...

The paper discusses an Integer Linear Programming (ILP) formulation that describes the problem of planning the use of domestic distributed generators, under individual as well as fleet constraints. The planning problem comprises the assignment of time intervals during which the local generator must produce or not. In [1] this ILP is shown to be NP-complete in the strong sense. Heuristic methods...

Airport demand management strategies have the potential to mitigate congestion and delays. However, the extent to which the delays can be reduced using such strategies is not clear. In this paper, we develop a bound on the minimum possible level of delays that can be achieved using these strategies. We solve the aggregated timetable development and fleet assignment problem to minimize the syste...

We study real-time routing policies in smart transit systems, where the platform has a combination of cars and high-capacity vehicles (e.g., buses or shuttles) seeks to serve set incoming trip requests. The can use its fleet as feeder connect passengers fleet, which operates on fixed routes. Our goal is find optimal (bus) routes corresponding frequencies maximize social welfare system given tim...

 We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...

This document describes a FORTRAN IV subroutine named CAVAP (an acronym for conCAVe Assignment Problem) which uses a branch and bound method to solve a variant of the assignment problem in which the objective to be minimized is concave. It is assumed that m tasks are to be performed and n different kinds of machines have been defined for possible use in performing them. In general a task may be...