Abstract: We study the circular packing problem (CPP) which consists of packing a set of circles of known radii into a larger containing circle without overlapping. The objective is to determine the ...

Abstract: We present a hybrid algorithm called parallel simulated annealing with a greedy algorithm (PSAGA) to learn Bayesian network structures. This work focuses on simulated annealing and its ...

Solving complex optimization problems is central to many modern technologies, from logistics and financial modeling to chip ...

The traveling salesman problem (TSP) asks the question, "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to ...

In Hu et al. (2012), the AHP ranking weights were optimally calculated by a simulated annealing algorithm, and the literature (Xiao et al., 2022; Liu et al., 2013) optimizes the AHP by means of a ...

According to ROHM's announcement, the implemented system combines optimization algorithms that leverage Quanmatic's quantum and classical computing technologies with the manufacturing know-how and ...

A Lightweight and User-Friendly EoH Framework for LLM-driven Automated Algorithm/Heuristic Design Heuristics are indispensable for tackling complex search and optimization problems. However, manual ...