Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem.
Eduardo Lalla-RuizBelén Melián-BatistaJ. Marcos Moreno-VegaPublished in: Eng. Appl. Artif. Intell. (2012)
Keyphrases
- tabu search
- artificial intelligence
- simulated annealing
- metaheuristic
- path relinking
- scheduling problem
- vehicle routing problem
- feasible solution
- simulated annealing and tabu search
- test problems
- quadratic assignment problem
- memetic algorithm
- genetic algorithm
- search algorithm
- job shop scheduling problem
- search procedure
- hybrid algorithm
- iterated local search
- heuristic methods
- benchmark instances
- initial solution
- tabu search algorithm
- multi start
- max sat
- multidimensional knapsack problem
- candidate list
- tabu list
- knapsack problem
- scatter search
- evolutionary algorithm
- global optimization
- job shop
- solution quality
- solution space