Solving the open vehicle routing problem with capacity and distance constraints with a biased random key genetic algorithm.
Efrain RuizValeria Soto-MendozaAlvaro Ernesto Ruiz BarbosaRicardo ReyesPublished in: Comput. Ind. Eng. (2019)
Keyphrases
- vehicle routing problem
- metaheuristic
- genetic algorithm
- tabu search
- hybrid metaheuristic
- combinatorial optimization
- vehicle routing
- vehicle routing problem with simultaneous
- benchmark problems
- combinatorial problems
- simulated annealing
- routing problem
- initial population
- vehicle routing problem with time windows
- memetic algorithm
- particle swarm optimization
- travel time
- test instances
- multi depot
- traveling salesman problem
- evolutionary algorithm
- ant colony optimization
- multi objective
- fitness function
- path relinking
- search strategies
- integer program
- job shop scheduling problem
- np hard
- constraint satisfaction
- greedy randomized adaptive search procedure
- timetabling problem
- variable neighborhood search
- scatter search
- optimal solution
- differential evolution algorithm
- linear programming
- optimization problems
- search space
- feasible solution
- differential evolution
- heuristic search
- genetic algorithm ga
- optimization algorithm
- genetic programming
- scheduling problem