Combining genetic algorithm and simulated annealing methods for reconstructing HV-convex binary matrices
| dc.contributor.author | Mohamed, Hadded | |
| dc.contributor.author | Hamadi, Hasni | |
| dc.date.accessioned | 2023-04-14T06:46:49Z | |
| dc.date.accessioned | 2023-08-19T08:21:27Z | |
| dc.date.available | 2023-04-14T06:46:49Z | |
| dc.date.available | 2023-08-19T08:21:27Z | |
| dc.date.issued | 2013 | |
| dc.description.abstract | In this paper, we consider the discret 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. | en_US |
| dc.identifier.citation | Mohamed, H., & Hamadi, H. (2013). Combining genetic algorithm and simulated annealing methods for reconstructing HV-convex binary matrices. In Hybrid Metaheuristics: 8th International Workshop, HM 2013, Ischia, Italy, May 23-25, 2013. Proceedings 8 (pp. 78-91). Springer Berlin Heidelberg. | en_US |
| dc.identifier.doi | https://doi.org/10.1007/978-3-642-38516-2_7 | |
| dc.identifier.uri | https://edms.wexl.in/handle/1/4527 | |
| dc.language.iso | en | en_US |
| dc.publisher | Springer Link | en_US |
| dc.subject | Discret tomography | en_US |
| dc.subject | Convex binary matrix | en_US |
| dc.subject | Integer programming | en_US |
| dc.subject | Genetic algorithm | en_US |
| dc.subject | Simulated annealing | en_US |
| dc.subject | NP-complete | en_US |
| dc.title | Combining genetic algorithm and simulated annealing methods for reconstructing HV-convex binary matrices | en_US |
| dc.title.alternative | Conference paper | en_US |
| dc.type | Conference Paper | en_US |
Files
License bundle
1 - 1 of 1