Author:
Raghestani Nikmal,Keßler Carsten
Publisher
Springer International Publishing
Reference25 articles.
1. Arakaki RK, Usberti FL (2018) Hybrid genetic algorithm for the open capacitated arc routing problem. Comput Oper Res 90:221–231.
https://doi.org/10.1016/j.cor.2017.09.020
,
http://www.sciencedirect.com/science/article/pii/S0305054817302502
2. Bodin LD, Golden BL, Assad AA, Ball MO (1981) The state of the art in the routing and scheduling of vehicles and crews. US Department of Transportation, Urban Mass Transportation Administration.
https://babel.hathitrust.org/cgi/pt?id=ien.35556021333117;view=1up;seq=13
3. Chapleau L, Ferland JA, Lapalme G, Rousseau JM (1984) A parallel insert method for the capacitated arc routing problem. Oper Res Lett 3(2):95–99. Accessed 04 Dec 2017
4. Christofides N (1973) The optimum traversal of a graph. Omega 1(6):719–732. Accessed 03 Dec 2017
5. Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to algorithms, 1st edn. MIT Press and McGraw-Hill