EETTlib – Energy-Efficient Train Timetabling Library

We introduce EETTlib, an instance library for the Energy-Efficient Train Timetabling problem. The task in this problem is to adjust a given timetable draft such that several key indicators relating to the energy consumption of the resulting railway traffic are minimized. These include peak power consumption, total energy consumption, loss in recuperation energy, fluctuation in … Read more

RSOME in Python: An Open-Source Package for Robust Stochastic Optimization Made Easy

We develop a Python package called RSOME for modeling a wide spectrum of robust and distributionally robust optimization problems. RSOME serves as a modeling platform for formulating various optimization problems subject to distributional ambiguity in a highly readable and mathematically intuitive manner. Compared with the MATLAB version, RSOME in Python is more versatile and well … Read more

MatQapNB User Guide: A branch-and-bound program for QAPs in Matlab with the Newton-Bracketing method

MatQapNB is a MATLAB toolbox that implements a parallel branch-and-bound method using NewtBracket (the Newton bracketing method [4]) for its lower bounding procedure. It can solve small to medium scale Quadratic Assignment Problem (QAP) instances with dimension up to 30. MatQapNB was used in the numerical experiments on QAPs in the recent article “Solving challenging … Read more

Parallel Strategies for Direct Multisearch

Direct Multisearch (DMS) is a Derivative-free Optimization class of algorithms suited for computing approximations to the complete Pareto front of a given Multiobjective Optimization problem. It has a well-supported convergence analysis and simple implementations present a good numerical performance, both in academic test sets and in real applications. Recently, this numerical performance was improved with … Read more

NOMAD version 4: Nonlinear optimization with the MADS algorithm

NOMAD is software for optimizing blackbox problems. In continuous development since 2001, it constantly evolved with the integration of new algorithmic features published in scientific publications. These features are motivated by real applications encountered by industrial partners. The latest major release of NOMAD, version 3, dates from 2008. Minor releases are produced as new features … Read more

Maintenance Optimization of Wagons Mix

This work proposes to create a tool for support for cost reduction in wagon maintenance through the distribution of the annual plan in workshops. The distribution depends on the type of wagon, the scope of the maintenance service that each workshop serves, and the capacity that is supported by the workshops. This plan is a … Read more

A support tool for planning classrooms considering social distancing between students

In this paper, we present the online tool salaplanejada.unifesp.br developed to assist the layout planning of classrooms considering the social distance in the context of the COVID-19 pandemic. We address both the allocation problem in rooms where seats are fixed as well as the problem in rooms where seats can be moved freely. For the … Read more

FrankWolfe.jl: a high-performance and flexible toolbox for Frank-Wolfe algorithms and Conditional Gradients

We present FrankWolfe.jl, an open-source implementation of several popular Frank-Wolfe and Conditional Gradients variants for first-order constrained optimization. The package is designed with flexibility and high-performance in mind, allowing for easy extension and relying on few assumptions regarding the user-provided functions. It supports Julia’s unique multiple dispatch feature, and interfaces smoothly with generic linear optimization … Read more

A Computational Study of Perspective Cuts

The benefits of cutting planes based on the perspective function are well known for many specific classes of mixed-integer nonlinear programs with on/off structures. However, we are not aware of any empirical studies that evaluate their applicability and computational impact over large, heterogeneous test sets in general-purpose solvers. This paper provides a detailed computational study … Read more

String-Averaging Methods for Best Approximation to Common Fixed Point Sets of Operators: The Finite and Infinite Cases

Abstract String-averaging is an algorithmic structure used when handling a family of operators in situations where the algorithm at hand requires to employ the operators in a specific order. Sequential orderings are well-known and a simultaneous order means that all operators are used simultaneously (in parallel). String-averaging allows to use strings of indices, constructed by … Read more