| Type of Material: | Thesis |
| Title: | Unified heuristics for a class of complex and practical routing problems in logistics |
| Researcher: | Anbuudayasankar, S P |
| Guide: | Mohandas K, Ganesh K |
| Department: | Dept. of Mechanical Engineering |
| Publisher: | Amrita Vishwa Vidyapeetham (University) |
| Place: | Coimbatore |
| Year: | 2011 |
| Language: | English |
| Subject: | Heuristics construction | Travelling salesman problem | Vehicle routing problem | Simulated annealing | Genetic algorithm | Heuristics |
| Dissertation/Thesis Note: | PhD |
| Fulltext: | Shodhganga |
| 000 | 00000ntm a2200000ua 4500 | |
| 001 | 256965 | |
| 003 | IN-AhILN | |
| 005 | 2013-12-04 10:31:27 | |
| 008 | __ | 110823t2011||||ii#||||g|m||||||||||eng|| |
| 035 | __ | |a(IN-AhILN)th_256965 |
| 040 | __ | |aAVVP_641112|dIN-AhILN |
| 041 | __ | |aeng |
| 100 | __ | |aAnbuudayasankar, S P|eResearcher |
| 110 | __ | |aDept. of Mechanical Engineering|bAmrita Vishwa Vidyapeetham (University)|dCoimbatore |
| 245 | __ | |aUnified heuristics for a class of complex and practical routing problems in logistics |
| 260 | __ | |aCoimbatore|bAmrita Vishwa Vidyapeetham (University)|c2011 |
| 502 | __ | |bPhD |
| 518 | __ | |oDate of Notification|d2011 |
| 520 | __ | |aTravelling Salesmen Problem (TSP) and Vehicle Routing Problem (VRP) are areas which have been widely dealt with in the last four decades. Methodologies were developed for many variants of the TSP and VRP by different researchers. This study considers ye |
| 653 | __ | |aHeuristics construction |
| 653 | __ | |aTravelling salesman problem |
| 653 | __ | |aVehicle routing problem |
| 653 | __ | |aSimulated annealing |
| 653 | __ | |aGenetic algorithm |
| 653 | __ | |aHeuristics |
| 700 | __ | |aMohandas K, Ganesh K|eGuide |
| 856 | __ | |uhttp://shodhganga.inflibnet.ac.in/handle/10603/2358|yShodhganga |
| 905 | __ | |anotification |
User Feedback Comes Under This section.