Greedy Heuristics Adapted for the Multi-commodity Pickup and Delivery Traveling Salesman Problem.
Mithun GouthamStephanie StockarPublished in: CoRR (2023)
Keyphrases
- greedy heuristics
- multi commodity
- facility location
- heuristic solution
- max min
- scheduling problem
- set cover
- network flow problem
- network flow
- optimal solution
- miller tucker zemlin
- network design
- np hard
- integer programming
- mixed integer
- network design problem
- knapsack problem
- greedy algorithm
- lower bound
- lagrangian relaxation
- min max
- approximation algorithms
- mathematical model
- tabu search