An Integer Backtracking Search Optimization Algorithm for Solving Inventory Control Problem of Assemble-To-Order System
碩士 === 朝陽科技大學 === 資訊工程系 === 103 === This thesis proposes an integer backtracking search optimization algorithm (IBSA) to solve a problem for a good enough base stock level of the assemble-to-order (ATO) system. ATO systems refer to a production environment in which the customer must first order spec...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/07869229594855433780 |
id |
ndltd-TW-103CYUT0392024 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-103CYUT03920242016-07-31T04:21:41Z http://ndltd.ncl.edu.tw/handle/07869229594855433780 An Integer Backtracking Search Optimization Algorithm for Solving Inventory Control Problem of Assemble-To-Order System 整數型回溯搜索最佳化演算法求解訂單式組裝系統庫存管控問題 Hsin-Wei Ho 何信威 碩士 朝陽科技大學 資訊工程系 103 This thesis proposes an integer backtracking search optimization algorithm (IBSA) to solve a problem for a good enough base stock level of the assemble-to-order (ATO) system. ATO systems refer to a production environment in which the customer must first order specified products before the item is manufactured. The items of the products are already produced in ATO system, where every item is produced after receiving an order. Businesses often stock the inventory required to make the product. As soon as an order is placed, they often have every item they need to give the customer what has been demanded. Unlike many search algorithms, backtracking search optimization algorithm (BSA) has a single control parameter. The BSA has a simple structure that is effective, fast and capable of solving numerical optimization problems. The ATO system operating with a base stock policy can be formulated as a combinatorial optimization problem with integer variables that possesses a huge solution space. The huge solution space makes the considered problem very hard for conventional heuristic methods to find near-optimal base stock level in a reasonable time. The goal of this thesis is to determine a good enough base stock level of the ATO system in a reasonable computation time such that the total profit per period is maximized. The solution quality is demonstrated by comparing with those obtained by three competing methods: particle swarm optimization, evolution strategy and simulated annealing. The base stock level obtained by the IBSA is promising in the aspects of solution quality and computational efficiency. Keywords: integer backtracking search optimization algorithm, assemble-to-order system, inventory control, base stock level, combinatorial optimization problem with integer variables. Shih-Cheng Horng 洪士程 2015 學位論文 ; thesis 52 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 朝陽科技大學 === 資訊工程系 === 103 === This thesis proposes an integer backtracking search optimization algorithm (IBSA) to solve a problem for a good enough base stock level of the assemble-to-order (ATO) system. ATO systems refer to a production environment in which the customer must first order specified products before the item is manufactured. The items of the products are already produced in ATO system, where every item is produced after receiving an order. Businesses often stock the inventory required to make the product. As soon as an order is placed, they often have every item they need to give the customer what has been demanded. Unlike many search algorithms, backtracking search optimization algorithm (BSA) has a single control parameter. The BSA has a simple structure that is effective, fast and capable of solving numerical optimization problems. The ATO system operating with a base stock policy can be formulated as a combinatorial optimization problem with integer variables that possesses a huge solution space. The huge solution space makes the considered problem very hard for conventional heuristic methods to find near-optimal base stock level in a reasonable time. The goal of this thesis is to determine a good enough base stock level of the ATO system in a reasonable computation time such that the total profit per period is maximized. The solution quality is demonstrated by comparing with those obtained by three competing methods: particle swarm optimization, evolution strategy and simulated annealing. The base stock level obtained by the IBSA is promising in the aspects of solution quality and computational efficiency.
Keywords: integer backtracking search optimization algorithm, assemble-to-order system, inventory control, base stock level, combinatorial optimization problem with integer variables.
|
author2 |
Shih-Cheng Horng |
author_facet |
Shih-Cheng Horng Hsin-Wei Ho 何信威 |
author |
Hsin-Wei Ho 何信威 |
spellingShingle |
Hsin-Wei Ho 何信威 An Integer Backtracking Search Optimization Algorithm for Solving Inventory Control Problem of Assemble-To-Order System |
author_sort |
Hsin-Wei Ho |
title |
An Integer Backtracking Search Optimization Algorithm for Solving Inventory Control Problem of Assemble-To-Order System |
title_short |
An Integer Backtracking Search Optimization Algorithm for Solving Inventory Control Problem of Assemble-To-Order System |
title_full |
An Integer Backtracking Search Optimization Algorithm for Solving Inventory Control Problem of Assemble-To-Order System |
title_fullStr |
An Integer Backtracking Search Optimization Algorithm for Solving Inventory Control Problem of Assemble-To-Order System |
title_full_unstemmed |
An Integer Backtracking Search Optimization Algorithm for Solving Inventory Control Problem of Assemble-To-Order System |
title_sort |
integer backtracking search optimization algorithm for solving inventory control problem of assemble-to-order system |
publishDate |
2015 |
url |
http://ndltd.ncl.edu.tw/handle/07869229594855433780 |
work_keys_str_mv |
AT hsinweiho anintegerbacktrackingsearchoptimizationalgorithmforsolvinginventorycontrolproblemofassembletoordersystem AT héxìnwēi anintegerbacktrackingsearchoptimizationalgorithmforsolvinginventorycontrolproblemofassembletoordersystem AT hsinweiho zhěngshùxínghuísùsōusuǒzuìjiāhuàyǎnsuànfǎqiújiědìngdānshìzǔzhuāngxìtǒngkùcúnguǎnkòngwèntí AT héxìnwēi zhěngshùxínghuísùsōusuǒzuìjiāhuàyǎnsuànfǎqiújiědìngdānshìzǔzhuāngxìtǒngkùcúnguǎnkòngwèntí AT hsinweiho integerbacktrackingsearchoptimizationalgorithmforsolvinginventorycontrolproblemofassembletoordersystem AT héxìnwēi integerbacktrackingsearchoptimizationalgorithmforsolvinginventorycontrolproblemofassembletoordersystem |
_version_ |
1718366855611023360 |