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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

This paper investigates the optimization problem of scheduling autonomousmobile robots (AMRs) in hospital settings, considering dynamic requests withdifferent priorities. The primary objective is to minimize the daily servicecost by dynamically planning routes for the limited number of available AMRs.The total cost consists of AMR's purchase cost, transportation cost, delaypenalty cost, and loss of denial of service. To address this problem, we haveestablished a two-stage mathematical programming model. In the first stage, atabu search algorithm is employed to plan prior routes for all known medicalrequests. The second stage involves planning for real-time received dynamicrequests using the efficient insertion algorithm with decision rules, whichenables quick response based on the time window and demand constraints of thedynamic requests. One of the main contributions of this study is to makeresource allocation decisions based on the present number of service AMRs fordynamic requests with different priorities. Computational experiments usingLackner instances demonstrate the efficient insertion algorithm with decisionrules is very fast and robust in solving the dynamic AMR routing problem withtime windows and request priority. Additionally, we provide managerial insightsconcerning the AMR's safety stock settings, which can aid in decision-makingprocesses.

A Quick Response Algorithm for Dynamic Autonomous Mobile Robot Routing Problem with Time Windows