Effective storage location assignment model based on a genetic simulation annealing algorithm
by Li Zhou; Xi Yang; Lei Chen; Siqing You; Feng Li; Yang Cao
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 19, No. 1, 2020

Abstract: Automated warehouses have become the main application equipment in logistics due to their access automation and simple operation. In order to adapt to the increasingly rapid logistics speed, it is necessary to optimise the location assignment of items in the automated warehouse. Firstly, according to the characteristics of the automated warehouse operation environment, the storage location assignment optimisation model with the shortest time of items travelling the warehouse, the minimum distance between related items and the lowest orthocentre of the shelf is proposed. Then according to the characteristics of the optimisation model and the shortcomings of the traditional genetic algorithm (GA), the defects of the GA are improved and the fusion with the simulated annealing algorithm (SA) is completed, so as to form an improved genetic simulation annealing algorithm (SAGA) for the model. Finally, the effectiveness and superiority of the improved fusion algorithm are verified by comparing the SA, the SAGA and the improved SAGA.

Online publication date: Wed, 02-Sep-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com