A novel variable neighborhood strategy adaptive search for SALBP-2 problem with a limit on the number of machine's types

DOI10.1007/S10479-021-04015-1zbMath1528.90115OpenAlexW3133532535MaRDI QIDQ6170690

Ganokgarn Jirasirilerd, Rapeepan Pitakaso, Paulina Golinska-Dawson, Kanchana Sethanan

Publication date: 13 July 2023

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-021-04015-1

zbMATH Keywords

large neighbourhood searchmodified differential evolution algorithmassembly line balancing problem type 2variable neighbourhood strategy adaptive search

Mathematics Subject Classification ID

Search theory (90B40)

Related Items (1)

A multi‐objective hybrid evolutionary search algorithm for parallel production line balancing problem including disassembly and assembly tasks

Cites Work

• Unnamed Item
• Variable neighborhood search for the second type of two-sided assembly line balancing problem
• Variable neighborhood search
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• A variable neighborhood search algorithm for the capacitated vehicle routing problem
• Branch, bound and remember algorithm for two-sided assembly line balancing problem
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
• A survey on problems and methods in generalized assembly line balancing
• An Algorithm for the Line Balancing Problem

This page was built for publication: A novel variable neighborhood strategy adaptive search for SALBP-2 problem with a limit on the number of machine's types