A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles.
Ferdinand MühlbauerPirmin FontainePublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- neighbourhood search
- vehicle routing problem
- tabu search
- metaheuristic
- test instances
- vehicle routing
- routing problem
- benchmark instances
- traveling salesman problem
- benchmark problems
- multi depot
- vehicle routing problem with time windows
- combinatorial optimization
- tree search algorithm
- memetic algorithm
- iterated local search
- hybrid metaheuristic
- logistics distribution
- np hard
- travel time
- supply chain
- particle swarm optimization
- pick up and delivery
- neural network
- knapsack problem
- optimization problems
- genetic algorithm
- search strategies
- neighborhood search
- information retrieval systems
- simulated annealing
- scheduling problem
- multi objective
- vehicle routing problem with simultaneous