English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Recently, many enterprises are facing the difficulties brought out by thelimitation of warehouse land and the increase of loan cost. As a promisingapproach to improve space utilization rate, puzzle-based storage systems(PBSSs) are drawing more attention from logistics researchers. In previousresearch about PBSS, concentration has been paid to single target itemproblems. However, there are no consensus algorithms to solve load retrievalsroute programming in PBSSs with multiple target items. In this paper, aheuristic algorithm is proposed to solve load retrievals route programming inPBSSs with multiple target items, multiple escorts and multiple IOs. In thispaper, new concepts about the proposed algorithm are defined, including targetIOs, target position of escorts, number of escorts required, et al. Then, thedecision procedures are designed according to these concepts. Based on Markovdecision process, the proposed algorithm makes the decision of the next actionby analyzing the current status, until all the target items arrive at the IOs.The case study results have shown the effectiveness and efficiency of theproposed heuristic algorithm.

A Heuristic Method for Load Retrievals Route Programming in Puzzle-based Storage Systems