Initialization of metaheuristics: comprehensive review, critical analysis, and research directions

Sarhani, Malek; Voß, Stefan; Jovanović, Raka

doi:10.1111/itor.13237

Cited by 28 publications

(9 citation statements)

References 168 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Thus, in this case, it is necessary to develop a robust scheduling scheme (Rodrigues and Agra, 2024). In addition, the adoption of matheuristic methods (Boschetti et al., 2023) and metaheuristics (Sarhani et al., 2023) to exploit the model formulation are also valuable studies when faced with large‐scale problems.…”

Section: Discussionmentioning

confidence: 99%

Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders

Liu,

Wang,

Xie

2024

Int Trans Operational Res

View full text Add to dashboard Cite

As the prefabrication construction method plays an increasingly important role in the construction of cross‐sea bridges, coordinating the schedule between off‐site prefabrication and on‐site assembly becomes crucial and challenging. This paper studies a just‐in‐time single‐machine scheduling problem with due windows and release dates, which originates from the production and supply process of large segments of precast steel box girders in bridge construction. To solve this problem, we equivalently decompose it into the independent and same type of subproblems and formulate a mixed‐integer linear mathematical programming model. Furthermore, we propose a branch‐and‐bound algorithm with the initialization of a novel linear early and tardy dispatching rule with due windows to solve the problem exactly. The dispatching rule, based on the local dominance criteria with due windows, is designed and used to improve the upper bound. Moreover, a lower bound is obtained by further decomposing and relaxing the subproblems. Finally, the parameter of the dispatching rule is calibrated, and the best search strategy of the branch‐and‐bound algorithm is determined. The comprehensive computational experiments carried out show the efficiency and effectiveness of the proposed branch‐and‐bound algorithm.

show abstract

Section: Discussionmentioning

confidence: 99%

Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders

Liu,

Wang,

Xie

2024

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…Die Wahl der Startlösung beeinflusst bei Metaheuristiken signifikant die Güte des gefundenen (globalen) Optimums [36] für jede der beiden Wabenstrukturen gemäß Abschn. 4 erzeugt und die Metaheuristiken 1000-mal durchgeführt.…”

Section: Startlösungunclassified

Toleranzfreie Montage modularer Betontragwerke

Stindt,

Frey,

Forman

et al. 2023

Bautechnik

View full text Add to dashboard Cite

Modulare Tragwerke erfordern maßhaltige Bauteile, da große prozess‐ oder materialbedingte Maßabweichungen bei einzelnen Modulen die Montage zur Gesamtstruktur verhindern. Im Beitrag wird dazu eine Methode zur optimalen Platzierung auf Basis von Metaheuristiken vorgestellt. Sie hilft kostenintensive Nacharbeitungen zu vermeiden. Das Konzept wird auf Wabenstrukturen angewendet, in denen die einzelnen Module durch Permutation getauscht werden. Mit dem sog. Tabu Search und dem Simulated Annealing werden methodisch zwei Lösungsverfahren verwendet. Dazu werden die maximalen Knotenabweichungen der assemblierten Module mit einer direkten Kinematik ermittelt und mit dem zulässigen Nennlochspiel von Schraubenverbindungen verglichen, um die Montierbarkeit der Module zu beurteilen. Berücksichtigt werden zum einen Toleranzen aus dem Schwinden des Betons und zum anderen solche aus den Produktionsschritten der Fertigung. Im Vergleich zu einer zufälligen Anordnung der Module gelingt die Reduzierung maximaler Knotenabweichungen von 9 mm auf das normierte Nennlochspiel von 3 mm mithilfe der Metaheuristiken. Wabenstrukturen mit einer Breite von ca. 7 m und einer Höhe bis 45 m, die besonders sensitiv hinsichtlich der Montierbarkeit sind, benötigen damit keine Nacharbeit mehr. Dabei erweist sich der Tabu Search mit sechsmal weniger Rechenzeit und bis zu 24 % geringeren zu kompensierenden Abweichungen als der deutlich effizientere Lösungsalgorithmus. Ein Beispiel zeigt die praktische Anwendung.

show abstract

“…On the other hand, its solution initialization component relies on random permutations of customers. An adequate balance of diversification and intensification in the initialization of metaheuristics can also be crucial for their performance [49]. Therefore, we saw a research direction with great potential for improvement in this gap.…”

Section: Introductionmentioning

confidence: 99%

An improved hybrid genetic search with data mining for the CVRP

Maia,

Plastino,

Souza

2024

Networks

View full text Add to dashboard Cite

The hybrid genetic search (HGS) metaheuristic has produced outstanding results for several variants of the vehicle routing problem. A recent implementation of HGS specialized to the capacitated vehicle routing problem (CVRP) is a state‐of‐the‐art method for this variant. This paper proposes an improved HGS for the CVRP obtained by incorporating a new solution generation method into its (re‐)initialization process to guide the search more efficiently and effectively. The solution generation method introduced in this work combines an approach based on frequent patterns extracted from good solutions by a data mining process and a randomized version of the Clarke and Wright savings heuristic. As observed in our experimental comparison, the proposed method significantly outperforms the original algorithm regarding the final gap to the best known solutions and the primal integral.

show abstract

Initialization of metaheuristics: comprehensive review, critical analysis, and research directions

Cited by 28 publications

References 168 publications

Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders

Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders

Toleranzfreie Montage modularer Betontragwerke

An improved hybrid genetic search with data mining for the CVRP

Contact Info

Product

Resources

About