نتایج جستجو برای: integer programming mip model
تعداد نتایج: 2367702 فیلتر نتایج به سال:
IBM Systems and Technology Group uses operations research models and methods extensively for solving large-scale supply chain optimization (SCO) problems for planning its extended enterprise semiconductor supply chain. The large-scale nature of these problems necessitates the use of computationally efficient solution methods. However, the complexity of the models makes developing robust solutio...
In order to mitigate the environmental pollution caused by sea freight, we focused on optimizing carbon emissions in container terminal operations. This paper establishes a mixed integer programming (MIP) model for continuous berth allocation problem (CBAP) considering tide time window. We aimed minimize total waiting time, consumption and deviation preference. overcome influence of an uncertai...
Although many algorithms have been developed so far for structure alignment problem based on either distancebased methods or vector-based methods, such as iterative dynamical programming, Monte Carlo simulation, graph theory, and mean field equations, only a few methods are published for multiple structure alignment, such as progressive structure alignment and Monte Carlo optimization. In this ...
although lot streaming scheduling is an active research field, lot streaming flexible flow lines problems have received far less attention than classical flow shops. this paper deals with scheduling jobs in lot streaming flexible flow line problems. the paper mathematically formulates the problem by a mixed integer linear programming model. this model solves small instances to optimality. moreo...
The double row layout problem is to arrange a number of machines on both sides straight aisle so as minimize the total material handling cost. Aiming at random distribution product demands, we study stochastic robust (SR-DRLP). A mixed integer programming (MIP) model established for SR-DRLP. surrogate used linearize nonlinear term in MIP achieve linear model, which can be readily solved by an e...
Gomory mixed-integer (GMI) cuts are among the most effective cutting planes for general mixed-integer programs (MIP). They are traditionally generated from an optimal basis of a linear programming (LP) relaxation of a MIP. In this paper we propose a heuristic to generate useful GMI cuts from additional bases of the initial LP relaxation. The cuts we generate have rank one, i.e., they do not use...
Modern Mixed-Integer Programming (MIP) solvers exploit a rich arsenal of tools to attack hard problems. It is widely accepted by the OR community that the solution of very hard MIPs can take advantage from the solution of a series of time-consuming auxiliary Linear Programs (LPs) intended to enhance the performance of the overall MIP solver. E.g., auxiliary LPs may be solved to generate powerfu...
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important NP-complete problem that can be extremely hard in practice. Feasibility Pump (FP) is a heuristic scheme for finding a feasible solution to general MIPs that can be viewed as a clever way to round a sequence of fractional solutions of the LP relaxation, until a feasible one is eventually found. In th...
We propose an approach based on mixed integer programming (MIP) with decomposition to solve a workforce scheduling and routing problem, in which a set of workers should be assigned to tasks that are distributed across different geographical locations. This problem arises from a number of home care planning scenarios in the UK, faced by our industrial partner. We present a mixed integer programm...
For many Mixed-Integer Programming (MIP) problems, high-quality dual bounds can obtained either through advanced formulation techniques coupled with a state-of-the-art MIP solver, or through Semidefinite Programming (SDP) relaxation hierarchies. In this paper, we introduce an alternative bounding approach that exploits the “combinatorial implosion” effect by solving portions of the original pro...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید