Deadline-constrained multi-commodity flow routing and scheduling optimization with consideration of edge lengths and capacities.
Yu WangRui KangLinhan GuoChao ZhangJianhui DengPengpeng LiuMeilin WenTian LePublished in: Comput. Ind. Eng. (2024)
Keyphrases
- multi commodity
- max min
- network flow problem
- facility location
- heuristic solution
- scheduling algorithm
- miller tucker zemlin
- min max
- scheduling problem
- minimum cost
- optimization problems
- response time
- minimal cost
- genetic algorithm
- robust optimization
- network flow
- knapsack problem
- network design
- optimization model
- hill climbing
- routing problem
- optimization process
- decision makers
- np hard
- computational complexity
- neural network