Matches in SemOpenAlex for { <https://semopenalex.org/work/W3040741837> ?p ?o ?g. }
Showing items 1 to 77 of
77
with 100 items per page.
- W3040741837 endingPage "012227" @default.
- W3040741837 startingPage "012227" @default.
- W3040741837 abstract "Urban waste classification and recycling is an important research node in people's livelihood, which is related to the corresponding relationship between efficiency and quality. The optimization of the recycling transportation path means that the cost is less. In the process of garbage transportation classification and recycling, optimizing and merging the routes of garbage transportation based on Dijkstra's algorithm can optimize the shared transportation resources, to achieve the result of saving operating costs. The immediate transportation recycling event is planned as the path planning optimization. Multi-source multi-object and multi-path planning problems, and rehearse the optimization model of the total length of the transport path set without repeated paths. When the scale of the transportation and recovery network grows to a set value, it is difficult to achieve a theoretical solution by accurately calculating the optimal value of the model through an optimization algorithm. An optimal path set selection algorithm based on a random walk is feasible. The effectiveness and operability of the method are verified by small experiments and simulation experiments. The path is the shortest, and compared with the summation algorithm, it not only has high accuracy, but also has high execution efficiency." @default.
- W3040741837 created "2020-07-16" @default.
- W3040741837 creator A5036752525 @default.
- W3040741837 creator A5038656455 @default.
- W3040741837 creator A5065867178 @default.
- W3040741837 creator A5066373238 @default.
- W3040741837 creator A5081326654 @default.
- W3040741837 creator A5087681190 @default.
- W3040741837 date "2020-07-08" @default.
- W3040741837 modified "2023-09-25" @default.
- W3040741837 title "Transport Waste Separation and Recovery Trajectory Judged Based on Dijkstra’s Algorithm" @default.
- W3040741837 cites W1980835533 @default.
- W3040741837 doi "https://doi.org/10.1088/1755-1315/526/1/012227" @default.
- W3040741837 hasPublicationYear "2020" @default.
- W3040741837 type Work @default.
- W3040741837 sameAs 3040741837 @default.
- W3040741837 citedByCount "0" @default.
- W3040741837 crossrefType "journal-article" @default.
- W3040741837 hasAuthorship W3040741837A5036752525 @default.
- W3040741837 hasAuthorship W3040741837A5038656455 @default.
- W3040741837 hasAuthorship W3040741837A5065867178 @default.
- W3040741837 hasAuthorship W3040741837A5066373238 @default.
- W3040741837 hasAuthorship W3040741837A5081326654 @default.
- W3040741837 hasAuthorship W3040741837A5087681190 @default.
- W3040741837 hasBestOaLocation W30407418371 @default.
- W3040741837 hasConcept C111919701 @default.
- W3040741837 hasConcept C11413529 @default.
- W3040741837 hasConcept C115903868 @default.
- W3040741837 hasConcept C126231374 @default.
- W3040741837 hasConcept C126255220 @default.
- W3040741837 hasConcept C132525143 @default.
- W3040741837 hasConcept C173870130 @default.
- W3040741837 hasConcept C177264268 @default.
- W3040741837 hasConcept C199360897 @default.
- W3040741837 hasConcept C22590252 @default.
- W3040741837 hasConcept C2777735758 @default.
- W3040741837 hasConcept C33923547 @default.
- W3040741837 hasConcept C41008148 @default.
- W3040741837 hasConcept C75403996 @default.
- W3040741837 hasConcept C80444323 @default.
- W3040741837 hasConcept C98045186 @default.
- W3040741837 hasConceptScore W3040741837C111919701 @default.
- W3040741837 hasConceptScore W3040741837C11413529 @default.
- W3040741837 hasConceptScore W3040741837C115903868 @default.
- W3040741837 hasConceptScore W3040741837C126231374 @default.
- W3040741837 hasConceptScore W3040741837C126255220 @default.
- W3040741837 hasConceptScore W3040741837C132525143 @default.
- W3040741837 hasConceptScore W3040741837C173870130 @default.
- W3040741837 hasConceptScore W3040741837C177264268 @default.
- W3040741837 hasConceptScore W3040741837C199360897 @default.
- W3040741837 hasConceptScore W3040741837C22590252 @default.
- W3040741837 hasConceptScore W3040741837C2777735758 @default.
- W3040741837 hasConceptScore W3040741837C33923547 @default.
- W3040741837 hasConceptScore W3040741837C41008148 @default.
- W3040741837 hasConceptScore W3040741837C75403996 @default.
- W3040741837 hasConceptScore W3040741837C80444323 @default.
- W3040741837 hasConceptScore W3040741837C98045186 @default.
- W3040741837 hasLocation W30407418371 @default.
- W3040741837 hasOpenAccess W3040741837 @default.
- W3040741837 hasPrimaryLocation W30407418371 @default.
- W3040741837 hasRelatedWork W2008652244 @default.
- W3040741837 hasRelatedWork W2056754788 @default.
- W3040741837 hasRelatedWork W2354605212 @default.
- W3040741837 hasRelatedWork W2374583081 @default.
- W3040741837 hasRelatedWork W2376231728 @default.
- W3040741837 hasRelatedWork W2384089948 @default.
- W3040741837 hasRelatedWork W2386835479 @default.
- W3040741837 hasRelatedWork W2393830392 @default.
- W3040741837 hasRelatedWork W3183360588 @default.
- W3040741837 hasRelatedWork W4229964315 @default.
- W3040741837 hasVolume "526" @default.
- W3040741837 isParatext "false" @default.
- W3040741837 isRetracted "false" @default.
- W3040741837 magId "3040741837" @default.
- W3040741837 workType "article" @default.