In this paper, we consider a large-scale instance of the classical Pickup-and-Delivery Vehicle Routing Problem (PDVRP) that must be solved by network mobile cooperating robots. Robots self-coordinate and self-allocate set pickup/delivery tasks while minimizing given cost figure. This results in large, challenging Mixed-Integer Linear cooperatively % without central coordinator. We propose distr...

We present a two-echelon van-based robot last-mile pickup and delivery system in urban settings. Robots can visit areas with van access restrictions, such as pedestrianized or university campuses. The stops at parking nodes to drop off and/or pick up its robot, replenish swap robot’s battery if needed. Five van/robot cases are considered, according the roles plays process of pickup/delivery whe...

This paper modeled and solved an integrated multi-depot vehicle routing problem (MDVRP) with simultaneous pickup delivery (SPD) package layout under unpredictable pickup, delivery, transfer costs. The model described in this is divided into two stages. In the first stage, SCA algorithm used to optimize dimensions (a collection of commodities consumers need). NSGA II MOALO algorithms are second ...

In this paper we introduce a new class of Pickup and Delivery problems on circles (or rings). These arise in the field public transportation systems where autonomous (i.e. driverless) vehicles travel circular networks. We consider set stations arranged circle requests. Each request asks for certain quantity from pickup station to delivery station. A fleet capacitated is available at depot. firs...

Continuous growth in air cargo deliveries and increasing competition is necessitating freight forwarders to develop innovative solutions to improve performance and reduce costs. This study considers a freight forwarder's operational implementation of alternative access airport policy in a multi-airport region for air cargo transportation. Given a set of heterogeneous air cargo customers, the fo...

In this paper, we investigate in the application of the Contract Net negotiation Protocol (CNP) to deal with a dynamic hard transportation problems. Our interest in the Multi-agent negotiation approaches accounts for its proved suitability with dynamic and uncertain domains [8][9]. We address the resolution of the uncapacitated-multi-vehicle-Dynamic Pickup and Delivery Problem with Time Windows...