We study the resource loading problem, which arises in tactical capacity planning. In this one has to plan intensity of execution a set orders minimize cost function that penalizes use above given limits and completion after their due dates. Our main contributions include novel mixed-integer linear-programming (MIP)‐based formulation, investigation polyhedra associated with feasible assignments...

Dispatching firefighting resources effectively plays a vital role in wildfire management. To control the fire timely manner, should be dispatched an effective and reasonable way. Moreover, relationship between various resource-dispatching processes intuitive for firefighters to make decisions. In this paper, we propose novel event-response tree-based model dispatch different kinds of based on s...

vehicle routing problem (vrp) is one of the major problems in the transportation and distribution planning. in the most previous studies, the objective of vrp models was distance and vehicle related costs. however in many industrial cases along with routing distance, vehicle loading amount is a factor of cost function. in this paper, we formulate a mixed integer non-linear programming (minlp) m...

In this paper we present a rather new approach to apply mixed-integer optimization to the cryptanalysis of cryptographic primitives. We focus on the stream cipher Trivium, that has been recommended by the eSTREAM stream cipher project, and the lightweight block cipher Ktantan. Using these examples we explain how the problem of solving a non-linear multivariate Boolean equation system can be for...

In this paper we perform computational studies on two types of integer least squares (ILS) problems that arise in wireless communication applications: unconstrained and box-constrained ILS problems. We perform extensive experiments comparing the performance of the discrete ellipsoid-based search (DEBS) method and the branch-and-cut (B&C) mixed integer programming (MIP) solver, and identify the ...

The problem of annual production scheduling in surface mining consists of determining an optimal sequence of extracting the mineralized material from the ground. The main objective of the optimization process is usually to maximize the total Net Present Value of the operation. Production scheduling is typically a mixed integer programming (MIP) type problem. However, the large number of integer...

State-of-the-art solvers for mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings that achieve high performance for specific types of MIP instances is challenging. We study the application of an automated algorithm configuration procedure to different MIP solvers, instance types and optimization objectives. We show that this fully-automated process y...

A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally teste...

This paper describes a reduction in the peak traction energy of mass rapid transit (MRT) railways through timetabling. We develop a mixed integer programming (MIP) model that minimizes the maximum traction energy that occurs when trains are running simultaneously. We tried two approaches. In the first approach, we use the commercial MIP solver CPLEX. In the second approach, we propose a heurist...

We present a model for making master planning decisions in semiconductor manufacturing. The problem consists in determining appropriate wafer quantities for certain products, facilities (locations), and periods of time. Different demand types, i.e., confirmed orders or forecasts are considered. The reentrant flow in semiconductor wafer fabrication facilities is taken into account for capacity m...