The MQC freight allocation problem with all-units quantity based discount and cost balancing constraint
碩士 === 國立雲林科技大學 === 工業工程與管理研究所碩士班 === 100 === For many large-scale wholesalers, delivering a great diversity of products from its'' place of origin to sell, often conduct the transportation planning of global logistics. Ocean shipping is the large wholesalers, like Costco, Daiso, e...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/58335278937062276328 |
id |
ndltd-TW-100YUNT5031066 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-100YUNT50310662015-10-13T21:55:45Z http://ndltd.ncl.edu.tw/handle/58335278937062276328 The MQC freight allocation problem with all-units quantity based discount and cost balancing constraint 考量成本平衡數量折扣與最小訂購量之貨運分配問題 Yu-Lung Hsieh 謝育倫 碩士 國立雲林科技大學 工業工程與管理研究所碩士班 100 For many large-scale wholesalers, delivering a great diversity of products from its'' place of origin to sell, often conduct the transportation planning of global logistics. Ocean shipping is the large wholesalers, like Costco, Daiso, etc. prefer to use. At present, there are many carriers offer different shipping lines and discount; hence, how to set up the logistics system is relatively important,so the purpose of this essay is how to reduce the transportation cost by designing the efficient logistics system. More specifically, this essay will probe into the freight allocation in accordance with the quantity discount and the minimum quantity commitment. To be closer to the practical operation, I also quote the cost balancing constraint, that means under the quantity discount, each shipping line cost can’t be higher it’s theoretical lower bound cost too much. In that way, we can achieve the goal of fair logistics planning. This reaearch will use Filter-and-Fan heuristic algorithm with Tabu List and Tabu Search to solve the randomly generated instances,and compare the result of each other. It shows that Filter-and-Fan can undertake computation time for better result. Furthermore,add in a cost balancing contraint to evaluate cost analysis then find the most effective cost ratio for the decision makers. Chwen-Tzeng Su 蘇純缯 2012 學位論文 ; thesis 49 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立雲林科技大學 === 工業工程與管理研究所碩士班 === 100 === For many large-scale wholesalers, delivering a great diversity of products from its'' place of origin to sell, often conduct the transportation planning of global logistics. Ocean shipping is the large wholesalers, like Costco, Daiso, etc. prefer to use. At present, there are many carriers offer different shipping lines and discount; hence, how to set up the logistics system is relatively important,so the purpose of this essay is how to reduce the transportation cost by designing the efficient logistics system.
More specifically, this essay will probe into the freight allocation in accordance with the quantity discount and the minimum quantity commitment. To be closer to the practical operation, I also quote the cost balancing constraint, that means under the quantity discount, each shipping line cost can’t be higher it’s theoretical lower bound cost too much. In that way, we can achieve the goal of fair logistics planning.
This reaearch will use Filter-and-Fan heuristic algorithm with Tabu List and Tabu Search to solve the randomly generated instances,and compare the result of each other. It shows that Filter-and-Fan can undertake computation time for better result. Furthermore,add in a cost balancing contraint to evaluate cost analysis then find the most effective cost ratio for the decision makers.
|
author2 |
Chwen-Tzeng Su |
author_facet |
Chwen-Tzeng Su Yu-Lung Hsieh 謝育倫 |
author |
Yu-Lung Hsieh 謝育倫 |
spellingShingle |
Yu-Lung Hsieh 謝育倫 The MQC freight allocation problem with all-units quantity based discount and cost balancing constraint |
author_sort |
Yu-Lung Hsieh |
title |
The MQC freight allocation problem with all-units quantity based discount and cost balancing constraint |
title_short |
The MQC freight allocation problem with all-units quantity based discount and cost balancing constraint |
title_full |
The MQC freight allocation problem with all-units quantity based discount and cost balancing constraint |
title_fullStr |
The MQC freight allocation problem with all-units quantity based discount and cost balancing constraint |
title_full_unstemmed |
The MQC freight allocation problem with all-units quantity based discount and cost balancing constraint |
title_sort |
mqc freight allocation problem with all-units quantity based discount and cost balancing constraint |
publishDate |
2012 |
url |
http://ndltd.ncl.edu.tw/handle/58335278937062276328 |
work_keys_str_mv |
AT yulunghsieh themqcfreightallocationproblemwithallunitsquantitybaseddiscountandcostbalancingconstraint AT xièyùlún themqcfreightallocationproblemwithallunitsquantitybaseddiscountandcostbalancingconstraint AT yulunghsieh kǎoliàngchéngběnpínghéngshùliàngzhékòuyǔzuìxiǎodìnggòuliàngzhīhuòyùnfēnpèiwèntí AT xièyùlún kǎoliàngchéngběnpínghéngshùliàngzhékòuyǔzuìxiǎodìnggòuliàngzhīhuòyùnfēnpèiwèntí AT yulunghsieh mqcfreightallocationproblemwithallunitsquantitybaseddiscountandcostbalancingconstraint AT xièyùlún mqcfreightallocationproblemwithallunitsquantitybaseddiscountandcostbalancingconstraint |
_version_ |
1718070108931227648 |