نتایج جستجو برای: pickup and delivery
تعداد نتایج: 16858749 فیلتر نتایج به سال:
This paper introduces a special kind of multi-depot pickup and delivery problem. In contrast to the general pickup and delivery problem (GPDP, see e.g. [19, 31]) all requests have to be picked up at or delivered to one central location which has the function of a hub or consolidation point. In hub transportation networks routes between customers and the hub are often short, i.e. involve only on...
Solving the Vehicle Routing Problem (VRP) and its related variants is significant for optimizing logistic planning. One important variant of the VRP is the Pickup and Delivery Problem with Time Windows (PDPTW), where it is assumed that a client may request one of two service types, a pickup or a delivery. It is required to find a set of minimum cost routes for a fleet of vehicles, while observi...
The vehicle routing problem with simultaneous pickup and delivery (VRPSDP) is a common transportation problem where a fleet of vehicles deliver goods from the depot to line haul customers and pick up goods from backhaul customers to the depot. This problem variation allows vehicles to make the delivery and pickup operations on same time by visiting all clients once with the aim of minimization ...
The double traveling salesman problem with multiple stacks is a variant of the pickup and delivery traveling salesman problem in which all pickups must be completed before any of the deliveries. In addition, items can be loaded on multiple stacks in the vehicle and each stack must obey the last-in-first-out policy. The problem consists in finding the shortest Hamiltonian cycles covering all pic...
In the One-Commodity Pickup and Delivery Problem (1PDP), a single commodity type is collected from a set of pickup customers to be delivered to a set of delivery customers, and the origins and destinations of the goods are not paired. We introduce a new adaptive hybrid VNS/SA (Variable Neighborhood Search/Simulated Annealing) approach for solving the 1-PDP. We perform sequences of VNS runs, whe...
Road transport makes up a large share of total costs of intermodal transport. In this paper preand endhaulage in the service area of intermodal container terminals is modelled as a Full Truckload Pickup and Delivery Problem. A single container is delivered from the terminal to a customer or picked up at a customer location and returned to the terminal. Customers impose hard time windows. A two-...
Pickup and delivery problem with time windows (PDP-TW) is a challenging scheduling problem for which each delivery is coupled with a pickup request. Metaheuristic search techniques like the tabu search have been used to solve PDP-TW. In this paper, we investigated a min-conflicts based micro-genetic algorithm combining some interesting construction heuristic, namely the Align-Fold or Boomerang,...
We describe a constraint programming approach for a supplydelivery problem in the petrochemical industry, in which barges transport liquid material from supplier locations to downstream processing plants. The problem is to design a pickup-and-delivery route for each barge such that given minimum and maximum inventory levels at each location are met for a given fleet size. This optimization prob...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید