A hybrid metaheuristic approach for the capacitated arc routing problem

@article{Chen2016AHM,
  title={A hybrid metaheuristic approach for the capacitated arc routing problem},
  author={Yuning Chen and Jin-Kao Hao and Fred W. Glover},
  journal={European Journal of Operational Research},
  year={2016},
  volume={253},
  pages={25-39}
}
The capacitated arc routing problem (CARP) is a difficult combinatorial optimization problem that has been intensively studied in the last decades. We present a hybrid metaheuristic approach (HMA) to solve this problem which incorporates an effective local refinement procedure, coupling a randomized tabu thresholding procedure with an infeasible descent procedure, into the memetic framework. Other distinguishing features of HMA include a specially designed route-based crossover operator for… CONTINUE READING
BETA

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS

Heuristic search to the capacitated clustering problem

  • European Journal of Operational Research
  • 2019
VIEW 2 EXCERPTS
CITES BACKGROUND

Two phased hybrid local search for the periodic capacitated arc routing problem

  • European Journal of Operational Research
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 33 REFERENCES

Cooperative Coevolution With Route Distance Grouping for Large-Scale Capacitated Arc Routing Problems

  • IEEE Transactions on Evolutionary Computation
  • 2014
VIEW 13 EXCERPTS
HIGHLY INFLUENTIAL

Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems

  • IEEE Transactions on Evolutionary Computation
  • 2009
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

The case for strategic oscillation

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL