Split Demand One-to-One Pickup and Delivery Problems With the Shortest-Path Transport Along Real-Life Paths
نویسندگان
چکیده
منابع مشابه
Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
In one-to-one Pickup and Delivery Problems (PDPs), the aim is to design a set of least cost vehicle routes starting and ending at a common depot in order to satisfy a set of pickup and delivery requests between location pairs, subject to side constraints. Each request originates at one location and is destined for one other location. These requests apply to the transportation of goods or people...
متن کاملThe One Commodity Pickup and Delivery Traveling Salesman Problem with Demand Intervals
This study introduces the One-Commodity Pickup and Delivery Traveling Salesman Problem with Demand Intervals (1-PDTSP-DI), a generalization of the One Commodity Pickup and Delivery Traveling Salesman Problem (1-PDTSP). In the 1-PDTSP-DI, the vertices are required to have an inventory lying between given lower and upper bounds and initially have an inventory which does not necessarily lie betwee...
متن کاملPickup and Delivery with Split Loads
Splitting loads such that the delivery of certain loads is completed in multiple trips rather than one trip results in opportunities for a reduction in cost and the number of vehicles used. Several studies have shown the benefit of split deliveries for the Vehicle Routing Problem, in which a vehicle operating out of a depot makes a series of deliveries on each route. In this paper, we quantify ...
متن کاملThe Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic
This paper treats of a generalization of the Traveling Salesman Problem (TSP) called Multi-commodity one-to-one Pickup-and-Delivery Traveling Salesman Problem (m-PDTSP) in which cities corresponds to customers providing or requiring known amounts of m different objects, and the vehicle has a given upper-limit capacity. Each object has exactly one origin and one destination, and the vehicle must...
متن کاملShortest Paths in One-Counter Systems
We show that any one-counter automaton with n states, if its language is non-empty, accepts some word of length at most O(n). This closes the gap between the previously known upper bound of O(n) and lower bound of Ω(n). More generally, we prove a tight upper bound on the length of shortest paths between arbitrary configurations in onecounter transition systems. Weaker bounds have previously app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3017132