利用多軌跡搜尋法解多重目標時窗限制派車問題

黃威誠

34.239.150.57，Hello！

Close
Search Quick Search Advanced Search Publication Search	Personal Service Member Login Searching History Use Bonus Card SYMSKAN
Browse Browse by University of Graduate Thesis Browse by Pinyin of Graduate Thesis Browse by Conference Proceedings Topic Browse by Conference Proceedings Publisher Browse by Pinyin of Conference Proceedings Browse by eBook Category Browse by eBook Topic Browse by eBook Publisher
Customer Services Authorize Airiti Recommend a Journal

Search Symbol (Half-width)	Description of Search Symbols
Space	"AND" indicates the intertwining of key terms used in a search
Double Quotation Marks ("") ( " " )	Double quotation marks indicate the beginning and end of a phrase, and the search will only include terms that appear in the same order of those within the quotations. Example: "image process" ： " image process "
?	Indicates a variable letter. Entering two ? will indicate two variable letters, and so on. Example: "Appl?", search results will yield apple, apply… e , appl y … ( (often used to English word searches) )
*	Indicates an unlimited number of variable letters to follow, from 1~n. Example: Enter "appl*", search results will yield apple, apples, apply, applied, application…(often used in English word searches) e , appl es , appl y , appl ied , appl ication … ( (often used to English word searches) )
AND、OR、NOT	Boolean logic combinations of key words is a skill used to expand or refine search parameters. (1) AND (1) AND: Refines search parameters (2) OR (2) OR: Expands search parameters (3) NOT: Excludes irrelevant parameters

DOI stands for Digital Object Identifier （ D igital O bject I dentifier ） ,
and is the unique identifier for objects on the internet. It can be used to create persistent link and to cite articles.

Using DOI as a persistent link

To create a persistent link, add「http://dx.doi.org/」「 http://dx.doi.org/ 」 before a DOI.
For instance, if the DOI of an article is 10.5297/ser.1201.002 , you can link persistently to the article by entering the following link in your browser: http://dx.doi.org/ 10.5297/ser.1201.002 。
The DOI link will always direct you to the most updated article page no matter how the publisher changes the document's position, avoiding errors when engaging in important research.

Cite a document with DOI

When citing references, you should also cite the DOI if the article has one. If your citation guideline does not include DOIs, you may cite the DOI link.

DOIs allow accurate citations, improve academic contents connections, and allow users to gain better experience across different platforms. Currently, there are more than 70 million DOIs registered for academic contents. If you want to understand more about DOI, please visit airiti DOI Registration （ doi.airiti.com ）。

Data Source

Basic & Applied Sciences > Information Science
College of Electrical Engineering & Computer Science > Department of Computer Science and Engineering

Bibliography Management Tool

Related Links

Report an Issue

Search in Library

There is no full-text available at the moment. Airiti would like to request author's authorization. I would like to provide authorization.

利用多軌跡搜尋法解多重目標時窗限制派車問題

Multiple Trajectory Search for Multi-objective Vehicle Routing Problem with Time Windows

黃威誠 , Masters　　Advisor：曾怜玉　　

繁體中文

基因演算法；區域搜尋演算法；多軌跡搜尋法；時窗限制派車問題； genetic algorithm ； local search algorithms ； multiple trajectory search ； vehicle routing problem with time windows

Abstract │ Reference (29) │ Altmetrics

Abstract 〈TOP〉

Parallel Abstract 〈TOP〉

The vehicle routing problem with time windows is an NP-hard problem. When the scale of the problem is large, it is very difficult to find the optimal solution within limited time. Therefore, meta-heuristic algorithms are good candidate for solving this problem. This problem has applications in logistics and transportation. Also it has the characteristic of the multiple objectives.

In this thesis, we propose a framework that hybridizes genetic algorithm, local search algorithms and multiple trajectory search to solve the vehicle routing problem. We aim to minimize the number of cars and the distance of all routes. The proposed algorithm operates in two phases. On the first phase, it searches the solution space globally and tries to find solutions that have minimum number of cars. Then, in the second phase, it searches more thoroughly the neighborhoods of the good solutions obtained in the first phase by applying several local search methods.

Finally, the proposed algorithm was applied to solve Solomon’s 56 VRPTW 100-customers instances. The experimental results were compared with the results of previously published studies. The comparison shows that our approach has very good performance in some of the instances.

Reference ( 29 ) 〈TOP〉

[1] G.B. Alvarenga, G.R. Mateus and G. de Tomi, “A Genetic and Set Partitioning Two-phase Approach for the Vehicle Routing Problem with Time Windows, ”Computer & Operations Research, vol. 34, pp. 1561-1584, 2007.
連結：
[2] R. Bent and P.V. Hentenryck, “A Two-stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows, ”Transportation Science, vol. 38, pp. 515-530, 2001.
連結：
[3] J. Berger and M. Barkaoui, “A Parallel Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows, ”Computer & Operations Research, vol. 31, pp. 2037-2053, 2004.
連結：
[4] J.F. Cordeau, G. Larporte and A. Mercier, “A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows, ”Journal of the Operational Research Society, vol. 52, pp. 928-936, 2001.
連結：
[5] Z.J. Czech, “Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows, ” in Parallel, Distributed and Network-based Processing, Proceedings. 10th Euromicro Workshop on, pp. 376-383, 2002.
連結：

Altmetrics

〈TOP〉

E-mail ：

When an article is available to download, a notice will be sent to your mailbox address.

E-mail ：