We study a variant of dynamic vehicle routing problem with pickups and deliveries where a vehicle is allocated to each service (i.e., trip) request immediately upon the arrival of the request. Solutions to this problem can be characterized as dynamic policies that define how each customer is handled by operating a fleet of vehicles. Evaluation of such policies is beyond the grasp of analytical ...

Bike sharing systems (BSSs) offer a mobility service whereby public bikes, located at different stations across an urban area, are available for shared use. An important point is that the distribution of rides between stations is not uniformly distributed and certain stations fill up or empty over time. These empty and full stations lead to demand for bikes and return boxes that cannot be fulfi...

This work presents a hybrid approach to solve distribution problem of Portuguese company in the automotive industry. The objective is determine minimum cost for daily operations, such as collecting and delivering goods multiple suppliers. Additional constraints are explicitly considered, time windows loading due limited capacity fleet terms weight volume. An exhaustive review state art was cond...

Cooperative Pickup and Delivery Problem (PDP), as a variant of the typical Vehicle Routing Problems (VRP), is an important formulation in many real-world applications, such on-demand delivery, industrial warehousing, etc. It great importance to efficiently provide high-quality solutions cooperative PDP. However, it not trivial effective directly due two major challenges: 1) structural dependenc...

Recently, there is an emerging trend to apply deep reinforcement learning solve the vehicle routing problem (VRP), where a learnt policy governs selection of next node for visiting. However, existing methods could not handle well pairing and precedence relationships in pickup delivery (PDP), which representative variant VRP. To address this challenging issue, we leverage novel neural network in...

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

ACKNOWLEDGEMENTS While working on my Ph.D. at Georgia Tech and Michigan, I have received a great deal of support from many different people. My degree would not have been possible without this support. I would like to begin by thanking my two dissertation advisors, Dr. Ozlem Ergun and Dr. Chip White. Their guidance and encouragement was constant and unwavering. They helped open the door for me ...

The One-Commodity Pickup-and-Delivery Travelling Salesman Problem (1-PDTSP) is defined on a directed graph as follows. A node of the graph represents a depot and the other nodes represent customers. Every customer has a positive or negative demand of a product. The product is the same for all customers. Customers with positive demand are called pickups and customers with negative demand are cal...