A Branch-and-Cut-and-Price algorithm for the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities.
Andrea BettinelliValentina CacchianiTeodor Gabriel CrainicDaniele VigoPublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- preprocessing
- learning algorithm
- cost function
- k means
- dynamic programming
- detection algorithm
- experimental evaluation
- similarity measure
- times faster
- matching algorithm
- search space
- np hard
- recognition algorithm
- data mining
- classification algorithm
- segmentation algorithm
- particle swarm optimization
- computational cost
- computational complexity
- optimal solution
- graph cuts
- high accuracy
- optimization algorithm
- special case
- knapsack problem
- genetic algorithm