Variable neighborhood search for minimum cost berth allocation.
Pierre HansenCeyda OguzNenad MladenovicPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- minimum cost
- variable neighborhood search
- minimum spanning tree
- spanning tree
- container terminal
- metaheuristic
- np hard
- tabu search
- approximation algorithms
- traveling salesman problem
- vehicle routing problem
- routing problem
- network flow
- heuristic methods
- network flow problem
- benchmark instances
- single machine scheduling problem
- hybrid method
- path relinking
- optimal solution
- search procedure
- undirected graph
- combinatorial optimization
- resource allocation
- linear programming
- combinatorial auctions
- edge weights
- ant colony optimization
- optimization problems
- scheduling problem
- special case
- search algorithm
- genetic algorithm