Matches in SemOpenAlex for { <https://semopenalex.org/work/W2000770578> ?p ?o ?g. }
Showing items 1 to 76 of
76
with 100 items per page.
- W2000770578 endingPage "296" @default.
- W2000770578 startingPage "273" @default.
- W2000770578 abstract "We formulated realistic TSPs (CSTSP) in different uncertain environments.Operators of GA with new selection and crossover is developed.The modified GA is tested with different data sets from TSPLIB.Sensitivity analysis for uncertain CSTSPs, which are available here. In this paper, a Modified Genetic Algorithm (MGA) is developed to solve Constrained Solid Travelling Salesman Problems (CSTSPs) in crisp, fuzzy, random, random-fuzzy, fuzzy-random and bi-random environments. In the proposed MGA, for the first time, a new 'probabilistic selection' technique and a 'comparison crossover' are used along with conventional random mutation. A Solid Travelling Salesman Problem (STSP) is a Travelling Salesman Problem (TSP) in which, at each station, there are a number of conveyances available to travel to another station. Thus STSP is a generalization of classical TSP and CSTSP is a STSP with constraints. In CSTSP, along each route, there may be some risk/discomfort in reaching the destination and the salesman desires to have the total risk/discomfort for the entire tour less than a desired value. Here we model the CSTSP with traveling costs and route risk/discomfort factors as crisp, fuzzy, random, random-fuzzy, fuzzy-random and bi-random in nature. A number of benchmark problems from standard data set, TSPLIB are tested against the existing Genetic Algorithm (with Roulette Wheel Selection (RWS), cyclic crossover and random mutation) and the proposed algorithm and hence the efficiency of the new algorithm is established. In this paper, CSTSPs are illustrated numerically by some empirical data using this algorithm. In each environment, some sensitivity studies due to different risk/discomfort factors and other system parameters are presented." @default.
- W2000770578 created "2016-06-24" @default.
- W2000770578 creator A5037737561 @default.
- W2000770578 creator A5043058161 @default.
- W2000770578 creator A5055837502 @default.
- W2000770578 date "2015-05-01" @default.
- W2000770578 modified "2023-09-26" @default.
- W2000770578 title "A Modified Genetic Algorithm for solving uncertain Constrained Solid Travelling Salesman Problems" @default.
- W2000770578 cites W1986840051 @default.
- W2000770578 cites W1988695492 @default.
- W2000770578 cites W1997039203 @default.
- W2000770578 cites W2005434213 @default.
- W2000770578 cites W2014412090 @default.
- W2000770578 cites W2020737022 @default.
- W2000770578 cites W2024157478 @default.
- W2000770578 cites W2031673408 @default.
- W2000770578 cites W2034027189 @default.
- W2000770578 cites W2046996444 @default.
- W2000770578 cites W2049606892 @default.
- W2000770578 cites W2053994387 @default.
- W2000770578 cites W2078066200 @default.
- W2000770578 cites W2090481597 @default.
- W2000770578 cites W2120365438 @default.
- W2000770578 cites W2152195021 @default.
- W2000770578 cites W2171112637 @default.
- W2000770578 cites W25274176 @default.
- W2000770578 doi "https://doi.org/10.1016/j.cie.2015.02.023" @default.
- W2000770578 hasPublicationYear "2015" @default.
- W2000770578 type Work @default.
- W2000770578 sameAs 2000770578 @default.
- W2000770578 citedByCount "30" @default.
- W2000770578 countsByYear W20007705782015 @default.
- W2000770578 countsByYear W20007705782016 @default.
- W2000770578 countsByYear W20007705782017 @default.
- W2000770578 countsByYear W20007705782018 @default.
- W2000770578 countsByYear W20007705782019 @default.
- W2000770578 countsByYear W20007705782020 @default.
- W2000770578 countsByYear W20007705782021 @default.
- W2000770578 countsByYear W20007705782022 @default.
- W2000770578 countsByYear W20007705782023 @default.
- W2000770578 crossrefType "journal-article" @default.
- W2000770578 hasAuthorship W2000770578A5037737561 @default.
- W2000770578 hasAuthorship W2000770578A5043058161 @default.
- W2000770578 hasAuthorship W2000770578A5055837502 @default.
- W2000770578 hasConcept C11413529 @default.
- W2000770578 hasConcept C126255220 @default.
- W2000770578 hasConcept C175859090 @default.
- W2000770578 hasConcept C33923547 @default.
- W2000770578 hasConcept C41008148 @default.
- W2000770578 hasConcept C8880873 @default.
- W2000770578 hasConceptScore W2000770578C11413529 @default.
- W2000770578 hasConceptScore W2000770578C126255220 @default.
- W2000770578 hasConceptScore W2000770578C175859090 @default.
- W2000770578 hasConceptScore W2000770578C33923547 @default.
- W2000770578 hasConceptScore W2000770578C41008148 @default.
- W2000770578 hasConceptScore W2000770578C8880873 @default.
- W2000770578 hasLocation W20007705781 @default.
- W2000770578 hasOpenAccess W2000770578 @default.
- W2000770578 hasPrimaryLocation W20007705781 @default.
- W2000770578 hasRelatedWork W1484312685 @default.
- W2000770578 hasRelatedWork W163526353 @default.
- W2000770578 hasRelatedWork W2017766371 @default.
- W2000770578 hasRelatedWork W2082025713 @default.
- W2000770578 hasRelatedWork W2149877711 @default.
- W2000770578 hasRelatedWork W2253106201 @default.
- W2000770578 hasRelatedWork W2356976268 @default.
- W2000770578 hasRelatedWork W2366076337 @default.
- W2000770578 hasRelatedWork W2943946372 @default.
- W2000770578 hasRelatedWork W3094049162 @default.
- W2000770578 hasVolume "83" @default.
- W2000770578 isParatext "false" @default.
- W2000770578 isRetracted "false" @default.
- W2000770578 magId "2000770578" @default.
- W2000770578 workType "article" @default.