A multi-agent genetic algorithm with variable neighborhood search for resource investment project scheduling problems.
Xiaoxiao YuanJing LiuMartin O. WimmersPublished in: CEC (2015)
Keyphrases
- variable neighborhood search
- tabu search
- scheduling problem
- genetic algorithm
- job shop scheduling problem
- multi agent
- benchmark instances
- metaheuristic
- simulated annealing
- path relinking
- flowshop
- feasible solution
- vehicle routing problem
- single machine
- memetic algorithm
- heuristic methods
- np hard
- job shop
- search procedure
- reinforcement learning
- hybrid algorithm
- scatter search
- resource allocation
- traveling salesman problem
- search algorithm
- ant colony optimization
- hybrid method
- optimization problems
- minimum spanning tree
- single machine scheduling problem
- squeaky wheel
- processing times
- genetic algorithm ga
- multi objective
- genetic programming
- graph model
- routing problem
- parallel machines
- computational complexity
- lower bound
- evolutionary algorithm
- neural network
- precedence constraints
- resource consumption
- fitness function
- optimal solution
- upper bound