An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances

References

• Agafonkin V (2014) Leaflet: An open-source JavaScript library for mobile-friendly interactive maps. Accessed February 17, 2017, http://leafletjs.com/.Google Scholar
• Alertify (2014) AlertifyJS is a JavaScript framework for developing pretty browser dialogs and notifications. Accessed May 1, 2018, http://alertifyjs.com/.Google Scholar
• Anderson J, Soden R, Anderson KM, Kogan M, Palen L (2016) Epic-osm: A software framework for open street map data analytics. Bui TX, Sprague RH Jr, eds. System Sci. (HICSS), 2016 49th Hawaii Internat. Conf. System Sci. (IEEE, Koloa, HI), 5468–5477.Google Scholar
• Assad AA (2007) Leonhard Euler: A brief appreciation. Networks 49(3):190–198.Crossref, Google Scholar
• Balcik B, Beamon BM, Smilowitz K (2008) Last mile distribution in humanitarian relief. J. Intelligent Transportation Systems 12(2):51–63.Crossref, Google Scholar
• Barabási A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509–512.Crossref, Google Scholar
• Belenguer J-M, Benavent E, Lacomme P, Prins C (2006) Lower and upper bounds for the mixed capacitated arc routing problem. Comput. Oper. Res. 33(12):3363–3383.Crossref, Google Scholar
• Benavent E, Campos V, Corberán A, Mota E (1992) The capacitated arc routing problem: Lower bounds. Networks 22(7):669–690.Crossref, Google Scholar
• Benavent E, Carrotta A, Corberán A, Sanchis JM, Vigo D (2007) Lower bounds and heuristics for the windy rural postman problem. Eur. J. Oper. Res. 176(2):855–869.Crossref, Google Scholar
• Beullens P, Muyldermans L, Cattrysse D, Van Oudheusden D (2003) A guided local search heuristic for the capacitated arc routing problem. Eur. J. Oper. Res. 147(3):629–643.Crossref, Google Scholar
• Bostock M, Ogievetsky V, Heer J (2011) D3: Data-driven documents. IEEE Trans. Visualization Comput. Graphics 17(12):2301–2309.Google Scholar
• Brandão J, Eglese R (2008) A deterministic tabu search algorithm for the capacitated arc routing problem. Comput. Oper. Res. 35(4):1112–1126.Crossref, Google Scholar
• Cabral EA, Gendreau M, Ghiani G, Laporte G (2004) Solving the hierarchical Chinese postman problem as a rural postman problem. Eur. J. Oper. Res. 155(1):44–50.Crossref, Google Scholar
• Cline MS, Smoot M, Cerami E, Kuchinsky A, Landys N, Workman C, Christmas R, Avila-Campilo I, Creech M, Gross Bet al. (2007) Integration of biological networks and gene expression data using Cytoscape. Nature Protocols 2(10):2366–2382.Crossref, Google Scholar
• Constantino M, Gouveia L, Mourão MC, Nunes AC (2015) The mixed capacitated arc routing problem with non-overlapping routes. Eur. J. Oper. Res. 244(2):445–456.Crossref, Google Scholar
• Corberán Á, Laporte G (2013) Arc Routing: Problems, Methods, and Applications (SIAM, Philadelphia).Crossref, Google Scholar
• Corberán Á, Prins C (2010) Recent results on arc routing problems: An annotated bibliography. Networks 56(1):50–69.Crossref, Google Scholar
• Dahl R (2009) Node.js. Accessed January 10, 2017, https://s3.amazonaws.com/four.livejournal/20091117/jsconf.pdf.Google Scholar
• De Volder K (2006) jQuery: A generic code browser with a declarative configuration language. Proc. 8th Internat. Sympos. Practical Aspects Declarative Lang. (Springer, Berlin), 88–102.Google Scholar
• Eklund PW, Kirkby S, Pollitt S (1996) A dynamic multi-source Dijkstra’s algorithm for vehicle routing. Jain LC, Narasimhan VL, eds. Australian New Zealand Conf. Intelligent Inform. Systems (IEEE, Adelaide, Australia), 329–333.Google Scholar
• Erdos P, Rényi A (1960) On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5(1):17–60.Google Scholar
• Fernández E, Fontana D, Speranza MG (2016) On the collaboration uncapacitated arc routing problem. Comput. Oper. Res. 67(March):120–131.Crossref, Google Scholar
• Ghiani G, Improta G (2000) An algorithm for the hierarchical Chinese postman problem. Oper. Res. Lett. 26(1):27–32.Crossref, Google Scholar
• Göbelbecker M, Dornhege C (2009) Realistic cities in simulated environments—An open street map to robocup rescue converter. Fourth Internat. Workshop Synthetic Simulation Robotics Mitigate Earthquake Disaster (SRMED 2009), Graz, Austria.Google Scholar
• Golden BL, DeArmon JS, Baker EK (1983) Computational experiments with algorithms for a class of routing problems. Comput. Oper. Res. 10(1):47–59.Crossref, Google Scholar
• Gribkovskaia I, Halskau Ø, Laporte G (2007) The bridges of Königsberg: A historical perspective. Networks 49(3):199–203.Crossref, Google Scholar
• Haklay M, Weber P (2008) Open street map: User-generated street maps. IEEE Pervasive Comput. 7(4):12–18.Crossref, Google Scholar
• Jacomy M, Venturini T, Heymann S, Bastian M (2014) Forceatlas2: A continuous graph layout algorithm for handy network visualization designed for the gephi software. PloS ONE 9(6):e98679.Crossref, Google Scholar
• Jotshi A, Gong Q, Batta R (2009) Dispatching and routing of emergency vehicles in disaster mitigation using data fusion. Socio-Econom. Planning Sci. 43(1):1–24.Crossref, Google Scholar
• Kiilerich L, Wøhlk S (2018) New large-scale data instances for carp and new variations of carp. INFOR: Inform. Systems Oper. Res. 56(1):1–32.Crossref, Google Scholar
• Kiuchi M, Shinano Y, Hirabayashi R, Saruwatari Y (1995) An exact algorithm for the capacitated arc routing problem using parallel branch and bound method. Spring National Conf. Oper. Res. Soc. Japan, 28–29.Google Scholar
• Kofia V, Isserlin R, Buchan AMJ, Bader GD (2015) Social network: A cytoscape app for visualizing co-authorship networks. F1000Research 4(481), doi:10.12688/f1000research.6804.3.Google Scholar
• Korteweg P, Volgenant T (2006) On the hierarchical Chinese postman problem with linear ordered classes. Eur. J. Oper. Res. 169(1):41–52.Crossref, Google Scholar
• Kucera M, Isserlin R, Arkhangorodsky A, Bader GD (2016) Autoannotate: A cytoscape app for summarizing networks with semantic annotations. F1000Research 5(1717), doi:10.12688/f1000research.9090.1.Google Scholar
• Li LYO, Eglese RW (1996) An interactive algorithm for vehicle routing for winter–gritting. J. Oper. Res. Soc. 47(2):217–228.Google Scholar
• Maere S, Heymans K, Kuiper M (2005) Bingo: A Cytoscape plugin to assess overrepresentation of gene ontology categories in biological networks. Bioinformatics 21(16):3448–3449.Crossref, Google Scholar
• Maxemchuk NF (1987) Routing in the Manhattan street network. IEEE Trans. Comm. 35(5):503–512.Crossref, Google Scholar
• Montojo J, Zuberi K, Rodriguez H, Kazi F, Wright G, Donaldson SL, Morris Q, Bader GD (2010) Genemania Cytoscape plugin: Fast gene function predictions on the desktop. Bioinformatics 26(22):2927–2928.Crossref, Google Scholar
• Mourão MC, Pinto LS (2017) An updated annotated bibliography on arc routing problems. Networks 70(3):144–194.Crossref, Google Scholar
• Murray-Tuite P, Mahmassani H (2004) Methodology for determining vulnerable links in a transportation network. Transportation Res. Record: J. Transportation Res. Board 1882:88–96.Crossref, Google Scholar
• Otto M, Thornton J (2013) Bootstrap. Accessed February 22, 2017, http://getbootstrap.com/.Google Scholar
• Palen L, Soden R, Anderson TJ, Barrenechea M (2015) Success and scale in a data-producing organization: The socio-technical evolution of open street map in response to humanitarian events. Begole B, Kim J, eds. Proc. 33rd Annual ACM Conf. Human Factors Computing Systems (ACM, Seoul, Korea), 4113–4122.Google Scholar
• Pearn WL, Wu TC (1995) Algorithms for the rural postman problem. Comput. Oper. Res. 22(8):819–828.Crossref, Google Scholar
• qTip (2012) Join GitHub today. Accessed February 15, 2017, https://github.com/cytoscape/cytoscape.js-qtip.Google Scholar
• Schulz C, Nocaj A, Goertler J, Deussen O, Brandes U, Weiskopf D (2017) Probabilistic graph layout for uncertain network visualization. IEEE Trans. Visualization Comput. Graphics 23(1):531–540.Crossref, Google Scholar
• Shang R, Dai K, Jiao L, Stolkin R (2016) Improved memetic algorithm based on route distance grouping for multiobjective large scale capacitated arc routing problems. IEEE Trans. Cybernetics 46(4):1000–1013.Crossref, Google Scholar
• Shannon P, Markiel A, Ozier O, Baliga NS, Wang JT, Ramage D, Amin N, Schwikowski B, Ideker T (2003) Cytoscape: A software environment for integrated models of biomolecular interaction networks. Genome Res. 13(11):2498–2504.Crossref, Google Scholar
• Smoot ME, Ono K, Ruscheinski J, Wang P-L, Ideker T (2011) Cytoscape 2.8: New features for data integration and network visualization. Bioinformatics 27(3):431–432.Crossref, Google Scholar
• Tilkov S, Vinoski S (2010) Node.js: Using Javascript to build high-performance network programs. IEEE Internet Comput. 14(6):80–83.Crossref, Google Scholar
• Vex (2013) Join GitHub today. Accessed March 1, 2017, https://github.com/HubSpot/vex.Google Scholar
• Wang J, Tang K, Lozano JA, Yao X (2016) Estimation of the distribution algorithm with a stochastic local search for uncertain capacitated arc routing problems. IEEE Trans. Evolutionary Comput. 20(1):96–109.Crossref, Google Scholar
• Willemse EJ, Joubert JW (2016a) Benchmark data set for undirected and mixed capacitated arc routing problems under time restrictions with intermediate facilities. Data in Brief 8:972–977.Crossref, Google Scholar
• Willemse EJ, Joubert JW (2016b) Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities. Oper. Res. Lett. 44(5):569–574.Crossref, Google Scholar
• Xia M, Wang J, He Y (2013) Brainnet viewer: A network visualization tool for human brain connectomics. PloS ONE 8(7):e68910.Crossref, Google Scholar
• Yadav P, Deshpande S, Sengupta R (2017) Animating maps: Visual analytics meets geoweb 2.0. Chun Y, Griffith D, Dean D, eds. Advances in Geocomputation (Springer, Cham, Switzerland),75–84.Crossref, Google Scholar
• Zeni GA, Menzori M, Martins PS, Meira LAA (2016) VRP Bench: A vehicle routing benchmark tool. arXiv preprint arXiv:1610.05402.Google Scholar
• Zhang Y, Mei Y, Tang K, Jiang K (2017) Memetic algorithm with route decomposing for periodic capacitated arc routing problem. Appl. Soft Comput. 52:1130–1142.Crossref, Google Scholar