An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery.
Julian HofMichael SchneiderPublished in: Networks (2019)
Keyphrases
- vehicle routing problem
- path relinking
- metaheuristic
- tabu search
- greedy randomized adaptive search procedure
- scatter search
- traveling salesman problem
- neighborhood search
- optimization problems
- simulated annealing
- combinatorial optimization
- routing problem
- test instances
- variable neighborhood search
- nature inspired
- search space
- benchmark instances
- vehicle routing
- genetic algorithm
- ant colony optimization
- vehicle routing problem with time windows
- feasible solution
- memetic algorithm
- search procedure
- test problems
- search algorithm
- mathematical programming
- solution space
- optimal solution
- travel time
- max min
- benchmark problems
- job shop scheduling problem
- search methods
- heuristic methods
- evolutionary algorithm
- particle swarm optimization
- scheduling problem
- hill climbing
- search strategies
- objective function
- fitness function