A districting-based heuristic for the coordinated capacitated arc routing problem.
Sanne WøhlkGilbert LaportePublished in: Comput. Oper. Res. (2019)
Keyphrases
- lower and upper bounds
- lower bound
- cooperative
- memetic algorithm
- greedy heuristic
- optimal solution
- simulated annealing
- case study
- bin packing
- beam search
- packing problem
- routing problem
- search algorithm
- path planning
- feasible solution
- scheduling problem
- dynamic programming
- heuristic methods
- np hard
- multiresolution
- voronoi diagram
- depth first search
- timetabling problem
- multi agent
- database