Modified savings heuristics and genetic algorithm for bi-objective vehicle routing problem with forced backhauls.
S. P. AnbuudayasankarK. GaneshS. C. Lenny KohYves DucqPublished in: Expert Syst. Appl. (2012)
Keyphrases
- vehicle routing problem
- bi objective
- metaheuristic
- ant colony optimization
- genetic algorithm
- multi objective
- routing problem
- tabu search
- hybrid metaheuristic
- heuristic methods
- efficient solutions
- traveling salesman problem
- multi objective optimization
- hybrid genetic algorithm
- hyper heuristics
- simulated annealing
- particle swarm optimization
- evolutionary algorithm
- knapsack problem
- search methods
- combinatorial optimization problems
- optimization problems
- search strategies
- nsga ii
- benchmark instances
- scatter search
- memetic algorithm
- optimization algorithm
- hybrid algorithm
- multiple objectives
- search algorithm
- test instances
- benchmark problems
- travel time
- path relinking
- fitness function
- optimal solution
- network design
- exact algorithms
- neural network
- neighborhood search
- nature inspired
- search space
- job shop scheduling problem
- combinatorial optimization
- np hard
- heuristic search
- shortest path problem
- crossover operator
- cost function
- test problems
- vehicle routing problem with simultaneous
- linear programming
- genetic programming
- differential evolution
- mutation operator
- global optimization
- feasible solution
- search strategy
- search procedure