Matches in SemOpenAlex for { <https://semopenalex.org/work/W2116691041> ?p ?o ?g. }
Showing items 1 to 92 of
92
with 100 items per page.
- W2116691041 abstract "Vehicle routing problems involve the navigation of one or more vehicles through a network of locations. Locations have associated handling times as well as time windows during which they are active. The arcs connecting locations have time costs associated with them. In this paper, we consider two different problems in single vehicle routing. The first is to find least time cost routes between all pairs of nodes in a network for navigating vehicles; we call this the all pairs routing problem. We show that there is an O(log/sup 2/ n) time parallel algorithm using a polynomial number of processors for this problem on a CREW PRAM. We next consider the problem in which a vehicle services all locations in a network. Here, locations can be passed through at any time but only serviced during their time window. The general problem is NP-complete under even fairly stringent restrictions but polynomial algorithms have been developed for some special cases. In particular, when the network is a line, there is no time cost in servicing a location, and all time windows are unbounded at either their lower or upper end, O(n/sup 2/) algorithms have been developed. We show that under the same conditions, we can reduce this problem to the all pairs routing problem and therefore obtain an O(log/sup 2/ n) time parallel algorithm on a CREW PRAM." @default.
- W2116691041 created "2016-06-24" @default.
- W2116691041 creator A5014255932 @default.
- W2116691041 creator A5041186798 @default.
- W2116691041 date "2002-11-22" @default.
- W2116691041 modified "2023-09-27" @default.
- W2116691041 title "Parallel algorithms for vehicle routing problems" @default.
- W2116691041 cites W1584086289 @default.
- W2116691041 cites W1985351788 @default.
- W2116691041 cites W1995284651 @default.
- W2116691041 cites W2003969379 @default.
- W2116691041 cites W2004618348 @default.
- W2116691041 cites W2007572995 @default.
- W2116691041 cites W2013444956 @default.
- W2116691041 cites W2017205387 @default.
- W2116691041 cites W2072400378 @default.
- W2116691041 cites W2091020754 @default.
- W2116691041 cites W2093952957 @default.
- W2116691041 cites W2096305430 @default.
- W2116691041 cites W2104734478 @default.
- W2116691041 cites W2126598061 @default.
- W2116691041 cites W2169528473 @default.
- W2116691041 cites W2482946351 @default.
- W2116691041 cites W2611491551 @default.
- W2116691041 cites W3023776523 @default.
- W2116691041 cites W36175553 @default.
- W2116691041 cites W36531276 @default.
- W2116691041 doi "https://doi.org/10.1109/hipc.1997.634485" @default.
- W2116691041 hasPublicationYear "2002" @default.
- W2116691041 type Work @default.
- W2116691041 sameAs 2116691041 @default.
- W2116691041 citedByCount "2" @default.
- W2116691041 crossrefType "proceedings-article" @default.
- W2116691041 hasAuthorship W2116691041A5014255932 @default.
- W2116691041 hasAuthorship W2116691041A5041186798 @default.
- W2116691041 hasConcept C104954878 @default.
- W2116691041 hasConcept C11413529 @default.
- W2116691041 hasConcept C120373497 @default.
- W2116691041 hasConcept C123784306 @default.
- W2116691041 hasConcept C127413603 @default.
- W2116691041 hasConcept C178802073 @default.
- W2116691041 hasConcept C184896649 @default.
- W2116691041 hasConcept C204948658 @default.
- W2116691041 hasConcept C2780179797 @default.
- W2116691041 hasConcept C29436982 @default.
- W2116691041 hasConcept C311688 @default.
- W2116691041 hasConcept C31258907 @default.
- W2116691041 hasConcept C41008148 @default.
- W2116691041 hasConcept C74172769 @default.
- W2116691041 hasConcept C89305328 @default.
- W2116691041 hasConceptScore W2116691041C104954878 @default.
- W2116691041 hasConceptScore W2116691041C11413529 @default.
- W2116691041 hasConceptScore W2116691041C120373497 @default.
- W2116691041 hasConceptScore W2116691041C123784306 @default.
- W2116691041 hasConceptScore W2116691041C127413603 @default.
- W2116691041 hasConceptScore W2116691041C178802073 @default.
- W2116691041 hasConceptScore W2116691041C184896649 @default.
- W2116691041 hasConceptScore W2116691041C204948658 @default.
- W2116691041 hasConceptScore W2116691041C2780179797 @default.
- W2116691041 hasConceptScore W2116691041C29436982 @default.
- W2116691041 hasConceptScore W2116691041C311688 @default.
- W2116691041 hasConceptScore W2116691041C31258907 @default.
- W2116691041 hasConceptScore W2116691041C41008148 @default.
- W2116691041 hasConceptScore W2116691041C74172769 @default.
- W2116691041 hasConceptScore W2116691041C89305328 @default.
- W2116691041 hasLocation W21166910411 @default.
- W2116691041 hasOpenAccess W2116691041 @default.
- W2116691041 hasPrimaryLocation W21166910411 @default.
- W2116691041 hasRelatedWork W1522202305 @default.
- W2116691041 hasRelatedWork W1719807543 @default.
- W2116691041 hasRelatedWork W1968312484 @default.
- W2116691041 hasRelatedWork W1971663816 @default.
- W2116691041 hasRelatedWork W1980439942 @default.
- W2116691041 hasRelatedWork W1994886879 @default.
- W2116691041 hasRelatedWork W1999114241 @default.
- W2116691041 hasRelatedWork W2027821714 @default.
- W2116691041 hasRelatedWork W2034127391 @default.
- W2116691041 hasRelatedWork W2042434603 @default.
- W2116691041 hasRelatedWork W2079018846 @default.
- W2116691041 hasRelatedWork W2104873563 @default.
- W2116691041 hasRelatedWork W2141024174 @default.
- W2116691041 hasRelatedWork W2147555712 @default.
- W2116691041 hasRelatedWork W2158052609 @default.
- W2116691041 hasRelatedWork W2158862942 @default.
- W2116691041 hasRelatedWork W2163959462 @default.
- W2116691041 hasRelatedWork W3015297446 @default.
- W2116691041 hasRelatedWork W3127054082 @default.
- W2116691041 hasRelatedWork W2114419955 @default.
- W2116691041 isParatext "false" @default.
- W2116691041 isRetracted "false" @default.
- W2116691041 magId "2116691041" @default.
- W2116691041 workType "article" @default.