Joint Optimization of Item and Pod Storage Assignment Problems with Picking Aisles’ Workload Balance in Robotic Mobile Fulfillment Systems

Jun Zhang, Lingkun Tian, Zijuan Zhou and Dan SeliÅŸteanu

Complexity, 2024, vol. 2024, 1-15

Abstract: The item and pod storage assignment problems, two critical issues at the strategic level in robotic mobile fulfillment systems, have a strong correlation and should be studied together. Moreover, the workload balance in each picking aisle needs to be considered in the storage assignment problems to avoid robots’ congestion within picking aisles. Motivated by these, the joint optimization of item and pod storage assignment problems (J-IPSAP) with picking aisles’ workload balance is studied. The mixed integer programming model of the J-IPSAP with the workload balance constraint is formulated to minimize the robots’ movement distance. The improved genetic algorithm (IGA) with the decentralized pod storage assignment strategy is designed to solve the J-IPSAP model. The experimental results show that the IGA can obtain high-quality solutions when compared with Gurobi and the two-stage heuristic algorithms. The robots’ movement distance is smallest when the width-to-length ratio of the storage area is close to 1, and the robots’ movement distance will increase with more stringent workload balance constraints.

Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2024/9260431.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2024/9260431.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:9260431

DOI: 10.1155/2024/9260431

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().