A branch and cut algorithm for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads.
Temel ÖncanDilek Tuzun AksuGüvenç SahinMustafa SahinPublished in: IEEM (2011)
Keyphrases
- dynamic programming
- detection algorithm
- computational complexity
- theoretical analysis
- computational cost
- experimental evaluation
- learning algorithm
- times faster
- improved algorithm
- high accuracy
- np hard
- k means
- worst case
- cost function
- input data
- computationally efficient
- preprocessing
- selection algorithm
- path planning
- real time
- convergence rate
- single pass
- hough transform
- segmentation algorithm
- simulated annealing
- similarity measure