Approximate solutions for the capacitated arc routing problem.
Wen Lea PearnPublished in: Comput. Oper. Res. (1989)
Keyphrases
- approximate solutions
- lower bound
- np hard
- exact solution
- memetic algorithm
- optimal solution
- hard optimization problems
- lower and upper bounds
- energy function
- upper bound
- routing problem
- artificial intelligence
- tabu search
- np complete
- computer vision
- neural network
- constraint satisfaction problems
- learning strategies
- graph cuts
- genetic programming
- special case
- reinforcement learning
- image processing
- feature selection