Matches in SemOpenAlex for { <https://semopenalex.org/work/W2137716917> ?p ?o ?g. }
Showing items 1 to 70 of
70
with 100 items per page.
- W2137716917 abstract "We give the first non-trivial approximation algorithm for the Capacitated Dial-a-Ride problem: given a collection of objects located at points in a metric space, a specified destination point for each object, and a vehicle with a capacity of at most k objects, the goal is to compute a shortest tour for the vehicle in which all objects can be delivered to their destinations while ensuring that the vehicle carries at most k objects at any point in time. The problem is known under several names, including the Stacker Crane problem and the Dial-a-Ride problem. No theoretical approximation guarantees were known for this problem other than for the cases k=1, /spl infin/ and the trivial O(k) approximation for general capacity k. We give an algorithm with approximation ratio O(/spl radic/k) for special instances on a class of tree metrics called height-balanced trees. Using Bartal's recent results on the probabilistic approximation of metric spaces by tree metrics, we obtain an approximation ratio of O(/spl radic/k log n log log n) for arbitrary n point metric spaces. When the points lie on a line (line metric), we provide a 2-approximation algorithm. We also consider the Dial-a-Ride problem in another framework: when the vehicle is allowed to leave objects at intermediate locations and pick them up at a later time and deliver them. For this model, we design an approximation algorithm whose performance ratio is O(1) for tree metrics and O(log n log log n) for arbitrary metrics. We also study the ratio between the values of the optimal solutions for the two versions of the problem. We show that unlike in k-delivery TSP in which all the objects are identical, this ratio is not bounded by a constant for the Dial-a-Ride problem, and it could be as large as R(k/sup 2/3/)." @default.
- W2137716917 created "2016-06-24" @default.
- W2137716917 creator A5046140110 @default.
- W2137716917 creator A5071016611 @default.
- W2137716917 date "2002-11-27" @default.
- W2137716917 modified "2023-09-23" @default.
- W2137716917 title "The finite capacity dial-a-ride problem" @default.
- W2137716917 cites W15274158 @default.
- W2137716917 cites W1952648253 @default.
- W2137716917 cites W1980244058 @default.
- W2137716917 cites W1985351788 @default.
- W2137716917 cites W2000628435 @default.
- W2137716917 cites W2002356593 @default.
- W2137716917 cites W2005967256 @default.
- W2137716917 cites W2017893044 @default.
- W2137716917 cites W2035807812 @default.
- W2137716917 cites W2037992565 @default.
- W2137716917 cites W2041571997 @default.
- W2137716917 cites W2062848345 @default.
- W2137716917 cites W2062893072 @default.
- W2137716917 cites W2063659595 @default.
- W2137716917 cites W2075420967 @default.
- W2137716917 cites W2078969731 @default.
- W2137716917 cites W2081313488 @default.
- W2137716917 cites W2085799273 @default.
- W2137716917 cites W2114493937 @default.
- W2137716917 cites W2117235989 @default.
- W2137716917 cites W2121180493 @default.
- W2137716917 cites W2137853741 @default.
- W2137716917 cites W2143987816 @default.
- W2137716917 cites W2155735286 @default.
- W2137716917 doi "https://doi.org/10.1109/sfcs.1998.743496" @default.
- W2137716917 hasPublicationYear "2002" @default.
- W2137716917 type Work @default.
- W2137716917 sameAs 2137716917 @default.
- W2137716917 citedByCount "32" @default.
- W2137716917 countsByYear W21377169172012 @default.
- W2137716917 countsByYear W21377169172014 @default.
- W2137716917 countsByYear W21377169172017 @default.
- W2137716917 countsByYear W21377169172019 @default.
- W2137716917 countsByYear W21377169172021 @default.
- W2137716917 countsByYear W21377169172022 @default.
- W2137716917 crossrefType "proceedings-article" @default.
- W2137716917 hasAuthorship W2137716917A5046140110 @default.
- W2137716917 hasAuthorship W2137716917A5071016611 @default.
- W2137716917 hasConcept C119599485 @default.
- W2137716917 hasConcept C127413603 @default.
- W2137716917 hasConcept C2779710594 @default.
- W2137716917 hasConcept C41008148 @default.
- W2137716917 hasConceptScore W2137716917C119599485 @default.
- W2137716917 hasConceptScore W2137716917C127413603 @default.
- W2137716917 hasConceptScore W2137716917C2779710594 @default.
- W2137716917 hasConceptScore W2137716917C41008148 @default.
- W2137716917 hasLocation W21377169171 @default.
- W2137716917 hasOpenAccess W2137716917 @default.
- W2137716917 hasPrimaryLocation W21377169171 @default.
- W2137716917 hasRelatedWork W1037426338 @default.
- W2137716917 hasRelatedWork W1610756803 @default.
- W2137716917 hasRelatedWork W2077401014 @default.
- W2137716917 hasRelatedWork W2352508079 @default.
- W2137716917 hasRelatedWork W2377291837 @default.
- W2137716917 hasRelatedWork W2607423055 @default.
- W2137716917 hasRelatedWork W2748952813 @default.
- W2137716917 hasRelatedWork W2899084033 @default.
- W2137716917 hasRelatedWork W4206729938 @default.
- W2137716917 hasRelatedWork W4248342377 @default.
- W2137716917 isParatext "false" @default.
- W2137716917 isRetracted "false" @default.
- W2137716917 magId "2137716917" @default.
- W2137716917 workType "article" @default.