An Ant Colony Optimization for the Capacitated Arc Routing Problem

@inproceedings{Tsai2016AnAC,
  title={An Ant Colony Optimization for the Capacitated Arc Routing Problem},
  author={Han-Shiuan Tsai and Ching-Jung Ting},
  year={2016}
}
The capacitated arc routing problem (CARP) is a difficult combinatorial optimization problem which has wide applicability in real world logistics problems. The CARP is to find a set of routes with minimum costs for a set of demand arcs with vehicle capacity limitations. Due to its NP-hard property, CARP cannot be solved within reasonable time by an exact algorithm. In recent years, metaheuristics algorithms have been developed to solve the CAPR. In this research, we propose an ant colony… CONTINUE READING

References

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

Ant Colony Optimization

  • Handbook of Approximation Algorithms and Metaheuristics
  • 2004
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Ant system: optimization by a colony of cooperating agents

  • IEEE Trans. Systems, Man, and Cybernetics, Part B
  • 1996
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…