A heuristic algorithm approach to reverse logistics network for resolving splits in location/allocation problems
碩士 === 雲林科技大學 === 工業工程與管理研究所碩士班 === 96 === Recycling conscious has been rising in recent years, and action taken frequently is setting a collection point, and it has been shown in some past research. In facility location-allocation that only addresses on p-median location model but not is pq-median....
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/68282674462485938192 |
id |
ndltd-TW-096YUNT5030014 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-096YUNT50300142015-10-13T11:20:18Z http://ndltd.ncl.edu.tw/handle/68282674462485938192 A heuristic algorithm approach to reverse logistics network for resolving splits in location/allocation problems 應用啟發式演算法於逆向物流網路系統之區位指派問題 Guo-Shuo Wu 吳國碩 碩士 雲林科技大學 工業工程與管理研究所碩士班 96 Recycling conscious has been rising in recent years, and action taken frequently is setting a collection point, and it has been shown in some past research. In facility location-allocation that only addresses on p-median location model but not is pq-median. Therefore, for conforming to practical situation in this research, in limited capacity of collection points and centralized return centers, bringing up nonlinear mixed-integer programming model by pq-median location model reduces total cost in reverse logistics because of the connection among the best quantities and places of collection points and centralized return center, holding period for each collection point, and customers, collection points and centralized return center. Figuring out location allocation problem in reverse logistics by building heuristic algorithm compared with genetic algorithm for solving quality and solving time; this report proves that heuristic algorithm is better than genetic algorithm in three different illustrations. In sensitivity analysis, further demonstration to the maximum of holding period is for decision maker reference. Chwen-Tzeng Su 蘇純繒 2008 學位論文 ; thesis 131 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 雲林科技大學 === 工業工程與管理研究所碩士班 === 96 === Recycling conscious has been rising in recent years, and action taken frequently is setting a collection point, and it has been shown in some past research. In facility location-allocation that only addresses on p-median location model but not is pq-median. Therefore, for conforming to practical situation in this research, in limited capacity of collection points and centralized return centers, bringing up nonlinear mixed-integer programming model by pq-median location model reduces total cost in reverse logistics because of the connection among the best quantities and places of collection points and centralized return center, holding period for each collection point, and customers, collection points and centralized return center.
Figuring out location allocation problem in reverse logistics by building heuristic algorithm compared with genetic algorithm for solving quality and solving time; this report proves that heuristic algorithm is better than genetic algorithm in three different illustrations. In sensitivity analysis, further demonstration to the maximum of holding period is for decision maker reference.
|
author2 |
Chwen-Tzeng Su |
author_facet |
Chwen-Tzeng Su Guo-Shuo Wu 吳國碩 |
author |
Guo-Shuo Wu 吳國碩 |
spellingShingle |
Guo-Shuo Wu 吳國碩 A heuristic algorithm approach to reverse logistics network for resolving splits in location/allocation problems |
author_sort |
Guo-Shuo Wu |
title |
A heuristic algorithm approach to reverse logistics network for resolving splits in location/allocation problems |
title_short |
A heuristic algorithm approach to reverse logistics network for resolving splits in location/allocation problems |
title_full |
A heuristic algorithm approach to reverse logistics network for resolving splits in location/allocation problems |
title_fullStr |
A heuristic algorithm approach to reverse logistics network for resolving splits in location/allocation problems |
title_full_unstemmed |
A heuristic algorithm approach to reverse logistics network for resolving splits in location/allocation problems |
title_sort |
heuristic algorithm approach to reverse logistics network for resolving splits in location/allocation problems |
publishDate |
2008 |
url |
http://ndltd.ncl.edu.tw/handle/68282674462485938192 |
work_keys_str_mv |
AT guoshuowu aheuristicalgorithmapproachtoreverselogisticsnetworkforresolvingsplitsinlocationallocationproblems AT wúguóshuò aheuristicalgorithmapproachtoreverselogisticsnetworkforresolvingsplitsinlocationallocationproblems AT guoshuowu yīngyòngqǐfāshìyǎnsuànfǎyúnìxiàngwùliúwǎnglùxìtǒngzhīqūwèizhǐpàiwèntí AT wúguóshuò yīngyòngqǐfāshìyǎnsuànfǎyúnìxiàngwùliúwǎnglùxìtǒngzhīqūwèizhǐpàiwèntí AT guoshuowu heuristicalgorithmapproachtoreverselogisticsnetworkforresolvingsplitsinlocationallocationproblems AT wúguóshuò heuristicalgorithmapproachtoreverselogisticsnetworkforresolvingsplitsinlocationallocationproblems |
_version_ |
1716841387356323840 |