Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion.
Weishi ShaoDechang PiZhongshi ShaoPublished in: Appl. Soft Comput. (2017)
Keyphrases
- memetic algorithm
- tabu search
- gray value
- genetic algorithm
- orientation histogram
- timetabling problem
- job shop scheduling problem
- combinatorial optimization
- assembly line balancing
- gradient magnitude
- edge detection
- undirected graph
- disjoint paths
- benchmark instances
- evolutionary computation
- vehicle routing problem
- edge information
- edge weights
- gray level
- crossover operator
- weighted graph
- intensity variations
- simulated annealing
- neural network
- fitness function
- graph structure
- directed graph
- mean shift
- color distribution
- fuzzy logic
- evolutionary algorithm
- edge detector
- lower bound
- computational complexity
- search algorithm