A Bi-Objective Vehicle Routing Problem Considering Distributors' Satisfaction Using Genetic Algorithm and Simulated Annealing.
Mohammad Taghi TaghavifardPublished in: Int. J. Strateg. Decis. Sci. (2016)
Keyphrases
- bi objective
- vehicle routing problem
- genetic algorithm and simulated annealing
- routing problem
- metaheuristic
- ant colony optimization
- knapsack problem
- multi objective
- efficient solutions
- tabu search
- ant colony optimisation
- traveling salesman problem
- neural network
- memetic algorithm
- combinatorial optimization problems
- test instances
- multi objective optimization
- particle swarm optimization
- network design
- shortest path problem
- benchmark problems
- benchmark instances
- travel time
- combinatorial optimization
- multiple objectives
- optimization problems
- simulated annealing
- np hard
- aco algorithm
- variable neighborhood search
- genetic algorithm
- search strategies
- scatter search
- ant colony
- swarm intelligence
- pick up and delivery
- objective function
- ant colony algorithm
- nsga ii
- path relinking
- dynamic programming
- evolutionary algorithm