A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks.
Jean-François CôtéClaudia ArchettiMaria Grazia SperanzaMichel GendreauJean-Yves PotvinPublished in: Networks (2012)
Keyphrases
- experimental evaluation
- recognition algorithm
- high accuracy
- cost function
- detection algorithm
- improved algorithm
- preprocessing
- matching algorithm
- optimal solution
- np hard
- dynamic programming
- classification algorithm
- theoretical analysis
- worst case
- memory requirements
- estimation algorithm
- single pass
- computationally efficient
- particle swarm optimization
- machine learning
- search space
- artificial neural networks
- computational complexity
- video sequences
- multiscale
- decision trees