An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem.
Guillaume MarquèsRuslan SadykovJean-Christophe DeschampsRémy DupasPublished in: Comput. Oper. Res. (2020)
Keyphrases
- cost function
- learning algorithm
- preprocessing
- experimental evaluation
- times faster
- dynamic programming
- computational cost
- k means
- detection algorithm
- simulated annealing
- worst case
- evolutionary algorithm
- recognition algorithm
- improved algorithm
- matching algorithm
- convex hull
- input data
- similarity measure
- high accuracy
- np hard
- objective function
- mobile robot
- particle swarm optimization
- significant improvement
- computational complexity
- combinatorial optimization
- search algorithm
- convergence rate
- data structure