English  |  正體中文  |  简体中文  |  Items with full text/Total items : 60899/93651 (65%)
Visitors : 1195592      Online Users : 27
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/21084

    Title: A modified ant colony system for solving the travelling salesman problem with time windows
    Authors: 鄭啟斌;Cheng, Chi-bin;Mao, Chun-Pin
    Contributors: 淡江大學資訊管理學系
    Keywords: Ant colony optimization (ACO);Travelling salesman problem with time windows (TSPTW);Meta-heuristic;Nature-inspired algorithm
    Date: 2007-11
    Issue Date: 2009-11-30 13:13:19 (UTC+8)
    Publisher: Elsevier
    Abstract: 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.
    Relation: Mathematical and Computer Modelling 46(9-10), pp.1125-1135
    DOI: 10.1016/j.mcm.2006.11.035
    Appears in Collections:[Graduate Institute & Department of Information Management] Journal Article

    Files in This Item:

    File Description SizeFormat
    A modified ant colony system for solving the travelling salesman problem with time windows.pdf264KbAdobe PDF0View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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