A Visual Web Tool to Perform What-If Analysis of Optimization Approaches

In Operation Research, practical evaluation is essential to validate the efficacy of optimization approaches. This paper promotes the usage of performance profiles as a standard practice to visualize and analyze experimental results. It introduces a Web tool to construct and export performance profiles as SVG or HTML files. In addition, the application relies on a methodology to estimate the benefit of hypothetical solver improvements. Therefore, the tool allows one to employ what-if analysis to screen possible research directions, and identify those having the best potential. The approach is showcased on two Operation Research technologies: Constraint Programming and Mixed Integer Linear Programming.

• Publication year

  2017

• Venue

  arXiv.org

• Publication date

  2017-03-16

• Fields of study

  Computer Science

• Identifiers
  arXiv 1703.06042
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Integration of AI and OR Techniques in Constraint Programming

  2016cited by this paper
• Integration of AI and OR Techniques in Constraint Programming: 12th International Conference, CPAIOR 2015, Barcelona, Spain, May 18-22, 2015, Proceedings

  2015cited by this paper
• Simple and Scalable Time-Table Filtering for the Cumulative Constraint

  2015cited by this paper
• Time-Table Disjunctive Reasoning for the Cumulative Constraint

  2015cited by this paper
• A New Characterization of Relevant Intervals for Energetic Reasoning

  2014cited by this paper
• A Scalable Sweep Algorithm for the cumulative Constraint

  2012cited by this paper
• The Traveling Salesman Problem: A Computational Study

  2007cited by this paper
• Benchmarking optimization software with performance profiles

  2001cited by this paper
• Constraint - based scheduling : applying constraint programming to scheduling problems

  2001cited by this paper
• TSP Cuts Which Do Not Conform to the Template Paradigm

  2000cited by this paper
• Benchmark instances for project scheduling problems

  1999cited by this paper
• Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems

  1997cited by this paper
• Time-versus-Capacity Compromises in Project Scheduling1

  1994cited by this paper
• Extending CHIP in order to solve complex scheduling and placement problems

  1993cited by this paper
• TSPLIB - A Traveling Salesman Problem Library

  1991cited by this paper
• How not to lie with statistics: the correct way to summarize benchmark results

  1986cited by this paper
• Structured Programming with go to Statements

  1974cited by this paper

• What-if Analysis for Business Professionals: Current Practices and Future Opportunities

  2022cites this paper
• An Efficient Filtering Algorithm for the Unary Resource Constraint with Transition Times and Optional Activities

  2020cites this paper
• The Unary Resource with Transition Times and Optional Activities

  2019cites this paper
• Efficient filtering for the Resource-Cost AllDifferent constraint

  2017cites this paper
• How efficient is a global constraint in practice?

  2017cites this paper
• Efficient Filtering for the Unary Resource with Family-Based Transition Times

  2016cites this paper
• Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets

  2016cites this paper