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

Curb space management and traffic flow are two important elements of the transportation system that interact with each other affect overall performance. With growth new mobility operators goods delivery, demand for access to curb is increasing rapidly. Thus, traditional use solely parking challenged it becomes manage effectively. Our study investigates allocation various uses (i.e., parking, pi...

Ant Colony Optimization (ACO) is a population-based metaheuristic that can be used to find approximate solutions to difficult optimization problems. It was first introduced for solving the Traveling Salesperson Problem. Since then many implementations of ACO have been proposed for a variety of combinatorial optimization problems. In this chapter, ACO is applied to the Vehicle Routing Problem wi...

The Vehicle Routing Problem with Backhauls is a generalization of the ordinary capacitated vehicle routing problem where goods are delivered from the depot to the linehaul customers, and additional goods are brought back to the depot from the backhaul customers. Numerous ways of modeling the backhaul constraints have been proposed in the literature, each imposing different restrictions on the h...

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

The most studied combinatorial optimization problem in transport and logistics is the vehicle routing problem (VRP). The goal of the vehicle routing problem is to nd a set of routes for a eet of vehicles which optimises the objective function (e.g. total distance, routing costs). Every demand needs to be ful lled and vehicle capacities need to be respected. Many solution methods exist for the '...

The tragedy that awaited the world at dawn of 2020 with surfacing new COVID-19 pandemic was recognized as deadliest in recent history considering from standpoint its socio-economic and political disruptions worldwide. No country left untouched by even Nigeria, businesses activities were reduced least 50%, putting an estimated 26.42 million employees risk losing their jobs. Thus, this study focu...

In this work, the Multi-Depot Green VRP with Pickups and Deliveries (MDGVRP-PD) is studied. It a routing optimization problem in which objective to construct set of vehicle routes considering multiple depots one-to-one pickup delivery operations that minimize emissions through fuel consumption, depends on weight travel distance. problems, goods must be transported between single origin its asso...