A near-optimal algorithm for constraint test ordering in automated stowage planning

The 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. I...

Full description

Saved in:
Bibliographic Details
Main Authors: Lee, Zhuo Qi, Fan, Rui, Hsu, Wen-Jing
Other Authors: School of Computer Science and Engineering
Format: Article
Language:English
Published: 2019
Subjects:
Online Access:https://hdl.handle.net/10356/106121
http://hdl.handle.net/10220/47888
http://dx.doi.org/10.1109/TASE.2017.2779470
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Be the first to leave a comment!
You must be logged in first