Vehicle Routing Planning with Constraints Using Genetic Algorithms—An Empirical Study of a Food Company in Domestic Country

碩士 === 國立屏東科技大學 === 資訊管理系所 === 101 === In recent years, supply chain management calls attention from the practitioners in industries due to the rise of electronic commerce. Fundamentally, the objective of supply chain management is to obtain the best overall performance by way of reducing the total...

Full description

Bibliographic Details
Main Authors: Shou-Cing Li, 李首清
Other Authors: Ming-Shang Huang
Format: Others
Language:zh-TW
Published: 2013
Online Access:http://ndltd.ncl.edu.tw/handle/75291028462088383264
id ndltd-TW-101NPUS5396027
record_format oai_dc
spelling ndltd-TW-101NPUS53960272016-12-22T04:18:37Z http://ndltd.ncl.edu.tw/handle/75291028462088383264 Vehicle Routing Planning with Constraints Using Genetic Algorithms—An Empirical Study of a Food Company in Domestic Country 運用基因演算法探討限制條件下的車輛途程規劃—以國內一家食品公司為實證分析對象 Shou-Cing Li 李首清 碩士 國立屏東科技大學 資訊管理系所 101 In recent years, supply chain management calls attention from the practitioners in industries due to the rise of electronic commerce. Fundamentally, the objective of supply chain management is to obtain the best overall performance by way of reducing the total distribution costs under the premise of meeting the customers’ needs. Consequently, transportation planning is an effective method of reducing the total distribution costs. Therefore, vehicle routing has become an important research topic. An empirical study of vehicle routing was conducted in a food company in domestic country. Vehicle routing occurred in the case company was classified as a vehicle routing problem with time window after deeply interviewed with the professionals of vehicle routing and in-site observation. In this way, how to solve the problem of vehicle routing within limited times becomes an imperative task for the case company. This research adopted generic algorithms methods to solve the problem of vehicle routing by using randomly generated initial chromosomes. It aims to attain the effectiveness of the maximum loading capacity under the condition of satisfying the objectives constraints. Thus, we use generic algorithms methods to generate an optimal solution with minimum total costs by way of vehicle routing with time window. The advantages of the proposed method are described as follows: (1) the total distribution costs were reduced effectively, (2) the numbers of vehicle dispatching were reduced, and (3) the proposed algorithm was an optimal solution for vehicle routing examined by using the real data of the case company. In summary, the results of our research can provide useful references on the aspect of vehicle routing for the academic and the practice. Ming-Shang Huang 黃明祥 2013 學位論文 ; thesis 93 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立屏東科技大學 === 資訊管理系所 === 101 === In recent years, supply chain management calls attention from the practitioners in industries due to the rise of electronic commerce. Fundamentally, the objective of supply chain management is to obtain the best overall performance by way of reducing the total distribution costs under the premise of meeting the customers’ needs. Consequently, transportation planning is an effective method of reducing the total distribution costs. Therefore, vehicle routing has become an important research topic. An empirical study of vehicle routing was conducted in a food company in domestic country. Vehicle routing occurred in the case company was classified as a vehicle routing problem with time window after deeply interviewed with the professionals of vehicle routing and in-site observation. In this way, how to solve the problem of vehicle routing within limited times becomes an imperative task for the case company. This research adopted generic algorithms methods to solve the problem of vehicle routing by using randomly generated initial chromosomes. It aims to attain the effectiveness of the maximum loading capacity under the condition of satisfying the objectives constraints. Thus, we use generic algorithms methods to generate an optimal solution with minimum total costs by way of vehicle routing with time window. The advantages of the proposed method are described as follows: (1) the total distribution costs were reduced effectively, (2) the numbers of vehicle dispatching were reduced, and (3) the proposed algorithm was an optimal solution for vehicle routing examined by using the real data of the case company. In summary, the results of our research can provide useful references on the aspect of vehicle routing for the academic and the practice.
author2 Ming-Shang Huang
author_facet Ming-Shang Huang
Shou-Cing Li
李首清
author Shou-Cing Li
李首清
spellingShingle Shou-Cing Li
李首清
Vehicle Routing Planning with Constraints Using Genetic Algorithms—An Empirical Study of a Food Company in Domestic Country
author_sort Shou-Cing Li
title Vehicle Routing Planning with Constraints Using Genetic Algorithms—An Empirical Study of a Food Company in Domestic Country
title_short Vehicle Routing Planning with Constraints Using Genetic Algorithms—An Empirical Study of a Food Company in Domestic Country
title_full Vehicle Routing Planning with Constraints Using Genetic Algorithms—An Empirical Study of a Food Company in Domestic Country
title_fullStr Vehicle Routing Planning with Constraints Using Genetic Algorithms—An Empirical Study of a Food Company in Domestic Country
title_full_unstemmed Vehicle Routing Planning with Constraints Using Genetic Algorithms—An Empirical Study of a Food Company in Domestic Country
title_sort vehicle routing planning with constraints using genetic algorithms—an empirical study of a food company in domestic country
publishDate 2013
url http://ndltd.ncl.edu.tw/handle/75291028462088383264
work_keys_str_mv AT shoucingli vehicleroutingplanningwithconstraintsusinggeneticalgorithmsanempiricalstudyofafoodcompanyindomesticcountry
AT lǐshǒuqīng vehicleroutingplanningwithconstraintsusinggeneticalgorithmsanempiricalstudyofafoodcompanyindomesticcountry
AT shoucingli yùnyòngjīyīnyǎnsuànfǎtàntǎoxiànzhìtiáojiànxiàdechēliàngtúchéngguīhuàyǐguónèiyījiāshípǐngōngsīwèishízhèngfēnxīduìxiàng
AT lǐshǒuqīng yùnyòngjīyīnyǎnsuànfǎtàntǎoxiànzhìtiáojiànxiàdechēliàngtúchéngguīhuàyǐguónèiyījiāshípǐngōngsīwèishízhèngfēnxīduìxiàng
_version_ 1718404833919107072