A metaheuristic algorithm for a locomotive routing problem arising in the steel industry.
Baobin HuangLixin TangRoberto BaldacciGongshu WangDefeng SunPublished in: Eur. J. Oper. Res. (2023)
Keyphrases
- routing problem
- metaheuristic
- simulated annealing
- scatter search
- optimal solution
- vehicle routing problem
- search space
- combinatorial optimization
- dynamic programming
- cost function
- benchmark problems
- np hard
- theoretical analysis
- ant colony optimization
- harmony search
- vehicle routing problem with time windows
- particle swarm optimization
- tabu search
- computational complexity
- path relinking
- objective function
- guided local search
- benchmark instances
- optimization algorithm
- linear programming
- optimization problems
- search algorithm