Online second-hand marketplaces have seen a vast increase in transactions recent years, although sending and receiving parcels can be an inconvenience for private buyers sellers C2C settings. To facilitate transportation providers expanding their product portfolio with alternative concepts, we consider the pickup delivery problem (PDP) locations overlapping time windows. The requests to served ...

This paper deals with the pickup and delivery traveling salesman problem. First we show how to adapt some classical traveling salesman heuristics to solve this problem, then we propose a new and e$cient composite heuristic. The proposed heuristic is composed of two phases: a solution construction phase including a local optimization component and a deletion and re-insertion improvement phase. T...

I this paper we formally introduce a generic real-time multivehicle truckload pickup and delivery problem. The problem includes the consideration of various costs associated with trucks’ empty travel distances, jobs’ delayed completion times, and job rejections. Although very simple, the problem captures most features of the operational problem of a real-world trucking fleet that dynamically mo...

The pickup and delivery problem (PDP) considers a set of transportation requests, which specify the quantity of product that has to be picked up from an origin and delivered to a destination. There exist a number of vehicles available to be used for completing these tasks. PDP consists of finding a collection of routes with minimum cost, such that all transportation request are serviced. Tradit...

Traffic congestion is a significant social concern that is credited with considerable economic costs, wasted time, and associated public health risks. Efficient ridesharing solutions could help mitigate congestion. Some of the actions government agencies have taken encourage ridesharing include the availability of High Occupancy Vehicle (HOV) lanes and existing policies of discounted toll rates...

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