Combining Genetic Algorithm and Simulated Annealing Methods for Reconstructing HV-Convex Binary Matrices

摘要

In this paper, we consider the discrete tomography problem (DTP), namely reconstruction convex binary matrices from their row and column sums respectively H and V, RBM(H, V). This is reformulated as an integer programming problem. Since the problem is NP-complete, a new hybrid genetic algorithm with simulated annealing algorithm is proposed to find an approximate solution.