نتایج جستجو برای: pickup and delivery
تعداد نتایج: 16858749 فیلتر نتایج به سال:
The transport requirements in modern society are becoming more and more important. Thus, offered transport services need to be more and more advanced and better designed to meet users demands. Important cost factors of many goods are transport costs. Therefore, a reduction of costs, a better adjustment of strategies to the demand as well as a better planning and scheduling of available resource...
The double travelling salesman problem with multiple stacks (DTSPMS) is a pickup and delivery problem in which all pickups must be completed before any deliveries can be made. The problem originates from a real-life application where a 40 foot container (configured as 3 columns of 11 rows) is used to transport up to 33 pallets from a set of pickup customers to a set of delivery customers. The p...
The new emerging area of Enterprise Wide Optimization (EWO) has focused the attention in effectively solving the combined producion/distribution scheduling problem. The importance of logistic activities performed in multi-site environments comes from the relative magnitude f the associated transportation costs and the good chance of getting large savings on such expenses. This paper first devel...
In the stochastic and dynamic multi-stage vehicle routing problem, a set of vehicles collectively transports and services demands which require service at multiple spatially separated locations. Arrival times and service locations of individual demands are not known until the demand’s arrival, and vehicles are assumed to have infinite capacity and to travel with bounded velocity. The objective ...
This paper introduces the pickup and delivery traveling salesman problem with handling costs (PDTSPH). In the PDTSPH, a single vehicle has to transport loads from origins to destinations. Loading and unloading of the vehicle is operated in a last-in-firstout (LIFO) fashion. However, if a load must be unloaded that was not loaded last, additional handling operations are allowed to unload and rel...
The split pickup and delivery problem is to find the shortest route that can provide delivery nodes with commodities collected from pickup nodes, subject to the vehicle load constraint. In particular, the split feature allows multiple visits to nodes and thus enables the vehicle to load or discharge an arbitrary portion of commodities along the route. This problem concerns the practical situati...
One important problem in transportation and logistics systems is the Multiple Vehicle Pickup and Delivery Problem with Time Windows (MV-PDPTW). The problem deals with a number of pickup and delivery (P&D) requests that should be served by a fleet of vehicles. A delivery location must be served after its corresponding pickup location. The vehicle’s journey should start and end at a central depot...
The location routing problem with simultaneous pickup and delivery (LRPSPD) is a new variant of the location routing problem (LRP). The objective of LRPSPD is to minimize the total cost of a distribution system including vehicle traveling cost, depot opening cost, and vehicle fixed cost by locating the depots and determining the vehicle routes to simultaneously satisfy the pickup and the delive...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید