Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/106121
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLee, Zhuo Qien
dc.contributor.authorFan, Ruien
dc.contributor.authorHsu, Wen-Jingen
dc.date.accessioned2019-03-22T07:24:13Zen
dc.date.accessioned2019-12-06T22:04:58Z-
dc.date.available2019-03-22T07:24:13Zen
dc.date.available2019-12-06T22:04:58Z-
dc.date.issued2018en
dc.identifier.citationLee, Z. Q., Fan, R., & Hsu, W.- J. (2018). A near-optimal algorithm for constraint test ordering in automated stowage planning. IEEE Transactions on Automation Science and Engineering, 15(3), 1298-1308. doi:10.1109/TASE.2017.2779470en
dc.identifier.issn1545-5955en
dc.identifier.urihttps://hdl.handle.net/10356/106121-
dc.description.abstractThe container stowage planning problem is known to be NP-hard and heuristic algorithms have been proposed. Conventionally, the efficiency of the stowage planning algorithms are improved by pruning or reducing the search space. We observe that constraint evaluation is the core of most algorithms. In addition, the order at which the constraints are evaluated can have significant impact on the efficiency of the constraint evaluation engine. We propose random sample model (RSM) and sequential sample model (SSM) for analysis of the problem. We present and evaluate seven strategies in optimizing the constraint evaluation engine. We show how to achieve the optimal constraint ordering with respect to RSM and SSM, respectively. However, the optimal ordering for SSM requires perfect information about the states of the constraint tests, which is impractical. We present an alternative strategy and show empirically that its efficiency is close to the optimal. Experiments show that, compared to a naïve ordering, an average of 2.74 times speed up in the evaluation engine can be achieved.en
dc.format.extent12 p.en
dc.language.isoenen
dc.relation.ispartofseriesIEEE Transactions on Automation Science and Engineeringen
dc.rights© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/TASE.2017.2779470en
dc.subjectDRNTU::Engineering::Computer science and engineeringen
dc.subjectAutomationen
dc.subjectLogisticsen
dc.titleA near-optimal algorithm for constraint test ordering in automated stowage planningen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Computer Science and Engineeringen
dc.identifier.doi10.1109/TASE.2017.2779470en
dc.description.versionAccepted versionen
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:SCSE Journal Articles
Files in This Item:
File Description SizeFormat 
A Near-Optimal Algorithm for Constraint Test Ordering in Automated Stowage Planning.pdf366.48 kBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations 20

3
Updated on Mar 3, 2021

PublonsTM
Citations 50

1
Updated on Mar 7, 2021

Page view(s)

121
Updated on Jul 29, 2021

Download(s) 50

52
Updated on Jul 29, 2021

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.