Picker routing optimization of storage stacker based on improved multi-objective iterative local search algorithm

DOI10.3934/jimo.2022187OpenAlexW4312702285MaRDI QIDQ2691470

Qingsong Liu, Bin Feng, Li-Xin Wei

Publication date: 29 March 2023

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2022187

zbMATH Keywords

vehicle routing problemorder pickingmulti-objectivepicker routingprize-collectingiterative local searchevaluation indicatorsstacker

Mathematics Subject Classification ID

Mixed integer programming (90C11) Search theory (90B40) Transportation, logistics and supply chain management (90B06)

Uses Software

• NSPSO

Cites Work

• A new mathematical programming formulation for the single-picker routing problem
• A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
• Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
• New benchmark instances for the capacitated vehicle routing problem
• Exact algorithms for the order picking problem
• Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm
• A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
• The hot-rolling batch scheduling method based on the prize collecting vehicle routing problem
• A scatter search algorithm for time-dependent prize-collecting arc routing problems