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

In the double TSP with multiple stacks, one performs a Hamiltonian circuit to pick up n items, storing them in a vehicle with s stacks of finite capacity q satisfying lastin-first-out constraints, and then delivers every item by performing a Hamiltonian circuit. We introduce an integer linear programming formulation with arc and precedence variables. We show that the underlying polytope shares ...