Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing
From MaRDI portal
Publication:703914
DOI10.1016/S0377-2217(03)00248-0zbMath1067.90035MaRDI QIDQ703914
R. Shankar, Maghsud Solimanpur, Prem Vrat
Publication date: 12 January 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Quadratic assignment problemAnt algorithmsCellular manufacturingFacilities planning and designInter-cell layout problem
Related Items
Ant colony optimization for solving an industrial layout problem ⋮ Single row layout models ⋮ A survey for the quadratic assignment problem ⋮ Ensuring population diversity in genetic algorithms: a technical note with application to the cell formation problem ⋮ A tabu search algorithm for the cell formation problem with part machine sequencing ⋮ An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP) ⋮ Website structure improvement: quadratic assignment problem approach and ant colony meta-heuristic technique ⋮ A modified ant colony system for solving the travelling salesman problem with time windows ⋮ ACS-TS: Train scheduling using ant colony system ⋮ A heuristic approach to find the global optimum of function ⋮ Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing ⋮ Solving the facility and layout and location problem by ant-colony optimization-meta heuristic ⋮ Manufacturing cell design with alternative routings in generalized group technology: reducing the complexity of the solution space ⋮ A robust optimization approach for an integrated dynamic cellular manufacturing system and production planning with unreliable machines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved annealing scheme for the QAP
- The facility layout problem
- A genetic approach to the quadratic assignment problem
- Layout designs in cellular manufacturing
- The Quadratic Assignment Problem
- Ant colonies for the quadratic assignment problem
- A New Lower Bound for the Quadratic Assignment Problem
- P-Complete Approximation Problems
- Comparison of iterative searches for the quadratic assignment problem
- Identifying the composition of a cellular manufacturing system
- A two-phase procedure for duplicating bottleneck machines in a linear layout, cellular manufacturing system
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
- Some design issues in cellular manufacturing using the fuzzy programming approach
- Locating cells with bottleneck machines in cellular manufacturing systems
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem