An efficient heuristic for minimizing the number of moves for the retrieval of a single item in a puzzle-based storage system with multiple escorts

MLA

Haoxun Chen, et al. An Efficient Heuristic for Minimizing the Number of Moves for the Retrieval of a Single Item in a Puzzle-Based Storage System with Multiple Escorts. Oct. 2021. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsair&AN=edsair.doi.dedup.....25c5ff84b9a006470b27ae964d7aec0a&authtype=sso&custid=ns315887.

APA

Haoxun Chen, Yugang Yu, & Yunfeng Ma. (2021). An efficient heuristic for minimizing the number of moves for the retrieval of a single item in a puzzle-based storage system with multiple escorts.

Chicago

Haoxun Chen, Yugang Yu, and Yunfeng Ma. 2021. “An Efficient Heuristic for Minimizing the Number of Moves for the Retrieval of a Single Item in a Puzzle-Based Storage System with Multiple Escorts,” October. http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsair&AN=edsair.doi.dedup.....25c5ff84b9a006470b27ae964d7aec0a&authtype=sso&custid=ns315887.