English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26999/38800
Visitors : 2400145      Online Users : 70
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/26131

Title: 硬性時窗限制之多車種車輛途程問題
Mixed Vehicle Routing Problem with Hard Time Window Constraints
Authors: 鄭超元;朱經武;簡振杰;楊光宗
Contributors: NTOU:Department of Shipping and Transportation Management
國立臺灣海洋大學:航運管理學系
Keywords: 車輛途程問題;硬性時窗;啟發式演算法
Vehicle routing problem;Hard time window constraint;Heuristic algorithm
Date: 2004-09
Issue Date: 2011-10-20T08:33:52Z
Publisher: 聖約翰學報
Relation: 21, pp.233-244
URI: http://ntour.ntou.edu.tw/handle/987654321/26131
Appears in Collections:[航運管理學系] 期刊論文

Files in This Item:

There are no files associated with this item.



All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback