Multiple Hungarian Method for k-Assignment Problem

Abstract

The k-assignment problem (or, the k-matching problem) on k-partite graphs is an NP-hard problem for k≥3. In this paper we introduce five new heuristics. Two algorithms, Bm and Cm, arise as natural improvements of Algorithm Am from (He et al., in: Graph Algorithms And Applications 2, World Scientific, 2004). The other three algorithms, Dm, Em, and Fm, incorporate randomization. Algorithm Dm can be considered as a greedy version of Bm, whereas Em and Fm are versions of local search algorithm, specialized for the k-matching problem. The algorithms are implemented in Python and are run on three datasets. On the datasets available, all the algorithms clearly outperform Algorithm Am in terms of solution quality. On the first dataset with known optimal values the average relative error ranges from 1.47% over optimum (algorithm Am) to 0.08% over optimum (algorithm Em). On the second dataset with known optimal values the average relative error ranges from 4.41% over optimum (algorithm Am) to 0.45% over optimum (algorithm Fm). Better quality of solutions demands higher computation times, thus the new algorithms provide a good compromise between quality of solutions and computation time.

Intelligent Integrated System for Fruit Detection Using Multi-UAV Imaging and Deep Learning

“…The filter considers the motion state of each object from the previous frame to provide insights into the movement model of the structural object in the current video frame, leading to an optimal estimation of the motion state across the sequence of frames. To facilitate this, the Hungarian algorithm [ 40 ] is utilized to calculate the distance matrices between the related coordinates of the detected object locations and the predicted locations from the previous video frame. This calculation considers the variations in input variables and their mutual correlation.…”

Solusi Optimal Masalah Penugasan Menggunakan Metode Alternatif Hungarian

“…Metode hungarian merupakan metode yang memodifikasi baris dan kolom dalam matriks efektivitas hingga komponen nol tunggal muncul di setiap baris atau kolom yang dapat dipilih sebagai alokasi penugasan [14], [15]. Langkah-langkah metode hungarian sebagai berikut [16], [17]: 1) Cek tabel penugasan apakah seimbang atau tidak. Jika tak seimbang, tambahkan dummy.…”

Calibration of a Hybrid Machine Tool from the Point of View of Positioning Accuracy

“…In this way, a good compromise solution that has proven to be applicable to the production of machine tools, manipulation systems, and industrial robots is provided. Examples of successful applications of hybrid mechanisms [12] include Tricept [13], Execon [13], Ecospeed [14], Geodetic Hexapod [15], and George V [16].…”