Train scheduling is a critical activity in rail traffic management, both off-line (timetabling) and on-line (dispatching). Time-Indexed formulations for scheduling problems are stronger than other classical formulations, like Big-M. Unfortunately, their size grows usually very large with the...

Given a directed graph with capacities and blocker costs associated with its arcs, we study the maximum flow blocker problem (MFBP) which asks to find a minimum-cost subset of arcs to be removed from the graph in such a way that the remaining maximum-flow value does not exceed a given threshold....

This research presents a novel approach for effectively addressing the multi-response problem in the Taguchi Method, a pervasive issue in the production process and productivity index improvement efforts. We achieved this by integrating the Taguchi Method with DEA, transforming experimental...

In recent years, multinational corporations (MNCs) have shifted their decision-making strategies from solely focusing on economic factors to adopting a sustainable perspective that considers environmental and social impacts. Consequently, the sustainable facility location problem (SFLP) has...

The Facility Layout Problem (FLP) is a classic problem for industrial engineers and work area designers, taking relevance because of its direct impact on productivity and efficiency in the productive systems. On the other hand, we face the Unequal Area Facility Layout Problem (UA-FLP) when the...

This study contributes to the optimization literature with an approach that would help investors understand how the risk-aversion profile hyper-parameter affects both excess returns, risk, and the Sharpe index curves in portfolio optimization problems with shorting constraints. These curves were...

The robust multi-product pricing problem is to determine the prices of a collection of products so as to maximize the worst-case revenue, where the worst case is taken over an uncertainty set of demand models that the firm expects could be realized in practice. A tacit assumption in this...

The multicommodity network flow problem is a classical issue in network optimization, where the objective is to route multiple commodities through interconnected nodes and arcs to minimize the overall flow cost. However, in practical scenarios, parameters such as arc capacities, node demands,...

In the era of Industry 4.0, order scheduling is a crucial link in the production of manufacturing enterprises. In view of order scheduling in manufacturing enterprises, a finite horizon MDP (Markov decision process) model is proposed in this work based on two sets of equipment and three types of...

The K-nearest neighbour (KNN) algorithm is one of the well-known classifiers applied in various research areas. The input requirement includes a set of variables, the choice of the neighbourhood size (K) and the distance metric which are usually selected based on data characteristics. The first...