Vehicle Routing Problem with Emissions and Location Considerations
碩士 === 國立雲林科技大學 === 工業工程與管理研究所碩士班 === 100 === This study investigates the problem of location for two depots and the problem of vehicle routing with the consideration of the amount of carbon emission. It is hypothesized that the existing depot is fixed and the new depot is unknown. It is used a m...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/83152811837883657621 |
id |
ndltd-TW-100YUNT5031047 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-100YUNT50310472015-10-13T21:55:45Z http://ndltd.ncl.edu.tw/handle/83152811837883657621 Vehicle Routing Problem with Emissions and Location Considerations 考量增設單一場站位址及碳排放量之車輛路徑規劃 Yi-Ta Tsai 蔡易達 碩士 國立雲林科技大學 工業工程與管理研究所碩士班 100 This study investigates the problem of location for two depots and the problem of vehicle routing with the consideration of the amount of carbon emission. It is hypothesized that the existing depot is fixed and the new depot is unknown. It is used a mathematic model which minimizes the total cost as its objective function and developed an integrated heuristic algorithm to solve a numerical example. The integrated heuristic algorithm is combined tabu search algorithm and simulated annealing algorithm. The purpose of tabu search is for improving the vehicle routing; whereas the simulated annealing algorithm is for searching location. The result indicated that the integrated heuristic algorithm of this study can effectively decrease the total cost and the amount of carbon emission. Neither the results for the case of increase of the transportation cost, nor the raise of the carbon emission cost indicated the chosen new depot are fairly near. none 蘇純繒 2012 學位論文 ; thesis 80 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立雲林科技大學 === 工業工程與管理研究所碩士班 === 100 === This study investigates the problem of location for two depots and the problem of vehicle routing with the consideration of the amount of carbon emission. It is hypothesized that the existing depot is fixed and the new depot is unknown.
It is used a mathematic model which minimizes the total cost as its objective function and developed an integrated heuristic algorithm to solve a numerical example. The integrated heuristic algorithm is combined tabu search algorithm and simulated annealing algorithm. The purpose of tabu search is for improving the vehicle routing; whereas the simulated annealing algorithm is for searching location.
The result indicated that the integrated heuristic algorithm of this study can effectively decrease the total cost and the amount of carbon emission. Neither the results for the case of increase of the transportation cost, nor the raise of the carbon emission cost indicated the chosen new depot are fairly near.
|
author2 |
none |
author_facet |
none Yi-Ta Tsai 蔡易達 |
author |
Yi-Ta Tsai 蔡易達 |
spellingShingle |
Yi-Ta Tsai 蔡易達 Vehicle Routing Problem with Emissions and Location Considerations |
author_sort |
Yi-Ta Tsai |
title |
Vehicle Routing Problem with Emissions and Location Considerations |
title_short |
Vehicle Routing Problem with Emissions and Location Considerations |
title_full |
Vehicle Routing Problem with Emissions and Location Considerations |
title_fullStr |
Vehicle Routing Problem with Emissions and Location Considerations |
title_full_unstemmed |
Vehicle Routing Problem with Emissions and Location Considerations |
title_sort |
vehicle routing problem with emissions and location considerations |
publishDate |
2012 |
url |
http://ndltd.ncl.edu.tw/handle/83152811837883657621 |
work_keys_str_mv |
AT yitatsai vehicleroutingproblemwithemissionsandlocationconsiderations AT càiyìdá vehicleroutingproblemwithemissionsandlocationconsiderations AT yitatsai kǎoliàngzēngshèdānyīchǎngzhànwèizhǐjítànpáifàngliàngzhīchēliànglùjìngguīhuà AT càiyìdá kǎoliàngzēngshèdānyīchǎngzhànwèizhǐjítànpáifàngliàngzhīchēliànglùjìngguīhuà |
_version_ |
1718070099985825792 |