A beam search algorithm for the biobjective container loading problem.
Ignacio ArayaMauricio MoyanoCristobal SanchezPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- bi objective
- search algorithm
- efficient solutions
- minimum cost flow
- multi objective
- set covering problem
- network design
- multi objective optimization
- multiple objectives
- ant colony optimization
- branch and bound
- knapsack problem
- search space
- shortest path problem
- search methods
- heuristic search
- tabu search
- special case
- evolutionary algorithm
- search procedure
- nsga ii
- routing problem