Matches in SemOpenAlex for { <https://semopenalex.org/work/W4313227030> ?p ?o ?g. }
Showing items 1 to 79 of
79
with 100 items per page.
- W4313227030 abstract "A crucial subset of transportation problems, known as time minimization transportation problems (TMTP), deals with the supply of products or services urgently or as soon as possible to the terminal points to meet the resource efficiency. The required origin-destination solution pairs have been identified using analytical or precise approaches. However, when the dimension grew, the problems of transport systems turned into NP Hard ones that required the use of alternate methods to solve. The Particle Swarm Optimization (PSO) algorithm, a meta-heuristic technique that has been used to solve a variety of practical optimization problems, making efficient use of resources, wasbrought to the forefront in this expedition (continuous solution space). However, PSO has been packaged with various encoding- decoding techniques to discretize the solution space. In this paper,authors proposed a modified PSO to solve three level TMTPwherein the path from origin to terminal points have been sub- divided into three levels as per need of the problem of transport enterprises and objectively total time is minimized. The proposedtechnique was found to be a superior alternative to existing techniques for making logistical decisions. The proposed PSO's exhaustive search prowess has been demonstrated with regard to alternative optimum solutions independent of the number and/orposition of allocations <tex xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>$(m+n 1)$</tex> while traversing towards global optima. This illustrates how discrete combinatorial optimization problems might benefit from Particle Swarm Optimization." @default.
- W4313227030 created "2023-01-06" @default.
- W4313227030 creator A5078280638 @default.
- W4313227030 creator A5087092521 @default.
- W4313227030 date "2022-10-10" @default.
- W4313227030 modified "2023-09-27" @default.
- W4313227030 title "Soft Computing Approach for Three-Level Time Minimization Transportation Problem" @default.
- W4313227030 cites W1578717571 @default.
- W4313227030 cites W1969518543 @default.
- W4313227030 cites W1970848641 @default.
- W4313227030 cites W1989840685 @default.
- W4313227030 cites W2011609932 @default.
- W4313227030 cites W2013613229 @default.
- W4313227030 cites W2019842383 @default.
- W4313227030 cites W2032087379 @default.
- W4313227030 cites W2038674442 @default.
- W4313227030 cites W2047264521 @default.
- W4313227030 cites W2094840011 @default.
- W4313227030 cites W2109364787 @default.
- W4313227030 cites W2346416847 @default.
- W4313227030 cites W241730991 @default.
- W4313227030 cites W2573137292 @default.
- W4313227030 cites W2790492663 @default.
- W4313227030 cites W2996143517 @default.
- W4313227030 cites W3010647446 @default.
- W4313227030 cites W4249155853 @default.
- W4313227030 doi "https://doi.org/10.1109/ictacs56270.2022.9988352" @default.
- W4313227030 hasPublicationYear "2022" @default.
- W4313227030 type Work @default.
- W4313227030 citedByCount "0" @default.
- W4313227030 crossrefType "proceedings-article" @default.
- W4313227030 hasAuthorship W4313227030A5078280638 @default.
- W4313227030 hasAuthorship W4313227030A5087092521 @default.
- W4313227030 hasConcept C126255220 @default.
- W4313227030 hasConcept C13280743 @default.
- W4313227030 hasConcept C134306372 @default.
- W4313227030 hasConcept C137836250 @default.
- W4313227030 hasConcept C147764199 @default.
- W4313227030 hasConcept C153782549 @default.
- W4313227030 hasConcept C173801870 @default.
- W4313227030 hasConcept C176809094 @default.
- W4313227030 hasConcept C202444582 @default.
- W4313227030 hasConcept C205649164 @default.
- W4313227030 hasConcept C31829261 @default.
- W4313227030 hasConcept C33676613 @default.
- W4313227030 hasConcept C33923547 @default.
- W4313227030 hasConcept C41008148 @default.
- W4313227030 hasConcept C85617194 @default.
- W4313227030 hasConceptScore W4313227030C126255220 @default.
- W4313227030 hasConceptScore W4313227030C13280743 @default.
- W4313227030 hasConceptScore W4313227030C134306372 @default.
- W4313227030 hasConceptScore W4313227030C137836250 @default.
- W4313227030 hasConceptScore W4313227030C147764199 @default.
- W4313227030 hasConceptScore W4313227030C153782549 @default.
- W4313227030 hasConceptScore W4313227030C173801870 @default.
- W4313227030 hasConceptScore W4313227030C176809094 @default.
- W4313227030 hasConceptScore W4313227030C202444582 @default.
- W4313227030 hasConceptScore W4313227030C205649164 @default.
- W4313227030 hasConceptScore W4313227030C31829261 @default.
- W4313227030 hasConceptScore W4313227030C33676613 @default.
- W4313227030 hasConceptScore W4313227030C33923547 @default.
- W4313227030 hasConceptScore W4313227030C41008148 @default.
- W4313227030 hasConceptScore W4313227030C85617194 @default.
- W4313227030 hasLocation W43132270301 @default.
- W4313227030 hasOpenAccess W4313227030 @default.
- W4313227030 hasPrimaryLocation W43132270301 @default.
- W4313227030 hasRelatedWork W1979322129 @default.
- W4313227030 hasRelatedWork W2003222667 @default.
- W4313227030 hasRelatedWork W2102695450 @default.
- W4313227030 hasRelatedWork W2170286667 @default.
- W4313227030 hasRelatedWork W2738182708 @default.
- W4313227030 hasRelatedWork W2996902212 @default.
- W4313227030 hasRelatedWork W4206151884 @default.
- W4313227030 hasRelatedWork W4307685729 @default.
- W4313227030 hasRelatedWork W4313227030 @default.
- W4313227030 hasRelatedWork W2184499500 @default.
- W4313227030 isParatext "false" @default.
- W4313227030 isRetracted "false" @default.
- W4313227030 workType "article" @default.