Probabilistic traveling salesman problem with route duration restrictions

碩士 === 國立高雄第一科技大學 === 運輸倉儲營運所 === 92 === For international express service industry, it is very import to delivery good efficiently. The efficiency of pick-up service is mainly influenced by the courier service route design and duty area partition. The presence of uncertain customer demand creates t...

Full description

Bibliographic Details
Main Authors: Chiu-Kan Kuo, 郭秋泔
Other Authors: Wei-Ming Wu
Format: Others
Language:zh-TW
Published: 2004
Online Access:http://ndltd.ncl.edu.tw/handle/92026628861996847528
id ndltd-TW-092NKIT5678014
record_format oai_dc
spelling ndltd-TW-092NKIT56780142015-10-13T13:24:20Z http://ndltd.ncl.edu.tw/handle/92026628861996847528 Probabilistic traveling salesman problem with route duration restrictions 考慮旅行時間限制下之隨機旅行銷售員問題-以國際快遞業為例 Chiu-Kan Kuo 郭秋泔 碩士 國立高雄第一科技大學 運輸倉儲營運所 92 For international express service industry, it is very import to delivery good efficiently. The efficiency of pick-up service is mainly influenced by the courier service route design and duty area partition. The presence of uncertain customer demand creates the need to design a priori tour instead of finding optimal tour everyday. This thesis focuses on route design for courier service. The objective is to minimize the probability of that the total tour duration exceeds the given duration constraints, with the strategy of service a random subset of customers in the same order as they appear in the a priori tour. This thesis clarifies the meanings of “Probabilistic Traveling Salesman Problem with Route Duration Restrictions (PTSP-DC)”and develops a mathematical model, as well as computationally feasible methods for obtains solutions in realistic situations. In a series of test problem, we solve this problem by Genetic Algorithms to produce a good approximate solution in a short time. In the case study, we find that the solution of PTSP-DC is not only better than the solution of PTSP but also the solution of TSP, in terms of the probability of that the total tour duration exceeds the given duration constraints. Wei-Ming Wu Jenn-Rong Lin 吳偉銘 林振榮 2004 學位論文 ; thesis 64 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立高雄第一科技大學 === 運輸倉儲營運所 === 92 === For international express service industry, it is very import to delivery good efficiently. The efficiency of pick-up service is mainly influenced by the courier service route design and duty area partition. The presence of uncertain customer demand creates the need to design a priori tour instead of finding optimal tour everyday. This thesis focuses on route design for courier service. The objective is to minimize the probability of that the total tour duration exceeds the given duration constraints, with the strategy of service a random subset of customers in the same order as they appear in the a priori tour. This thesis clarifies the meanings of “Probabilistic Traveling Salesman Problem with Route Duration Restrictions (PTSP-DC)”and develops a mathematical model, as well as computationally feasible methods for obtains solutions in realistic situations. In a series of test problem, we solve this problem by Genetic Algorithms to produce a good approximate solution in a short time. In the case study, we find that the solution of PTSP-DC is not only better than the solution of PTSP but also the solution of TSP, in terms of the probability of that the total tour duration exceeds the given duration constraints.
author2 Wei-Ming Wu
author_facet Wei-Ming Wu
Chiu-Kan Kuo
郭秋泔
author Chiu-Kan Kuo
郭秋泔
spellingShingle Chiu-Kan Kuo
郭秋泔
Probabilistic traveling salesman problem with route duration restrictions
author_sort Chiu-Kan Kuo
title Probabilistic traveling salesman problem with route duration restrictions
title_short Probabilistic traveling salesman problem with route duration restrictions
title_full Probabilistic traveling salesman problem with route duration restrictions
title_fullStr Probabilistic traveling salesman problem with route duration restrictions
title_full_unstemmed Probabilistic traveling salesman problem with route duration restrictions
title_sort probabilistic traveling salesman problem with route duration restrictions
publishDate 2004
url http://ndltd.ncl.edu.tw/handle/92026628861996847528
work_keys_str_mv AT chiukankuo probabilistictravelingsalesmanproblemwithroutedurationrestrictions
AT guōqiūgān probabilistictravelingsalesmanproblemwithroutedurationrestrictions
AT chiukankuo kǎolǜlǚxíngshíjiānxiànzhìxiàzhīsuíjīlǚxíngxiāoshòuyuánwèntíyǐguójìkuàidìyèwèilì
AT guōqiūgān kǎolǜlǚxíngshíjiānxiànzhìxiàzhīsuíjīlǚxíngxiāoshòuyuánwèntíyǐguójìkuàidìyèwèilì
_version_ 1717734417073438720