File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Solving a dynamic warehousing problem using a genetic algorithm
Title | Solving a dynamic warehousing problem using a genetic algorithm |
---|---|
Authors | |
Keywords | Bi-level program Distribution center Dynamic warehousing problem Genetic algorithm Mixed-integer program |
Issue Date | 2003 |
Publisher | Hong Kong Institution of Engineers. The Journal's web site is located at http://www.hkie.org.hk/html/publications/transactions/index.asp |
Citation | Transactions Hong Kong Institution Of Engineers, 2003, v. 10 n. 2, p. 34-40 How to Cite? |
Abstract | Due to the dynamic nature of economic development and market exploration, an investigation of the optimal strategy for distributing products over a given period is highly desirable. A time-dependent optimisation model is developed in this paper to help determine the optimal strategy for establishing potential distribution centers. The problem is first formulated as a mixed-integer program (MIP). Solving the MIP is not computationally practical and attractive when the problem size is large. Hence, an alternative heuristic approach is proposed, in which the problem is formulated as a bi-level program (BLP) with an upper-level subprogram and a lower-level subprogram, the latter being a Hitchcock transportation problem. This approach can minimise the total system cost - which comprises the transportation cost and capital and operating costs at potential distribution centers - over the entire study period. While the lower-level subprogram is solved by standard linear programming routines, the upper-level subprogram is solved by a genetic algorithm. The state variables that represent whether a distribution center is operating in a particular period are used as the sole decision variables in the upper-level subprogram. Computational experience is also reported to demonstrate the effectiveness of the proposed methodology. |
Persistent Identifier | http://hdl.handle.net/10722/71754 |
ISSN | 2023 SCImago Journal Rankings: 0.167 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wong, SC | en_HK |
dc.contributor.author | Juxin, C | en_HK |
dc.contributor.author | Xu, J | en_HK |
dc.date.accessioned | 2010-09-06T06:34:52Z | - |
dc.date.available | 2010-09-06T06:34:52Z | - |
dc.date.issued | 2003 | en_HK |
dc.identifier.citation | Transactions Hong Kong Institution Of Engineers, 2003, v. 10 n. 2, p. 34-40 | en_HK |
dc.identifier.issn | 1023-697X | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/71754 | - |
dc.description.abstract | Due to the dynamic nature of economic development and market exploration, an investigation of the optimal strategy for distributing products over a given period is highly desirable. A time-dependent optimisation model is developed in this paper to help determine the optimal strategy for establishing potential distribution centers. The problem is first formulated as a mixed-integer program (MIP). Solving the MIP is not computationally practical and attractive when the problem size is large. Hence, an alternative heuristic approach is proposed, in which the problem is formulated as a bi-level program (BLP) with an upper-level subprogram and a lower-level subprogram, the latter being a Hitchcock transportation problem. This approach can minimise the total system cost - which comprises the transportation cost and capital and operating costs at potential distribution centers - over the entire study period. While the lower-level subprogram is solved by standard linear programming routines, the upper-level subprogram is solved by a genetic algorithm. The state variables that represent whether a distribution center is operating in a particular period are used as the sole decision variables in the upper-level subprogram. Computational experience is also reported to demonstrate the effectiveness of the proposed methodology. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Hong Kong Institution of Engineers. The Journal's web site is located at http://www.hkie.org.hk/html/publications/transactions/index.asp | en_HK |
dc.relation.ispartof | Transactions Hong Kong Institution of Engineers | en_HK |
dc.subject | Bi-level program | en_HK |
dc.subject | Distribution center | en_HK |
dc.subject | Dynamic warehousing problem | en_HK |
dc.subject | Genetic algorithm | en_HK |
dc.subject | Mixed-integer program | en_HK |
dc.title | Solving a dynamic warehousing problem using a genetic algorithm | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1023-697X&volume=10&spage=34&epage=40&date=2003&atitle=Solving+a+dynamic+warehousing+problem+using+a+genetic+algorithm | en_HK |
dc.identifier.email | Wong, SC:hhecwsc@hku.hk | en_HK |
dc.identifier.authority | Wong, SC=rp00191 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-0041845292 | en_HK |
dc.identifier.hkuros | 76706 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0041845292&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 10 | en_HK |
dc.identifier.issue | 2 | en_HK |
dc.identifier.spage | 34 | en_HK |
dc.identifier.epage | 40 | en_HK |
dc.publisher.place | Hong Kong | en_HK |
dc.identifier.scopusauthorid | Wong, SC=24323361400 | en_HK |
dc.identifier.scopusauthorid | Juxin, C=6507850526 | en_HK |
dc.identifier.scopusauthorid | Xu, J=8850249000 | en_HK |
dc.identifier.issnl | 1023-697X | - |