Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations

DOI10.1287/IJOC.2016.0703zbMath1348.90391OpenAlexW2463694549MaRDI QIDQ2830959

Tulay Flamand, Mohamed Haouari, Ahmed F. Ghoniem

Publication date: 1 November 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0eae1f68159911261e752b9b1c99fd8bb7295860

zbMATH Keywords

mixed-integer programminggeneralized assignment problemsvery large-scale neighborhood search

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete location and assignment (90B80)

Related Items (5)

Retail store operations: literature review and research directions ⋮ Store-wide space planning balancing Impulse and convenience ⋮ Retail shelf space planning problems: a comprehensive review and classification framework ⋮ Shelf space dimensioning and product allocation in retail stores ⋮ Exact Solution Methods for a Generalized Assignment Problem with Location/Allocation Considerations

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Assignment problems: a golden anniversary survey
• Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
• A survey of algorithms for the generalized assignment problem
• Variable neighborhood search
• Measuring instance difficulty for combinatorial optimization problems
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
• A path relinking approach with ejection chains for the generalized assignment problem
• Generating Applicable Synthetic Instances for Branch Problems
• Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach
• An Ejection Chain Approach for the Generalized Assignment Problem
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
• A branch and bound algorithm for the generalized assignment problem
• A generalized assignment problem with special ordered sets: a polyhedral approach.

This page was built for publication: Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations