An Approach to Solve the Heterogeneous Fixed Fleet Vehicle Routing Problem With Time Window Based on Adaptive Large Neighborhood Search Meta-Heuristic.
Vítor G. PereiraOmir C. Alves-JuniorFabiano BaldoPublished in: IEEE Trans. Intell. Transp. Syst. (2024)
Keyphrases
- vehicle routing problem
- metaheuristic
- tabu search
- simulated annealing
- mathematical programming
- scatter search
- combinatorial optimization problems
- search space
- optimization problems
- ant colony optimization
- combinatorial optimization
- vehicle routing problem with time windows
- routing problem
- optimal solution
- vehicle routing
- iterated local search
- genetic algorithm
- hybrid metaheuristic
- benchmark instances
- test instances
- particle swarm optimization
- search methods
- combinatorial problems
- guided local search
- memetic algorithm
- path relinking
- travel time
- nature inspired
- solution space
- evolutionary algorithm
- benchmark problems
- logistics distribution
- constraint satisfaction
- hyper heuristics
- variable neighborhood search
- traveling salesman problem
- cost function
- heuristic search
- multi start
- hybrid algorithm
- feasible solution