Classification of Network Optimization Software Packages

Network optimization models and algorithms constitute a core research area of Mathematical Optimization and Computing. We present a wide range of state-of-the-art network optimization software packages and provide up-to-date definitions of the most important issues in algorithm engineering concerning fundamental network optimization problems. Furthermore, we discuss new concepts, trends, and emerging technologies in this research area. Apart from presenting important recent developments in network optimization and their impact on modern organizations and society, the proposed article is a classification of network optimization software packages with a special focus on solvers and benchmark collections. Finally, discussion is made regarding the societal impact and practical managerial significance of network optimization models and software tools.

[1]  El-Ghazali Talbi,et al.  Flexible Variable Neighborhood Search in Dynamic Vehicle Routing , 2011, EvoApplications.

[2]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[3]  Gérard Cornuéjols,et al.  Polyhedral study of the capacitated vehicle routing problem , 1993, Math. Program..

[4]  G. Peter Zhang,et al.  Neural Networks in Business Forecasting , 2003 .

[5]  T. Koch,et al.  SteinLib: An Updated Library on Steiner Tree Problems in Graphs , 2001 .

[6]  Angelo Sifaleras,et al.  Teaching Note - An Animated Demonstration of the Uncapacitated Network Simplex Algorithm , 2009, INFORMS Trans. Educ..

[7]  Michal Pióro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010, Networks.

[8]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[9]  Michael C. Ferris,et al.  NEOS and Condor: solving optimization problems over the Internet , 2000, TOMS.

[10]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[11]  Wen Long Yue,et al.  THE ROLE OF TRANSPORTATION IN LOGISTICS CHAIN , 2005 .

[12]  William J. Cook,et al.  Fifty-Plus Years of Combinatorial Integer Programming , 2010, 50 Years of Integer Programming.

[13]  Saïd Salhi,et al.  Location-routing: Issues, models and methods , 2007, Eur. J. Oper. Res..

[14]  Nenad Mladenović,et al.  Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem , 2013 .

[15]  Angelo Sifaleras,et al.  Some Computational Results on MPI Parallel Implementation of Dense Simplex Method , 2008 .

[16]  Jessika Schulze.  Neural Networks In Business Techniques And Applications , 2016 .

[17]  Christian Blum,et al.  Hybrid metaheuristics in combinatorial optimization: A survey , 2011, Appl. Soft Comput..

[18]  Angelo Sifaleras,et al.  MINIMUM COST NETWORK FLOWS: PROBLEMS, ALGORITHMS, AND SOFTWARE , 2013 .

[19]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[20]  David M. Warme,et al.  Exact Algorithms for Plane Steiner Tree Problems: A Computational Study , 2000 .

[21]  Celso C. Ribeiro,et al.  New benchmark instances for the Steiner problem in graphs , 2004 .

[22]  Marius M. Solomon,et al.  Partially dynamic vehicle routing—models and algorithms , 2002, J. Oper. Res. Soc..

[23]  ATSPDavid S. JohnsonAT.  Experimental Analysis of Heuristics for the Stsp , 2001 .

[24]  Artur Alves Pessoa,et al.  The time dependent traveling salesman problem: polyhedra and algorithm , 2013, Math. Program. Comput..

[25]  Dingzhu Du,et al.  Network Optimization Problems: Algorithms, Applications And Complexity , 1993 .

[26]  István Maros,et al.  Advances in design and implementation of optimization software , 2002, Eur. J. Oper. Res..

[27]  Kamil Rocki,et al.  High Performance GPU Accelerated Local Optimization in TSP , 2013, 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum.

[28]  Jack Snoeyink,et al.  Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation , 2001 .

[29]  Andreou Dimitrios,et al.  Application of a New Network-enabled Solver for the Assignment Problem in Computer-aided Education , 2005 .

[30]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[31]  Jean-François Lalande,et al.  Mascopt - A Network Optimization Library: Graph Manipulation , 2004 .

[32]  Jeffrey L. Arthur,et al.  An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions , 1994, Networks.

[33]  Michal Pioro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010 .

[34]  Robin Lougee,et al.  The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community , 2003, IBM J. Res. Dev..

[35]  Jason Papathanasiou,et al.  Optimization Theory, Decision Making, and Operations Research Applications : Proceedings of the 1st International Symposium and the 10th Balkan Conference on Operational Research , 2013 .

[36]  Péter Kovács,et al.  LEMON - an Open Source C++ Graph Template Library , 2011, WGT@ETAPS.

[37]  Weixiong Zhang,et al.  The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests , 2001, ALENEX.

[38]  F. Roberts.  Graph Theory and Its Applications to Problems of Society , 1987 .