IDEAS home Printed from https://ideas.repec.org/a/wly/jnlaaa/v2013y2013i1n634812.html
   My bibliography  Save this article

Optimal Scheduling for Retrieval Jobs in Double‐Deep AS/RS by Evolutionary Algorithms

Author

Listed:
  • Kuo-Yang Wu
  • Sendren Sheng-Dong Xu
  • Tzong-Chen Wu

Abstract

We investigate the optimal scheduling of retrieval jobs for double‐deep type Automated Storage and Retrieval Systems (AS/RS) in the Flexible Manufacturing System (FMS) used in modern industrial production. Three types of evolutionary algorithms, the Genetic Algorithm (GA), the Immune Genetic Algorithm (IGA), and the Particle Swarm Optimization (PSO) algorithm, are implemented to obtain the optimal assignments. The objective is to minimize the working distance, that is, the shortest retrieval time travelled by the Storage and Retrieval (S/R) machine. Simulation results and comparisons show the advantages and feasibility of the proposed methods.

Suggested Citation

Handle: RePEc:wly:jnlaaa:v:2013:y:2013:i:1:n:634812
DOI: 10.1155/2013/634812
as

Download full text from publisher

File URL: https://doi.org/10.1155/2013/634812
Download Restriction: no
File URL: https://libkey.io/10.1155/2013/634812?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Statistics

Access and download statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:jnlaaa:v:2013:y:2013:i:1:n:634812. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no bibliographic references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1155/4058 .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.