Solving the 3-D Yard Allocation Problem for Break Bulk Cargo via Variable Neighborhood Search Branching.
Maurizio BruglieriEliane GerzeljAndrea GuenzaniRoberto MajaRodrigo de Alvarenga RosaPublished in: Electron. Notes Discret. Math. (2015)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- minimum spanning tree
- traveling salesman problem
- heuristic methods
- vehicle routing problem
- search procedure
- hybrid method
- single machine scheduling problem
- routing problem
- branch and bound
- genetic algorithm
- combinatorial optimization
- constraint satisfaction problems
- optimization problems
- multi objective