Solving real urban VRPTW instances by applying a Branch-Cut-and-Price via VRPsolver.
Thailsson ClementinoJuan RosasRosiane de FreitasEduardo UchoaPublished in: CLEI (2022)
Keyphrases
- initial solution
- vehicle routing problem with time windows
- families of valid inequalities
- waste collection
- np complete problems
- timetabling problem
- tabu search
- memetic algorithm
- vehicle routing problem
- stochastic local search
- exact solution
- public transport
- lower bound
- urban areas
- routing problem
- randomly generated
- integer programming
- metaheuristic