A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds.
Mario Rodríguez-MolinsMiguel A. SalidoFederico BarberPublished in: Appl. Intell. (2014)
Keyphrases
- quay crane
- tabu search
- metaheuristic
- scheduling problem
- parallel genetic algorithm
- container terminal
- np hard
- genetic algorithm
- iterated local search
- path relinking
- scatter search
- quay cranes
- optimal solution
- simulated annealing
- ant colony optimization
- vehicle routing problem
- feasible solution
- grasp with path relinking
- optimization problems
- multi start
- search space
- combinatorial optimization
- benchmark instances
- memetic algorithm
- job shop scheduling problem
- flowshop
- search procedure
- particle swarm optimization
- variable neighborhood search
- lower bound
- swarm intelligence
- nature inspired
- guided local search
- greedy randomized adaptive search procedure
- set of benchmark instances
- hyper heuristics
- evolutionary algorithm
- heuristic methods
- integer programming
- approximation algorithms
- max sat
- metaheuristic algorithms
- hybrid metaheuristic
- solution space
- traveling salesman problem
- neural network