A partial tours based path-scanning heuristic for the capacitated arc routing problem.
Badis BensediraAbdesslam LayebZakaria ZendaouiPublished in: PAIS (2022)
Keyphrases
- lower and upper bounds
- memetic algorithm
- lower bound
- minimum cost
- path finding
- image processing
- simulated annealing
- tabu search
- structured light
- endpoints
- combinatorial optimization
- constraint satisfaction
- shortest path
- dynamic programming
- timetabling problem
- optimal solution
- neural network
- scan data
- beam search
- search algorithm
- learning algorithm