STACK PRE-MARSHALLING PROBLEM: A HEURISTIC-GUIDED BRANCH-AND-BOUND ALGORITHM
- 문서 유형
- 연구출판물 · 학술지 논문
- 등재
- SCIEScopus
- 저널 순위
- JCR Q4Scopus Q3
- 저널
- INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE22(5) · pp.509 · 2015
- 피인용
- Web of Science 18
- JCR IF
- JCR 2014 0.396
- ISSN
- 1072-4761
저자
- Zhang, Ruiyou제1저자Northeastern Univ, Coll Informat Sci & Engn, CC
- Jiang, Zhong-ZhongNortheastern Univ, Inst Behav & Serv Operat Management, CC
- 윤원영부산대학교, 공과대학, 산업공학과, KO
초록
The stack pre-marshalling (SPM) problem is a complex combinatorial optimization problem which arises mainly within the field of container logistics. This paper presents a heuristic-guided branch-and-bound (HGB&B) algorithm which can effectively be used to solve the SPM problem. The HGB&B algorithm has a guiding heuristic that cuts 'valueless' branches before the calculation of their bounds improving the search efficiency greatly. The valueless branches cannot result in the optimum solution definitely. Additionally, two heuristics have been designed to generate initial feasible solutions of the problem. Experiments indicate that running time of the algorithm is acceptable if the product of the number and maximum height of stacks is within about 35. The HGB&B algorithm is faster than the existing exact algorithm, and more efficient than a number of sub-optimum algorithms. Therefore, it is applicable and valuable in most real-life scenarios, including container logistics, reducing the time to solve the problem to optimality.
키워드
branch and boundcombinatorial optimizationcontainer pre-marshallinglogisticsstack pre-marshalling problemCONTAINER RELOCATION PROBLEMTREE-SEARCH PROCEDUREMATHEMATICAL FORMULATIONTERMINALSSTORAGEBLOCKSOPERATIONS
식별자
- WoS UID
- 000384668800001



로그인
연구물 목록으로