時間相依且軟性時窗限制下之車輛途程問題研究

黃正賢

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

College of Engineering > Department of Industrial Engineering and Management
Engineering > General Engineering
Social Sciences > Management

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.

時間相依且軟性時窗限制下之車輛途程問題研究

Time Dependent Vehicle Routing Problem with Soft Time Windows

黃正賢 , Masters　　Advisor：丁慶榮　　

繁體中文

基因演算法；車輛途程問題；時窗限制；時間相依； Genetic Algorithm ； Vehicle Routing Problem ； Time Window ； Time Dependent

Abstract │ Reference (55) │ Times Cited (4) │ Altmetrics

Abstract 〈TOP〉

Parallel Abstract 〈TOP〉

The vehicle routing problem with time windows (VRPTW) is an important problem in logistics management. Previous research has been devoted to time independent VRPTW that assumes the travel time between two customers or between a customer and the depot only depends on the distance between the points. For real life application some composite of modified measure of travel cost may be used. This research extends the VRPTW to account for urban congestion and soft time windows. The time dependent vehicle routing problem with soft time windows (TDVRPSTW) treats the travel time functions as step functions. In case of soft time windows that permit service earlier or later than the time window specified at each customer location, penalties will be added into the total travel cost function.
           As a generalization of the VRPTW, the TDVRPSTW belongs to the class on NP-complete problems for which polynomial time exact algorithms are unlikely to be developed. A genetic algorithm incorporating the elitism strategy is proposed in this research. For elitism strategy we compare the best members of reproduction, crossover and mutation and select the best individuals. The best members of each generation are copied into the succeeding generation. The results of VRPTW are discussed in comparison with earlier findings. On well-known benchmark VRPTW instances, we obtain better results than those reported by other researchers using genetic algorithms. For TDVRPSTW, we test some of the VRPTW instances by adding penalties for early and late deliveries. The speed of the peak period is set to be a fraction of that of off-peak period. The results show that average costs, average travel times, and average number of vehicles increase when the speed of peak period decreases. The number of vehicles that serves the customers is doubled when the speed during peak period is one fifth of that of off-peak period. This indicates that larger vehicle fleet size should be considered in the presence of roadway speed variation.

Reference ( 55 ) 〈TOP〉

15.敖君瑋，「禁制搜尋法於軟性時窗限制之車輛途程問題研究」，私立元智大學工業工程所，碩士論文，1999。
連結：
19.顏成佑，「基因演算法解算軟性時窗車輛途程問題之研究」，私立元智大學工業工程所，碩士論文，2000。
連結：
21.Blumenfeld, D. E., L. D. Burns , J. D. Diltz and C. F. Daganzo, “Analyzing Trade-offs Between Transportation, Inventory and Production Costs on Freight Networks,” Transportation Research, Vol. 19B, No. 5, pp. 361-380, 1985.
連結：
23.Burns, L. D., R. W. Hall , D. E. Blumenfeld and C. F. Daganzo, “Distribution Strategies that Minimize Transportation and Inventory Costs,” Operations Research, Vol. 33, No. 3, pp. 469-490, 1985.
連結：
24.Campbell, J. F., “One-to-Many Distribution with Transshipments: An Analytic Model,” Transportation Science, Vol. 27, No. 4, pp. 330-340, November 1993.
連結：

Times Cited (4) 〈TOP〉

Altmetrics

〈TOP〉

E-mail ：

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

E-mail ：