淡江大學機構典藏:Item 987654321/21084
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62570/95226 (66%)
造访人次 : 2505676      在线人数 : 276
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/21084


    题名: A modified ant colony system for solving the travelling salesman problem with time windows
    作者: 鄭啟斌;Cheng, Chi-bin;Mao, Chun-Pin
    贡献者: 淡江大學資訊管理學系
    关键词: Ant colony optimization (ACO);Travelling salesman problem with time windows (TSPTW);Meta-heuristic;Nature-inspired algorithm
    日期: 2007-11
    上传时间: 2009-11-30 13:13:19 (UTC+8)
    出版者: Elsevier
    摘要: The travelling salesman problem with time windows (TSPTW) involves finding the minimum cost tour in which all cities are visited exactly once within their requested time windows. This problem has a number of important practical applications, including scheduling and routing. The problem is regarded as NP-complete, and hence traditional optimization algorithms are inefficient when applied to solve larger scale TSPTW problems. Consequently, the development of approximation algorithms has received considerable attention in recent years. Ant colony optimization (ACO), inspired by the foraging behaviour of real ants, is one of the most attractive approximation algorithms. Accordingly, this study develops a modified ant algorithm, named ACS-TSPTW, based on the ACO technique to solve the TSPTW. Two local heuristics are embedded in the ACS-TSPTW algorithm to manage the time-window constraints of the problem. The numerical results obtained for a series of benchmark problem instances confirm that the performance of the ACS-TSPTW is comparable to that of ACS-Time, an existing ACO scheme for solving the TSPTW problem.
    關聯: Mathematical and Computer Modelling 46(9-10), pp.1125-1135
    DOI: 10.1016/j.mcm.2006.11.035
    显示于类别:[資訊管理學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    A modified ant colony system for solving the travelling salesman problem with time windows.pdf264KbAdobe PDF0检视/开启
    index.html0KbHTML237检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈