A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities.
Paolo GianessiAlberto CeselliLucas LétocartRoberto Wolfler CalvoPublished in: Electron. Notes Discret. Math. (2016)
Keyphrases
- vehicle routing problem
- dynamic programming
- np hard
- benchmark problems
- particle swarm optimization
- optimization algorithm
- vehicle routing problem with time windows
- hybrid algorithm
- search strategy
- combinatorial optimization
- cost function
- computational complexity
- search space
- search algorithm
- neural network
- worst case
- convex hull
- memetic algorithm
- job shop scheduling problem
- objective function