Time-space network model and MILP formulation of the conflict-free routing problem of a capacitated AGV system.
Keisuke MurakamiPublished in: Comput. Ind. Eng. (2020)
Keyphrases
- routing problem
- network model
- conflict free
- set partitioning
- vehicle routing problem
- multi period
- mixed integer linear
- multicommodity flow
- functional dependencies
- mixed integer linear programming
- routing algorithm
- travel time
- linear program
- neural network
- global optimization
- shortest path
- traveling salesman problem
- mixed integer
- search space
- genetic algorithm