Exact and heuristic procedures for the material handling circular flow path design problem

DOI10.1016/j.ejor.2005.08.023zbMath1103.90389OpenAlexW2006009715MaRDI QIDQ852933

Gilbert Laporte, Ardavan Asef-Vaziri, Robert Ortiz

Publication date: 15 November 2006

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

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

zbMATH Keywords

generalized traveling salesman problemmaterial handlingautomated guided vehicle systemsfacility planning

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout ⋮ Planning and control of autonomous mobile robots for intralogistics: literature review and research agenda ⋮ Optimal location of dwell points in a single loop AGV system with time restrictions on vehicle availability ⋮ An ant colony system for enhanced loop-based aisle-network design ⋮ The minimum flow cost Hamiltonian cycle problem: a comparison of formulations

Cites Work

• Loop based facility planning and material handling
• Design and operational issues in AGV-served manufacturing systems
• Solving quadratic assignment problems with rectangular distances and integer programming
• An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: Exact and heuristic procedures for the material handling circular flow path design problem