A Study on the Warehouse Location Problem
碩士 === 元智大學 === 工業工程與管理學系 === 94 === The study consists of two parts. In the first part, we explore the cost difference due to two attributes of the warehouse location problem (WLP) – capacitated and uncapacitated, single source and multi-source. In the second part, we propose two methods for solvin...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Online Access: | http://ndltd.ncl.edu.tw/handle/61016494299187559342 |
id |
ndltd-TW-094YZU05031014 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-094YZU050310142016-06-01T04:15:08Z http://ndltd.ncl.edu.tw/handle/61016494299187559342 A Study on the Warehouse Location Problem 配送倉儲選位問題之模式分析與解算法之研究 Chun-Chieh Lu 呂俊潔 碩士 元智大學 工業工程與管理學系 94 The study consists of two parts. In the first part, we explore the cost difference due to two attributes of the warehouse location problem (WLP) – capacitated and uncapacitated, single source and multi-source. In the second part, we propose two methods for solving the multi-source capacitated warehouse location problem (MS-CWLP): Simulated annealing (SA) and Variable neighborhood search (VNS) algorithm, and discuss their performance using the benchmark instances of OR Library. In the WLP, the cost to be considered contains warehouse construction cost and transportation cost, and the objective is to choose a set of warehouses such that the total cost is the minimum. The WLP can be further classified into capacitated and uncapacitated according to whether capacity is imposed on the warehouses or not. Likewise, a WLP is called single-source if each customer’s demand must be supplied by exactly one warehouse; otherwise, the WLP is called multi-source. A simple proof for the existence of a single-source optimal solution to the uncapacitated WLP is presented. Meanwhile, an experiment is conducted using LINGO software to solve the benchmark instances of the OR Library. It is clear that the uncapacitated-WLP has the least cost than the MS-WLP and the single-source WLP. Our experiments indicate that there is little cost difference in terms of percentage between the MS-WLP and the single-source WLP. Three types of neighborhood are used for the proposed SA and VNS: one for one exchange, increase by one, and decrease by one. Several solution-search moving strategies are considered in the SA and VNS: random selection, the maximum unused quantity, the maximum unused rate, and the maximum cost rate per unit transported. The cost rate for a warehouse is defined as the ratio of the sum of the construction cost and the total transportation cost over the total transported units from that warehouse. Our computational results using the benchmark instances of the OR Library indicate that in both algorithms, two moving strategies - the random selection and the maximum cost rate - are superior to the other three in solution quality and the average number of solutions computed to reach the best or optimal solution, but are inferior in computational time. Chiuh-Cheng Chyu 徐旭昇 學位論文 ; thesis 103 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 元智大學 === 工業工程與管理學系 === 94 === The study consists of two parts. In the first part, we explore the cost difference due to two attributes of the warehouse location problem (WLP) – capacitated and uncapacitated, single source and multi-source. In the second part, we propose two methods for solving the multi-source capacitated warehouse location problem (MS-CWLP): Simulated annealing (SA) and Variable neighborhood search (VNS) algorithm, and discuss their performance using the benchmark instances of OR Library.
In the WLP, the cost to be considered contains warehouse construction cost and transportation cost, and the objective is to choose a set of warehouses such that the total cost is the minimum. The WLP can be further classified into capacitated and uncapacitated according to whether capacity is imposed on the warehouses or not. Likewise, a WLP is called single-source if each customer’s demand must be supplied by exactly one warehouse; otherwise, the WLP is called multi-source. A simple proof for the existence of a single-source optimal solution to the uncapacitated WLP is presented. Meanwhile, an experiment is conducted using LINGO software to solve the benchmark instances of the OR Library. It is clear that the uncapacitated-WLP has the least cost than the MS-WLP and the single-source WLP. Our experiments indicate that there is little cost difference in terms of percentage between the MS-WLP and the single-source WLP.
Three types of neighborhood are used for the proposed SA and VNS: one for one exchange, increase by one, and decrease by one. Several solution-search moving strategies are considered in the SA and VNS: random selection, the maximum unused quantity, the maximum unused rate, and the maximum cost rate per unit transported. The cost rate for a warehouse is defined as the ratio of the sum of the construction cost and the total transportation cost over the total transported units from that warehouse. Our computational results using the benchmark instances of the OR Library indicate that in both algorithms, two moving strategies - the random selection and the maximum cost rate - are superior to the other three in solution quality and the average number of solutions computed to reach the best or optimal solution, but are inferior in computational time.
|
author2 |
Chiuh-Cheng Chyu |
author_facet |
Chiuh-Cheng Chyu Chun-Chieh Lu 呂俊潔 |
author |
Chun-Chieh Lu 呂俊潔 |
spellingShingle |
Chun-Chieh Lu 呂俊潔 A Study on the Warehouse Location Problem |
author_sort |
Chun-Chieh Lu |
title |
A Study on the Warehouse Location Problem |
title_short |
A Study on the Warehouse Location Problem |
title_full |
A Study on the Warehouse Location Problem |
title_fullStr |
A Study on the Warehouse Location Problem |
title_full_unstemmed |
A Study on the Warehouse Location Problem |
title_sort |
study on the warehouse location problem |
url |
http://ndltd.ncl.edu.tw/handle/61016494299187559342 |
work_keys_str_mv |
AT chunchiehlu astudyonthewarehouselocationproblem AT lǚjùnjié astudyonthewarehouselocationproblem AT chunchiehlu pèisòngcāngchǔxuǎnwèiwèntízhīmóshìfēnxīyǔjiěsuànfǎzhīyánjiū AT lǚjùnjié pèisòngcāngchǔxuǎnwèiwèntízhīmóshìfēnxīyǔjiěsuànfǎzhīyánjiū AT chunchiehlu studyonthewarehouselocationproblem AT lǚjùnjié studyonthewarehouselocationproblem |
_version_ |
1718288041836019712 |