ブロック積み替え問題に対するmemory-based dominanceの適用

田中 俊二

doi:10.11511/jacc.59.0_201

THE 59TH JAPAN JOINT AUTOMATIC CONTROL CONFERENCE

Session ID : ThB3-1

DOI https://doi.org/10.11511/jacc.59.0_201

Conference information

Host: The Japan Society of Mechanical Engineers, The Society of Instrument and Control Engineers, The Institute of Systems, Control and Information Engineers, The Society of Chemical Engineers, The Japan Society for Precision Engineering, The Japan Society for Aeronautical and Space Sciences, The Institute of Electrical Engineers of Japan

Co-host: Technically Cosponsored by 51 Societies and Institutes

Name : THE 59TH JAPAN JOINT AUTOMATIC CONTROL CONFERENCE

Location : [in Japanese]

Date : November 10, 2016 - November 12, 2016

Memory-based dominance for the block relocation problem

S. Tanaka

Author information

Keywords: Block relocation problem, Branch-and-bound algorithm, Memory-based dominance, Trie, Hash table

CONFERENCE PROCEEDINGS FREE ACCESS

Details

Abstract

In this paper the memory-based dominance is implemented in the branch-and-bound algorithm for the block relocation problem. In the memory-based dominance technique, nodes in the search tree are compared with those already traversed in order to eliminate dominated and thus unnecessary nodes. Since a node is associated with a block configuration in the branch-and-bound algorithm for the block relocation problem, a new representation of a block configuration is proposed not only to store a large number of traversed nodes efficiently but also to check the dominance easily. The effectiveness of the proposed method is examined by numerical experiments.

Corresponding author

Register with J-STAGE for free!