Heuristic and metaheuristic solutions of pickup and delivery problem for self-driving taxi routing.
Viacheslav ShalamovAndrey FilchenkovAnatoly ShalytoPublished in: Evol. Syst. (2019)
Keyphrases
- metaheuristic
- iterated local search
- benchmark instances
- optimal solution
- tabu search
- guided local search
- variable neighborhood search
- simulated annealing
- path relinking
- variable neighbourhood search
- initial solution
- suboptimal solutions
- vehicle routing problem
- hyper heuristics
- solution space
- combinatorial optimization
- grasp with path relinking
- scatter search
- multi start
- combinatorial problems
- ant colony optimization
- optimization problems
- constructive heuristic
- search methods
- routing problem
- search space
- feasible solution
- solution quality
- metaheuristic algorithms
- search procedures
- search procedure
- set of benchmark instances
- genetic algorithm
- particle swarm optimization
- benchmark problems
- test instances
- hybrid metaheuristic
- exact algorithms
- mip solver
- nature inspired
- vehicle routing problem with time windows
- np hard
- evolutionary algorithm
- heuristic methods
- threshold accepting
- lower bound
- branch and bound
- greedy randomized adaptive search procedure
- traveling salesman problem
- objective function
- flowshop
- linear programming
- dantzig wolfe
- memetic algorithm
- cost function
- job shop scheduling problem
- aco algorithms
- knapsack problem
- harmony search