03071nas|a2200409 i 4500 20260818084956.0 040423s2003 th uzm rtt 00| a1eng d .b11922400 AIT Thesis no. ISE-03-12 Supawan Tiyawongsuwan Container storage allocation with top stackers for an inland container depot Pathum Thani, Thailand : Asian Institute of Technology, 2003 71 p. Thesis ; no. ISE-03-12 Thesis (M.Eng.) - Asian Institute of Technology, 2003 A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies This study considers how to allocate storage spaces for import containers with top stackers and automated guided vehicles (AGVs) in an inland container depot (ICD). The performance measure is the rehandling work. The stack height and number of container stacks of each shipment are important decision variables. In the segregation strategy, containers unloaded during different shipment are not allowed to mix with each other. Available locations or spaces are allocated for each shipment for minimizing the expected total number of rehandles to picking up all containers. Genetic algorithm (GA) is a methodology proposed for searching for the good solutions. A computer programming, written in visual basic language, was developed. The GA is compared with Kim's and Lingo method. The result shows that in the larger size of time period planning horizon (T), the GA program give the better result of computational time, while the different result of GA and Lingo is not significant. Comparing GA and Kim's result, GA value is better than Kim's in the larger size of time period planning horizon. The GA program is a suitable method for solving the container allocation problem of a larger size of time period, more than 30 time periods to yield good solutions within a reasonable computational time. Heuristic programming Containers Resource allocation Anulark Techanitisawad, Chairperson Voratas Kachitvichyanukul, Examination Committee Huynh, Trung Luong, Examination Committee RTG Partial Scholarship, Scholarship Donor Asian Institute of Technology. Thesis ; no. ISE-03-12 Full-Text http://203.159.5.9/ait-thesis/detail.php?q=B08493 .b11922400 mnait u 240411 0 040423 m a u 0 mnait mnarc 22 40 Barcode : 30050120812341 CREATED : 2004-04-23 RECORD # : i12390720 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 Barcode : 30050160018163 CREATED : 2016-02-19 RECORD # : i1288540x LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 22634 22634 0 0 0 0 MAIN MAIN mnait 2026-08-18 50.00 0 AIT Thesis no. ISE-03-12 30050120812341 2026-08-18 08:49:56 3 2026-08-18 22 0 0 0 0 MAIN MAIN mnarc 2026-08-18 0 AIT Thesis no. ISE-03-12 30050160018163 2026-08-18 08:49:56 1 2026-08-18 40