Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints

DOI10.1016/j.apm.2015.02.047zbMath1443.90031OpenAlexW1989256369WikidataQ58921027 ScholiaQ58921027MaRDI QIDQ2285897

F. Rende, Francesca Guerriero, Ornella Pisacane

Publication date: 9 January 2020

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2015.02.047

zbMATH Keywords

clusteringlogisticsiterated local searchwarehouse managementrollout

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)

Related Items

A polling-based dynamic order-picking system considering priority orders ⋮ Storage location assignment of steel coils in a manufacturing company: an integer linear programming model and a greedy randomized adaptive search procedure ⋮ Patient scheduling in hemodialysis service

Cites Work

• Unnamed Item
• Parallelization strategies for rollout algorithms
• Hybrid rollout approaches for the job shop scheduling problem
• Three-dimensional bin packing problem with variable bin height
• Designing and reporting on computational experiments with heuristic methods
• Rollout algorithms for combinatorial optimization
• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
• The Three-Dimensional Bin Packing Problem
• Optimization of warehouse storage capacity under a dedicated storage policy
• New Rollout Algorithms for Combinatorial Optimization Problems