Mathematical modeling and solving procedure of the planar storage location assignment problem

Park, Chang-Kyu; Seo, Jae M.

doi:10.1016/j.cie.2009.04.010

Cited by 29 publications

(21 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The first three sets of constraints (2), (3), and (4) are also posed by the authors Park and Seo [15,14]. In addition Ndiaye et al [14] defined constraints similar to our constraints in expression (5).…”

Section: Solutions To Storage Spaces Allocation Problem For Import Comentioning

confidence: 92%

“…Several cases have been proposed using GA, among them in [15,11,1,20,14,21]. The authors Park and Seo in the article [15] solved the planar storage location assignment problem, which consists in to store import and export containers by minimizing the number of obstructive object movements or reshuffles. The authors proposed a mathematical model and a GA to solve the problem.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Solutions To Storage Spaces Allocation Problem for Import Containers by Exact and Heuristic Methods

Jacomino

Valdes

Morell

et al. 2019

CyS

View full text Add to dashboard Cite

Maritime transport carries out most of the world's commercial activities.One of the elements most used for maritime transportation is the container. Before being transported, operators stack containers in a container terminal, also called containers yard. The container terminals demand multiple and complex stacking operations daily.Therefore, the scientific community has paid attention to the container stacking operations in the yard area. In this work, we compare the performance of two methods, the integer linear programming method and a metaheuristic method as solutions to the problem of optimizing the storage space allocation to imported containers regarding the optimization value and the computational time.We model this optimization problem as a generalized assignment problem. Finally, we present the mathematical formulations, their solutions, and our experiments; resulting in a mixed solution of both methods, depending on the size of the containers terminal. Keywords.Containers yard management, containers yard operation, generalized assignment problem, storage space allocation problem.

show abstract

Section: Solutions To Storage Spaces Allocation Problem For Import Comentioning

confidence: 92%

Section: Related Workmentioning

confidence: 99%

Solutions To Storage Spaces Allocation Problem for Import Containers by Exact and Heuristic Methods

Jacomino

Valdes

Morell

et al. 2019

CyS

View full text Add to dashboard Cite

show abstract

“…The past and the recent literature introduce several assignment strategies for both less-than-UL systems and UL warehouses (Caron, Marchet, & Perego, 2000;Clausen, Dabidian, Diekmann, Goedicke, & Poting, 2013;Daniels, Rummel, & Schantz, 1998;Muppani & Adil, 2008b;Pan, Shih, Wu, & Lin, 2015;Park & Seo, 2009;Poulos, Rigatos, Tzafestas, & Koukos, 2001;Roodbergen, 2001;Rosenblatt & Roll, 1984). Order picking and order batching strategies aim to minimise the expected travel time, or order cycle time, considering several factors, e.g.…”

Section: Literature Reviewmentioning

confidence: 99%

Unit-load storage assignment strategy for warehouses in seismic areas

Bortolini

Botti

Cascini

et al. 2015

Computers & Industrial Engineering

View full text Add to dashboard Cite

“…유전자 알고리즘을 사 용하여 조립 블록의 생산 계획 수립에 관한 연구가 있었으며 (Koh, 1996), 통합 생산 계획을 체계화하기 위한 방법론 연구가 수행되었다 (Lee, et al, 1997). 특히 공장 내에서 공간제약과 일 정을 고려하여 공간 효율성을 극대화, 생산 시간을 최소화하기 위하여 블록위치를 결정하는 공간 일정 계획에 관한 많은 연구가 수행되어 왔다 Park, et al, 1996;Koh, et al, 1999;Cho, et al, 2001) (Park & Seo, 2009;Park & Seo, 2010). 적 치장 내 블록의 다양한 크기와 이동 방향의 자유도를 부여하여 재취급 횟수를 줄이는 연구가 진행되으나 (Lee, et al, 2011) (Ha, et al, 2013 Step 1.…”

unclassified

A Heuristic Algorithm for Block Storage Planning in Shipbuilding

Son¹,

Suh²,

Ha³

2014

Journal of the Society of Naval Architects of Korea

View full text Add to dashboard Cite

This is an Open-Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License(http://creativecommons.org/licenses/by-nc/3.0) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited. This paper deal with the block storage planning problem of storing and retrieving assembly blocks in a temporary storage yard with limited capacity, which is one of the critical managerial problems in shipbuilding. The block storage planning problem is required to minimize the number of relocations of blocks while the constraints for storage and retrieval time windows are satisfied. We first show NP-hardness of the block storage planning problem. Next we propose a heuristic algorithm to generate good quality solutions for larger instances in very short computational time. The proposed heuristic algorithm was validated by comparing the results with the mathematical model presented in the previous study.

show abstract

Mathematical modeling and solving procedure of the planar storage location assignment problem

Cited by 29 publications

References 12 publications

Solutions To Storage Spaces Allocation Problem for Import Containers by Exact and Heuristic Methods

Solutions To Storage Spaces Allocation Problem for Import Containers by Exact and Heuristic Methods

Unit-load storage assignment strategy for warehouses in seismic areas

A Heuristic Algorithm for Block Storage Planning in Shipbuilding

Contact Info

Product

Resources

About