A Fast Scheduler for Multiagent in a Warehouse

A major goal in scheduling multiagent for warehouse picking is to decrease operating cost by minimizing makespan among transport agents. Computational time must be within ten seconds for real-sized instances. Orders are initially batched by solving the split delivery vehicle routing problem, resulti...

Full description

Saved in:
Bibliographic Details
Published in:International journal of automation technology 2009-03, Vol.3 (2), p.165-173
Main Authors: Rubrico, Jose Ildefonso U., Higashi, Toshimitsu, Tamura, Hirofumi, Nikaido, Makoto, Ota, Jun
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A major goal in scheduling multiagent for warehouse picking is to decrease operating cost by minimizing makespan among transport agents. Computational time must be within ten seconds for real-sized instances. Orders are initially batched by solving the split delivery vehicle routing problem, resulting trips are assigned to agents to balance their picking time, and trips are assigned to minimize blocking delays among agents. Simulation results confirmed that our proposal reduces picking time an average of 11.48% over conventional approaches.
ISSN:1881-7629
1883-8022
DOI:10.20965/ijat.2009.p0165