Metaheuristics for the integrated machine allocation and layout problem
Summary: The Integrated Machine Allocation and Layout Problem (IMALP) is the problem of assigning a set of machines (including machine replicas) to locations while assigning product flows to machines such that Material Handling Cost is minimised. A new mathematical formulation, a Tabu Search (TS) heuristic, and a Memetic Algorithm (MA) are presented for the IMALP. The algorithms were evaluated using a set of test problems available in the literature. TS and the MA obtained equal or better solutions for the dataset than previous techniques presented in the literature. More specifically, TS obtained better solutions in 47\% of the instances, and MA improved the best known solution in 52.4\% of the cases. As a result, MA out-performed TS with respect to solution quality and computation time.
- METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM
- An optimization-based heuristic for the machine reassignment problem
- Metaheuristic algorithms for the hybrid flowshop scheduling problem
- EA for solving combined machine layout and job assignment problems
- Publication:4865151
- Meta-heuristics for Grid Scheduling Problems
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- Metaheuristics for scheduling batch processing machines in a distributed environment
- A novel meta-heuristic algorithm for multi-objective dynamic facility layout problem
- Optimisation of complex and large-sized single-row facility layout problems with a unique hybrid meta-heuristic framework
This page was built for publication: Metaheuristics for the integrated machine allocation and layout problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1042704)
