三起點迭代區域搜尋法求解兼具自有與委外之車輛路線問題

張雅婷

3.232.96.22，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

Humanities > Geography & Area Studies
College of Management > Department of Transportation & Logistics Management
Social Sciences > Management

Bibliography Management Tool

Related Links

Report an Issue

Purchase Single Articles

Download PDF

三起點迭代區域搜尋法求解兼具自有與委外之車輛路線問題

A Tri-Start Iterated Local Search Algorithm for the Vehicle Routing Problem with Private Fleet and Common Carrier

張雅婷 , Masters　　Advisor：韓復華　　

繁體中文

具自有與委外之車輛路線問題；迭代區域搜尋；隨機變動鄰域改善模組； VRPPC ； ILS ； RVND

Abstract │ Reference (26) │ Altmetrics

Abstract 〈TOP〉

Parallel Abstract 〈TOP〉

The Vehicle Routing Problem with Private Fleet and Common Carrier (VRPPC), which considers the best use of both owned fleet and outside logistics service provider, is an important issue for modern logistics operation. This paper applies an Iterated Local Search metaheuristic approach to solve the VRPPC. First, we simultaneously consider node-insertion, route-addition, and the common carrier assignment to construct our initial solutions. Both systematic and random procedures are adopted to form three sets of initial solution to increase the diversification of our search. Then we use a module of Randomized Variable Neighborhood Descent (RVND), which includes eight exchange neighborhoods, to intensify the improvement of the solutions. Finally, a perturbation mechanism is applied to further diversify our search of solution. We have coded our algorithms in C# and tested with all existing VRPPC instance sets. The results show that, out of 68 benchmark instances tested, we have found 38 best solutions including 32 new ones. The average deviation is 0.11%.

Reference ( 26 ) 〈TOP〉

[1] Bolduc, M. C., Renaud, J., & Boctor, F., "A heuristic for the routing and carrier selection problem", European Journal of Operational Research, Vol. 183, No.2, pp. 926-932, 2007.
[2] Bolduc, M. C., Renaud, J., Boctor, F., & Laporte, G., "A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers", Journal of Operations Research Societies, Vol. 59, No. 6, pp. 776-787, 2008.
[3] Bräysy, O., Hasle, G., & Dullaert, W., "A multi-start local search algorithm for the vehicle routing problem with time windows". European Journal of Operational Research, Vol. 159, No.3, pp. 586-605, 2004.
[4] Christofides, N., & Eilon, S., "An algorithm for the vehicle-dispatching problem", Journal of the Operational Research Society, Vol. 20, No. 3, pp. 309-318, 1969.
[5] Chu, C.-W., "A heuristic algorithm for the truckload and less-than-truckload problem", European Journal of Operational Research, Vol. 165, No.3, pp. 657-667, 2005.

Altmetrics

〈TOP〉

E-mail ：

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

E-mail ：