Hybridisation of genetic algorithms and tabu search approach for reconstructing convex binary images from discrete orthogonal projections.
Mohamed HaddedFethi JarrayGhassen TligHamadi HasniPublished in: Int. J. Metaheuristics (2014)
Keyphrases
- tabu search
- binary images
- discrete tomography
- genetic algorithm
- convex sets
- simulated annealing
- metaheuristic
- discrete geometry
- thinning algorithm
- gray scale
- memetic algorithm
- connected components
- hybrid algorithm
- binary and gray scale
- path relinking
- feasible solution
- scheduling problem
- job shop scheduling problem
- mathematical morphology
- iterated local search
- search procedure
- search algorithm
- input image
- multidimensional knapsack problem
- heuristic methods
- morphological skeleton
- quadratic assignment problem
- parallel thinning algorithm
- convex hull
- combinatorial optimization
- search heuristics
- vehicle routing problem
- scatter search
- tabu list
- cell complexes
- ant colony optimization
- tabu search algorithm
- computer vision
- search space
- image segmentation
- initial solution
- evolutionary algorithm
- structuring elements
- simulated annealing and tabu search
- neural network
- translation invariant
- connected component labeling
- linear programming
- solution quality
- optimization problems