This paper addresses the problem of developing an optimisation structure to aid the operational decision-making of scheduling activities in a real-world pipeline scenario. The pipeline connects an inland refinery to a harbour, conveying different types of oil derivatives. The optimisation structure is developed based on mixed integer linear programming (MILP) with uniform time discretisation, b...

Task allocation and scheduling for heterogeneous multicore platforms must be automated for such platforms to be successful. Techniques such as Mixed Integer Linear Programming (MILP) provide the ability to easily customize the allocation and scheduling problem to application or platform-specific peculiarities. The representation of the core problem in a MILP form has a large impact on the solut...

SelfSplit is a simple mechanism to convert a sequential tree-search code into a parallel one. In this paradigm, tree-search is distributed among a set of workers, each of which is able to autonomously determine—without any communication with the other workers—the job parts it has to process. SelfSplit already proved quite effective in parallelizing Constraint Programming solvers. In the present...

Bayesian Stackelberg games have been used to compute optimal patrol strategies for the security of the Los Angeles International Airport (LAX) by modelling the security situation as a 1-leader, 1-follower, Bayesian game where there is one leader type and an arbitrary number of follower types. A previous approach, named DOBSS, computes the Stackelberg solution for this game by solving a Mixed In...

preventive maintenance scheduling of generating units is addressed as a long-term scheduling in power system studies aiming to increase the reliability incorporating cost reduction. it consists of knowing which generating units should be shut down for regular safety inspection. in this paper, a new formulation of preventive maintenance scheduling associated with cost reduction index (cri) is pr...

In this paper the branching trees for attacking MILP are reviewed. Under certain circumstances branches can be done concurrently. This is fully investigated with the result that there are restrictions for certain dual values and reduced costs. As a sideeffect of this study a new class of cuts for MILP is found, which are defined by those values. 1 Motivation of the following thoughts Nowadays t...

At ASIACRYPT 2016, Xiang et al. applied MILP method to search integral distinguisher based on division property. This method handled the huge time and memory complexities which had constituted the main restriction of the bit-based division property proposed by Todo and Morri, and showed its strength through finding some longer integral distinguishers for various primitives. Although MILP-aided ...

The multiperiodic crowd tracking (MPCT) problem is an extension of the periodic (PCT) problem, recently addressed in literature and solved using iterative solver called PCTs solver. For a given crowded event, MPCT consists follow-up crowds, unmanned aerial vehicles (UAVs) during different periods life-cycle open area (OCA). Our main motivation to remedy important limitation “PCTs myopia” which ...

We present sufficient conditions under which thermal generators can be aggregated in mixed-integer linear programming (MILP) formulations of the unit commitment (UC) problem, while maintaining feasibility and optimality for the original disaggregated problem. Aggregating thermal generators with identical characteristics (e.g., minimum/maximum power output, minimum up/down-time, and cost curves)...