A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem.
Bencomo Domínguez-MartínHipólito Hernández-PérezJorge Riera-LedesmaInmaculada Rodríguez MartínPublished in: Comput. Oper. Res. (2024)
Keyphrases
- detection algorithm
- optimization algorithm
- dynamic programming
- learning algorithm
- computational complexity
- high accuracy
- improved algorithm
- preprocessing
- computational cost
- search space
- worst case
- neural network
- path planning
- experimental evaluation
- cost function
- np hard
- expectation maximization
- optimal solution
- objective function
- ant colony optimization
- similarity measure
- times faster
- data sets
- single pass