Solving vehicle routing problem by using improved genetic algorithm for optimal solution.
Mazin Abed MohammedMohd Khanapi Abd GhaniRaed Ibraheem HamedSalama A. MostafaMohd Sharifuddin AhmadDheyaa Ahmed IbrahimPublished in: J. Comput. Sci. (2017)
Keyphrases
- vehicle routing problem
- metaheuristic
- optimal solution
- genetic algorithm
- combinatorial optimization
- tabu search
- hybrid metaheuristic
- simulated annealing
- np hard
- ant colony optimization
- vehicle routing problem with simultaneous
- vehicle routing problem with time windows
- routing problem
- vehicle routing
- optimization problems
- search space
- scatter search
- discrete particle swarm optimization
- feasible solution
- travel time
- test instances
- knapsack problem
- particle swarm optimization
- memetic algorithm
- branch and bound algorithm
- branch and bound
- nature inspired
- variable neighborhood search
- hybrid algorithm
- search methods
- benchmark problems
- multi depot
- traveling salesman problem
- lower bound
- multi objective
- fitness function
- genetic programming
- path relinking
- objective function
- logistics distribution
- evolutionary algorithm
- job shop scheduling problem
- exact solution
- test problems
- solution quality
- upper bound
- information retrieval systems
- genetic operators
- heuristic methods
- linear programming
- search algorithm
- search strategies