In this paper we consider a dynamic full truckload pickup and delivery problem with time-windows. Jobs arrive over time and are offered in a second-price auction. Individual vehicles bid on these jobs and maintain a schedule of the jobs they have won. We propose a pricing and scheduling strategy based on dynamic programming where not only the direct costs of a job insertion are taken into accou...

The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge, when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pu...

Communities of autonomous units are being developed for formal specification and semantic analysis of systems of interacting and mobile components. The autonomous units of a community are rulebased, self-controlled, goal-driven, and operate and move in a common environment. We employ communities of autonomous units to model the dynamic pickup and delivery problem with the general idea to demons...

In this paper, a special case of the vehicle routing problem in which the demands consist in a set of rectangular two-dimensional weighted items is considered. The vehicles have a two-dimensional loading surface and a maximum weight capacity. These problems have a routing and a packing component. A framework to handle the loading of a vehicle is proposed. A Constraint Programming loading model ...

The Traveling Salesman Problem with Pickup and Delivery (PDTSP) is considered. Seven perturbation heuristics are applied to instances ranging from 51 to 443 vertices. The main point of perturbation heuristics is to help a local search process to move away from a local optimum. The seven heuristics fall into three categories: Instance Perturbation (IP), Algorithmic Perturbation (AP), and Solutio...

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