File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Solving a dynamic warehousing problem using a genetic algorithm

TitleSolving a dynamic warehousing problem using a genetic algorithm
Authors
KeywordsBi-level program
Distribution center
Dynamic warehousing problem
Genetic algorithm
Mixed-integer program
Issue Date2003
PublisherHong 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?
AbstractDue 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 Identifierhttp://hdl.handle.net/10722/71754
ISSN
2015 SCImago Journal Rankings: 0.145
References

 

DC FieldValueLanguage
dc.contributor.authorWong, SCen_HK
dc.contributor.authorJuxin, Cen_HK
dc.contributor.authorXu, Jen_HK
dc.date.accessioned2010-09-06T06:34:52Z-
dc.date.available2010-09-06T06:34:52Z-
dc.date.issued2003en_HK
dc.identifier.citationTransactions Hong Kong Institution Of Engineers, 2003, v. 10 n. 2, p. 34-40en_HK
dc.identifier.issn1023-697Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/71754-
dc.description.abstractDue 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.languageengen_HK
dc.publisherHong Kong Institution of Engineers. The Journal's web site is located at http://www.hkie.org.hk/html/publications/transactions/index.aspen_HK
dc.relation.ispartofTransactions Hong Kong Institution of Engineersen_HK
dc.subjectBi-level programen_HK
dc.subjectDistribution centeren_HK
dc.subjectDynamic warehousing problemen_HK
dc.subjectGenetic algorithmen_HK
dc.subjectMixed-integer programen_HK
dc.titleSolving a dynamic warehousing problem using a genetic algorithmen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://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+algorithmen_HK
dc.identifier.emailWong, SC:hhecwsc@hku.hken_HK
dc.identifier.authorityWong, SC=rp00191en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-0041845292en_HK
dc.identifier.hkuros76706en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0041845292&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume10en_HK
dc.identifier.issue2en_HK
dc.identifier.spage34en_HK
dc.identifier.epage40en_HK
dc.publisher.placeHong Kongen_HK
dc.identifier.scopusauthoridWong, SC=24323361400en_HK
dc.identifier.scopusauthoridJuxin, C=6507850526en_HK
dc.identifier.scopusauthoridXu, J=8850249000en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats