z-logo
open-access-imgOpen Access
A multi-objective optimization model for minimizing investment expenses, cycle times and CO2 footprint of an automated storage and retrieval systems
Author(s) -
Marija Grdić Rajković,
Nenad Zrnić,
Nenad Kosanić,
Matej Borovinšek,
Tone Lerher
Publication year - 2019
Publication title -
transport
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 31
eISSN - 1648-4142
pISSN - 1648-3480
DOI - 10.3846/transport.2019.9686
Subject(s) - sorting , multi objective optimization , genetic algorithm , mathematical optimization , pareto principle , footprint , computer science , investment (military) , throughput , constraint (computer aided design) , engineering , operations research , reliability engineering , algorithm , mathematics , telecommunications , mechanical engineering , paleontology , politics , political science , law , wireless , biology
A new optimization model of Automated Storage and Retrieval Systems (AS/RS) containing three objective and four constraint functions is presented in this paper. Majority of the researchers and publications in material handling field had performed optimization of different decision variables, but with single objective function only. Most common functions are: minimum travel time, maximum throughput capacity, minimum cost, maximum energy efficiency, etc. To perform the simultaneous optimization of objective functions (minimum: “investment expenses”, “cycle times”, “CO2footprint”) the Non-dominated Sorting Genetic Algorithm II (NSGA II) was used. The NSGA II is a tool for finding the Pareto optimal solutions on the Pareto line. Determining the performance of the system is the main goal of our model. Since AS/RS are not flexible in terms of layout and organizational changes once the system is up and running, the proposed model could be a very helpful tool for the warehouse planners in the early stages of warehouse design

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here