A branch-and-bound approach for AGV dispatching and routing problems in automated container terminals.
Zehao WangQingcheng ZengPublished in: Comput. Ind. Eng. (2022)
Keyphrases
- branch and bound
- routing problem
- container terminal
- depth first search
- flexible manufacturing systems
- lower bound
- branch and bound algorithm
- search algorithm
- column generation
- combinatorial optimization
- search space
- upper bound
- vehicle routing problem
- optimal solution
- tree search
- branch and bound procedure
- branch and bound method
- beam search
- vehicle routing problem with time windows
- lagrangian heuristic
- travel time
- routing algorithm
- traveling salesman problem
- shortest path
- scheduling problem
- search strategies
- cutting plane algorithm
- branch and bound search
- neural network
- max sat
- lower and upper bounds
- search tree
- global optimization
- quay crane scheduling