Optimizing a bi-objective vehicle routing problem that appears in industrial enterprises.
Ana Dolores López-SánchezJulián MolinaManuel LagunaAlfredo García Hernández-DíazPublished in: Expert Syst. J. Knowl. Eng. (2021)
Keyphrases
- search methods
- vehicle routing problem
- metaheuristic
- bi objective
- ant colony optimization
- reverse logistics
- routing problem
- tabu search
- search strategies
- optimization problems
- combinatorial optimization problems
- simulated annealing
- efficient solutions
- multi objective
- search space
- vehicle routing problem with time windows
- combinatorial optimization
- vehicle routing
- traveling salesman problem
- scatter search
- particle swarm optimization
- search algorithm
- path relinking
- knapsack problem
- hybrid metaheuristic
- genetic algorithm
- benchmark instances
- shortest path problem
- network design
- travel time
- multi objective optimization
- benchmark problems
- evolutionary algorithm
- neighborhood search
- memetic algorithm
- multi depot
- multiple objectives
- nsga ii
- variable neighborhood search
- objective function
- test problems
- np hard
- linear programming
- cost function
- greedy randomized adaptive search procedure