Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
From MaRDI portal
Publication:322556
DOI10.1016/j.ejor.2015.10.025zbMath1346.90300OpenAlexW2176548383MaRDI QIDQ322556
Alberto García-Villoria, Rafael Pastor, Albert Corominas, Gema Calleja
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/85571
simulated annealingtabu searchhybrid metaheuristicsassembly line balancing with accessibility windowscorridor method
Related Items
Assembly line balancing: what happened in the last fifteen years?, Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints, A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery, A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
- Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
- Moving policies in cyclic assembly line scheduling
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
- Reduction approaches for a generalized line balancing problem
- Future paths for integer programming and links to artificial intelligence
- A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays
- Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry
- An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
- A survey on problems and methods in generalized assembly line balancing
- Balancing assembly lines with tabu search
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
- Search Methodologies
- Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
- A survey of simulated annealing as a tool for single and multiobjective optimization
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Tabu Search—Part I
- Tabu Search—Part II
- An Introduction to Tabu Search
- The Theory and Practice of Simulated Annealing
- Workload Balancing in Multi-stage Production Processes
