Damithabandara. Operations Research and Applications : An International Journal (ORAJ), 4 (3/4):
11(November 2017)
Abstract
ABC Appliances (Pvt) Ltd.,one of the leading companies in Sri Lanka has supplied and installed a very large number of air condition units all over the country. The company is currently provides a comprehensive after sales service for its customers. At present the service department is interesting in reducing the cost involving in regular after sale servicers. In this research we proposed a Travelling Salesman Problem (TSP) approach tominimize the cost involving in service tours. We used nearest neighbourhood search algorithm to obtain the solutions to the TSP. Computational examples show that the new service routes obtained using this algorithm will reduce the travelling cost significantly in comparison to existing routs.
%0 Journal Article
%1 noauthororeditor
%A Damithabandara,
%D 2017
%J Operations Research and Applications : An International Journal (ORAJ)
%K Algorithm Greedy
%N 3/4
%P 11
%T AN APPLICATION TO THE TRAVELLING SALESMAN
PROBLEM
%U http://airccse.com/oraj/papers/4417oraj02.pdf
%V 4
%X ABC Appliances (Pvt) Ltd.,one of the leading companies in Sri Lanka has supplied and installed a very large number of air condition units all over the country. The company is currently provides a comprehensive after sales service for its customers. At present the service department is interesting in reducing the cost involving in regular after sale servicers. In this research we proposed a Travelling Salesman Problem (TSP) approach tominimize the cost involving in service tours. We used nearest neighbourhood search algorithm to obtain the solutions to the TSP. Computational examples show that the new service routes obtained using this algorithm will reduce the travelling cost significantly in comparison to existing routs.
@article{noauthororeditor,
abstract = {ABC Appliances (Pvt) Ltd.,one of the leading companies in Sri Lanka has supplied and installed a very large number of air condition units all over the country. The company is currently provides a comprehensive after sales service for its customers. At present the service department is interesting in reducing the cost involving in regular after sale servicers. In this research we proposed a Travelling Salesman Problem (TSP) approach tominimize the cost involving in service tours. We used nearest neighbourhood search algorithm to obtain the solutions to the TSP. Computational examples show that the new service routes obtained using this algorithm will reduce the travelling cost significantly in comparison to existing routs.},
added-at = {2017-12-04T06:50:22.000+0100},
author = {Damithabandara},
biburl = {https://www.bibsonomy.org/bibtex/2adba12defdb11056a58a0b6332bbfd8c/oraj},
interhash = {242e299b212b193777ac4c6c24a07e12},
intrahash = {adba12defdb11056a58a0b6332bbfd8c},
journal = {Operations Research and Applications : An International Journal (ORAJ)},
keywords = {Algorithm Greedy},
month = {November},
number = {3/4},
pages = 11,
timestamp = {2017-12-04T06:50:22.000+0100},
title = {AN APPLICATION TO THE TRAVELLING SALESMAN
PROBLEM
},
url = {http://airccse.com/oraj/papers/4417oraj02.pdf},
volume = 4,
year = 2017
}