In this paper, we propose a Multi-operator Genetic Algorithm (MGA) for solving the diversified fuel replenishment problem (DFRP). We particularly consider the delivery problem of multiple types of fuels to n stations geographically dispersed in an addressed area. The main objective of the delivery process is to minimize the total travel distance of a fleet of trucks equipped by multi-compartmen...

This paper investigates the problem of decentralized task assignment for a fleet of cooperative UAVs. It extends the analysis of a previously proposed algorithm to consider the performance with different communication network topologies. The results show that the second communication step introduced during the planning phase of the new algorithm is crucial for sparse networks because the conver...

This paper discusses several unique hardware testbeds that were developed to evaluate coordination and control algorithms for missions with multiple unmanned aerial vehicles (UAVs). The first testbed uses eight rovers and two blimps operated indoors to emulate a heterogeneous fleet of aircraft. The second testbed has eight UAVs flown autonomously with commercial autopilots, which are also used ...

The Rental Fleet Scheduling Problem (RFSP) arises in vehicle rental operations that offer a wide variety of vehicle types to customers, and allow a rented vehicle to “migrate” to a setdown depot other than the pickup depot. When there is a shortage of vehicles of a particular type at a depot, vehicles may be relocated to that depot, or vehicles of similar types may be substituted. The RFSP invo...

This paper discusses the development and testing of a unique testbed consisting of a fleet of eight autonomous unmanned aerial vehicles (UAVs) that was designed as a platform for evaluating autonomous coordination and control algorithms. Future UAV teams will have to autonomously demonstrate cooperative behaviors in dynamic and uncertain environments, and this testbed can be used to compare var...

This paper compares technologies for a dynamic truckload pickup and delivery problem in a competitive environment using sequential auctions. In this environment, demands arrive randomly over time and are described by pick up, delivery locations and hard timewindows. Upon demand arrival, carriers compete for the loads in a second price auction. Four fleet assignment technologies with different d...

This paper describes a polynomial transformation for a class of unit-demand vehicle routing problems, named node-balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the routes is balanced. The transformation is general in that it can be applied to single or multiple depot, homogeneous or heterogeneous fleet BR...

The paper describes a prototype Dynamic Freight Traffic Simulation model called DyFTS, constructed for studying the effects of highly developed information technologies and logistic strategies on freight transportation. DyFTS is designed as a highly adaptable system that can be easily embedded into a more comprehensive transportation simulation model. Various decision-making processes are formu...

In the Petrol Station Replenishment Problem with Time Windows (PSRPTW) the aim is to optimize the delivery of several petroleum products to a set of petrol stations using a limited heterogeneous fleet of tank-trucks. More specifically, one must determine the quantity of each product to deliver, the assignment of products to truck compartments, delivery routes, and schedules. The objective is to...

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...