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


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncut.edu.tw/handle/987654321/6892


    题名: Vehicle Routing Problem Application in Tour Planning Multimedia System with Metaheuristic Designed
    作者: 王圳木
    贡献者: 資訊工程系
    日期: 2011-03
    上传时间: 2017-12-17 13:56:49 (UTC+8)
    摘要: This work suggests an adaptive tour planning multimedia system designed to meet the tour routing needs of different tourists. Tour planning is an application of vehicle routing problem. Meanwhile, vehicle routing problem is a 'traveling salesman problem' (TSP) type problem. TSP is an example of a combinatorial optimization problem and is known as NP-hard. As studied by many researchers exact, heuristic (approximation) and meta-heuristic algorithms are usually applied for NP problems. A promising meta-heuristic algorithm is proposed to solve the tour routing problems which involves minimization of total traveling time, total travel expenses or the combined total traveling time and expenses. Moreover, a simple exchange local search heuristic is also applied to increase the exploitation (intensification) competence of the scheme. Restated, finding out the optimal planned tour routes using particle swarm optimization (PSO) and increasing performance by exchange heuristic scheme is suggested. Simulation results indicate the PSO with exchange heuristic designed provides a promising strategy, and is efficient for solving tour routing problems. (27 refs)
    關聯: Int. J of electrical Engineering
    显示于类别:[資訊工程系(所)] 【資訊工程系所】期刊論文

    文件中的档案:

    没有与此文件相关的档案.



    在NCUTIR中所有的数据项都受到原著作权保护.


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