\(k\)-interchange heuristic as an optimization procedure for material handling applications

DOI10.1016/S0307-904X(02)00137-3zbMath1023.90014MaRDI QIDQ1401081

Panagiotis A. Makris, Ioannis G. Giakoumakis

Publication date: 17 August 2003

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

zbMATH Keywords

optimizationheuristicwarehousematerial handling\(k\)-interchangeorder-picking

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22)

Related Items (6)

Inventory routing in a warehouse: the storage replenishment routing problem ⋮ An algorithm for dynamic order-picking in warehouse operations ⋮ Research on warehouse operation: a comprehensive review ⋮ Design and control of warehouse order picking: a literature review ⋮ Energy minimizing order picker forklift routing problem ⋮ Using a TSP heuristic for routing order pickers in warehouses

Uses Software

• Genocop

Cites Work

• The traveling salesman problem: An update of research
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• A Method for Solving Traveling-Salesman Problems
• Computer Solutions of the Traveling Salesman Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: \(k\)-interchange heuristic as an optimization procedure for material handling applications