Article ID: | iaor201527499 |
Volume: | 88 |
Issue: | 4 |
Start Page Number: | 229 |
End Page Number: | 236 |
Publication Date: | Oct 2015 |
Journal: | Computers & Industrial Engineering |
Authors: | Maiti Manoranjan, Maiti Manas Kumar, Khanra Aditi |
Keywords: | combinatorial optimization, heuristics, heuristics: ant systems |
Here a new model of Traveling Salesman Problem (TSP) with uncertain parameters is formulated and solved using a hybrid algorithm. For this TSP, there are some fixed number of cities and the costs and time durations for traveling from one city to another are known. Here a Traveling Salesman (TS) visits and spends some time in each city for selling the company’s product. The return and expenditure at each city are dependent on the time spent by the TS at that city and these are given in functional forms of