The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach.
Pol Arias-MeliaJiyin LiuRupal MandaniaPublished in: Comput. Oper. Res. (2022)
Keyphrases
- heuristic solution
- multi commodity
- feasible solution
- network design
- optimal solution
- network design problem
- lower bound
- mixed integer linear
- knapsack problem
- linear program
- mixed integer linear programming
- exhaustive search
- branch and bound
- linear programming
- tabu search
- branch and bound algorithm
- approximation algorithms
- cutting plane
- upper bound
- communication networks
- dynamic programming
- cost function
- reinforcement learning