A Multi-start Tabu Search Based Algorithm for Solving the Warehousing Problem with Conflict

DOI10.1007/978-3-319-18167-7_11zbMath1370.90220OpenAlexW1006068997MaRDI QIDQ5357746

Sihem Ben Jouida, Ahlem Ouni, Saoussen Krichen

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18167-7_11

zbMATH Keywords

bin packing problemtabu-search algorithmbin packing problem with conflictwarehousing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

On the benchmark instances for the bin packing problem with conflicts

Cites Work

• Approximation algorithms for time constrained scheduling
• New lower bounds for bin packing problems with conflicts
• Heuristics and lower bounds for the bin packing problem with conflicts
• Fast algorithms for bin packing
• Heuristic algorithms for the three-dimensional bin packing problem
• A user's guide to tabu search
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• New classes of fast lower bounds for bin packing problems
• Unnamed Item
• Unnamed Item