文献知网节

A Development of Travel Itinerary Planning Application using Traveling Salesman Problem and K-Means Clustering Approach

Septia RaniKartika Nur KholidahSheila Nurul Huda

Department of Informatics, Universitas Islam Indonesia

摘要:In this paper, an algorithm for making travel itinerary using traveling salesman problem(TSP) and k-means clustering technique is proposed. We employ the algorithm to develop a web based application that can help travelers to plan their travel itinerary. The developed application should be able to provide an optimal itinerary recommendation in terms of distance and travel time. We use initial assumption that the traveler has determined all the tourist destinations he/she wants to visit and also the number of days he/she will stay in the region. Our approach consists of two steps, macro grouping using k-means and micro tour arrangement using TSP. Yogyakarta city, one of the tourist city in Indonesia, is used as an example to illustrate how the proposed algorithm can help travelers make their itinerary. This approach works well in small to medium number points of interest. However, the application still need many improvements such as to make it run faster and to handle the additional constraints that exist when creating an itinerary.
会议名称:

2018年第七届软件与计算机应用国际会议

会议时间:

2018-02-08

会议地点:

马来西亚关丹

  • 专辑:

    信息科技; 经济与管理科学

  • 专题:

    互联网技术; 自动化技术; 旅游

  • DOI:

    10.26914/c.cnkihy.2018.009595

  • 分类号:

    F591;TP393.09;TP18

  • 手机阅读
    即刻使用手机阅读
    第一步

    扫描二维码下载

    "移动知网-全球学术快报"客户端

    第二步

    打开“全球学术快报”

    点击首页左上角的扫描图标

    第三步

    扫描二维码

    手机同步阅读本篇文献

  • HTML阅读
  • CAJ下载
  • PDF下载

下载手机APP用APP扫此码同步阅读该篇文章

温馨提示:阅读CAJ格式原文,请使用CAJ浏览器

下载:4 页码:328-332 页数:5 大小:1259k

引文网络
  • 参考文献
  • 引证文献
  • 共引文献
  • 同被引文献
  • 二级参考文献
  • 二级引证文献
相关推荐
  • 相似文献
  • 读者推荐
  • 相关基金文献
  • 相关法规
  • 关联作者
  • 相关视频