BG
RU
|
Scientific paper ID 1151 : 2015/3
SOLVING THE TRAVELLING SALESMAN PROBLEMIN URBAN AREAWITHTHE SITE FOR ROAD ROUTE PLANNER FOR MULTIPLE LOCATIONS
Teodor Berov Traveling salesman problemin urban areas and approachto solve it through the use of real distances and travel time between the points is presented in this article.The use ofthe site for road route planner for multiple locations, using the Google Maps API, is proposed. Algorithms for introduction and solution the TSP for two sites (Route XL and OptiMap) are referred. Through this approach is solved a practical example for city Sofia and the obtained results are shown.
транспорт автомобиленградски проблем на транспортния пътникGooglemapsurbantransport freight traveling salesman problemGoogle mapsTeodor Berov BIBLIOGRAPHY [1] Karagyozov K., Berov T., „Prilozhenie na imperialisticheski konkurenten algoritam za optimizirane marshrutizatsiyata na prevoznite sredstva“, Mehanika, transport, komunikatsii, ISSN 1312-3823, tom 12, br. 3(1), 2014, str. 63-68 ( [1] Карагьозов K., Беров Т., „Приложение на империалистически конкурентен алгоритъм за оптимизиране маршрутизацията на превозните средства“, Механика, транспорт, комуникации, ISSN 1312-3823, том 12, бр. 3(1), 2014, стр. 63-68 ) [2] Google Maps Javascript API v3: [sayt] URL: https://developers.google.com/maps/document... ( [сайт] URL: https://developers.google.com/maps/document... ) [3] http://www.gebweb.net/optimap/ [4] http://www.routexl.com |
