General VNS for asymmetric vehicle routing problem with time and capacity constraints.
Luka MatijevicVladimir IlinTatjana DavidovicTatjana Jaksic KrügerPanos M. PardalosPublished in: Comput. Oper. Res. (2024)
Keyphrases
- vehicle routing problem
- metaheuristic
- variable neighborhood search
- capacity constraints
- tabu search
- hybrid metaheuristic
- special case
- traveling salesman problem
- routing problem
- np hard
- benchmark problems
- combinatorial optimization problems
- minimum cost
- combinatorial optimization
- path relinking
- pick up and delivery
- neural network
- scatter search
- single machine scheduling problem
- benchmark instances
- heuristic methods
- shortest path
- reinforcement learning