| Type of Material: | Thesis |
| Title: | Evolutionary techniques for permutation based problems |
| Researcher: | Srivastava, Gaurav. |
| Guide: | Alok Singh. |
| Department: | Department of Computer and Information Sciences |
| Publisher: | University of Hyderabad, Hyderabad |
| Place: | Hyderabad |
| Year: | 2022 |
| Language: | English |
| Subject: | Computer Science | Computer Science Theory and Methods | Engineering and Technology | Computer Science and Applications | Computer Science and Information Technology | Engineering and Technology |
| Dissertation/Thesis Note: | PhD; Department of Computer and Information Sciences , University of Hyderabad, Hyderabad, Hyderabad |
| Fulltext: | Shodhganga |
| 000 | 00000ntm a2200000ua 4500 | |
| 001 | 448625 | |
| 003 | IN-AhILN | |
| 005 | 2023-07-25 12:01:33 | |
| 008 | __ | 230725t2022||||ii#||||g|m||||||||||eng|| |
| 035 | __ | |a(IN-AhILN)th_448625 |
| 040 | __ | |aHYDR_500046|dIN-AhILN |
| 041 | __ | |aeng |
| 100 | __ | |aSrivastava, Gaurav.|eResearcher |
| 110 | __ | |aDepartment of Computer and Information Sciences|bUniversity of Hyderabad, Hyderabad|dHyderabad|ein |
| 245 | __ | |aEvolutionary techniques for permutation based problems |
| 260 | __ | |aHyderabad|bUniversity of Hyderabad, Hyderabad|c2022 |
| 300 | __ | |a219p|dNone |
| 502 | __ | |cDepartment of Computer and Information Sciences , University of Hyderabad, Hyderabad, Hyderabad|bPhD |
| 518 | __ | |d2022|oDate of Award |
| 518 | __ | |oDate of Registration|d2015 |
| 520 | __ | |aDuring the last several decades, the research field of combinatorial optimization hasnewlineattracted many researchers across various scientific fields owing to their practicalnewlineimportance in day to day life. The advancement of technology and acceleratednewlinecomputer evolution makes large-scale computation practical. Consequently, manynewlineindustries have started employing the state-of-the-art techniques available in the literaturenewlineof combinatorial optimization for efficiently solving their problems. Thesenewlineproblems include allocation of resources and more effective planning, scheduling,newlinemanufacturing, transportation and distribution. Permutation based combinatorialnewlineoptimization problems are a specific category of combinatorial optimization problems,newlinewhere the problem possess permutation characteristic. Many real worldnewlineproblems like routing, scheduling, networking, timetabling have permutation aspect.newlineSince many practical applications can be modeled as a per |
| 650 | __ | |aComputer Science and Applications|2UGC |
| 650 | __ | |aComputer Science and Information Technology|2UGC |
| 650 | __ | |2AIU|aEngineering and Technology |
| 653 | __ | |aComputer Science |
| 653 | __ | |aComputer Science Theory and Methods |
| 653 | __ | |aEngineering and Technology |
| 700 | __ | |eGuide|aAlok Singh. |
| 856 | __ | |uhttp://shodhganga.inflibnet.ac.in/handle/10603/415854|yShodhganga |
| 905 | __ | |afromsg |
User Feedback Comes Under This section.