A branch-and-cut approach for the vehicle routing problem with loading constraints.
Pedro Henrique Del Bianco HokamaFlávio Keidi MiyazawaEduardo C. XavierPublished in: Expert Syst. Appl. (2016)
Keyphrases
- vehicle routing problem
- metaheuristic
- tabu search
- routing problem
- vehicle routing
- vehicle routing problem with time windows
- benchmark problems
- hybrid metaheuristic
- np hard
- traveling salesman problem
- travel time
- multi depot
- memetic algorithm
- test instances
- benchmark instances
- iterated local search
- combinatorial optimization
- information retrieval
- neighborhood search
- search strategies
- particle swarm optimization
- pick up and delivery
- logistics distribution
- co occurrence
- variable neighborhood search
- linear programming
- constraint satisfaction
- constraint programming