Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem

DOI10.1016/j.ejor.2004.08.007zbMath1079.90016OpenAlexW2028037673MaRDI QIDQ2570145

Yanyan Li

Publication date: 26 October 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.08.007

zbMATH Keywords

Genetic algorithmsPath relinkingWarehouse layout

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items

Multi-neighborhood based path relinking for two-sided assembly line balancing problem ⋮ A rock-paper-scissors evolutionary algorithm for the TDMA broadcast scheduling problem ⋮ Using genetic algorithms grey theory to forecast high technology industrial output ⋮ An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses ⋮ Order acceptance using genetic algorithms ⋮ An evolutionary method for complex-process optimization ⋮ Variable neighborhood search for Multiple Level Warehouse Layout Problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• A heuristic method for the multi-story layout problem
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• Warehouse design and control: Framework and literature review
• A new simulated annealing algorithm for the facility layout problem
• An Improvement-Type Layout Algorithm for Single and Multiple-Floor Facilities
• A class of genetic algorithms for multiple-level warehouse layout problems