Abstract
As the simple assembly line balancing problem type 1 (SALBP1) has been proven to be NP-hard, heuristic and metaheuristic approaches are widely used for solving middle to large instances. Nevertheless, the characteristics (fitness landscape) of the problem’s search space have not been studied so far and no rigorous justification for implementing various metaheuristic methods has been presented. Aiming to fill this gap in the literature, this study presents the first comprehensive and in-depth Fitness Landscape Analysis (FLA) study for SALBP1. The FLA was performed by generating a population of 1000 random solutions and improving them to local optimal solution, and then measuring various statistical indices such as average distance, gap, entropy, amplitude, length of the walk, autocorrelation, and fitness-distance among all solutions, to understand the complexity, structure, and topology of the solution space. We solved 83 benchmark problems with various cycle times taken from Scholl’s dataset which required 83000 local searches from initial to optimal solutions. The analysis showed that locally optimal assembly line balances in SALBP1 are distributed nearly uniformly in the landscape of the problem, and the small average difference between the amplitudes of the initial and optimal solutions implies that the landscape was almost plain. In addition, the large average gap between local and global solutions showed that global optimum solutions in SALBP1 are difficult to find, but the problem can be effectively solved using a single-solution-based metaheuristic to near-optimality. In addition to the FLA, a new mathematical formulation for the entropy (diversity) of solutions in the search space for SALBP1 is also presented in this paper.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Industrial Engineering Computations
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.