378 results about "Integer programming" patented technology

The present invention relates to a method for workforce scheduling in which workload and workload types vary during scheduling period. The method acquires agent and skill requirements for all periods and contact types; acquires the contact center information including agent skill groups, agent work groups, tour and shift scheduling rules, agent availability, objective criterion to be optimized and its parameters; develops a Mixed Integer Linear Programming (MILP) model for the scheduling environment; applied an optimization algorithm that uses the Branch and Bound algorithm with a Rounding Algorithm to improve performance; and locates a globally optimal or near optimal workforce schedule in total cost or paid time or agent satisfaction. Detailed schedules may be developed by assigning daily shifts to work patterns, and breaks scheduled to daily shifts.

The invention provides systems and methods for layout decomposition to produce exposure layouts that can be used to perform double patterning lithography (DPL). Preferred embodiment methods of the invention are executed by a computer and provide alternate methods for layout decomposition for double patterning lithography (DPL) using integer linear programming (ILP) formulations. Embodiments of the invention meet a key optimization goals, which is to reduce the total cost of layout decomposition, considering the abovementioned aspects that contribute to cost of prior conventional DPL techniques. Embodiments of the invention provide integer linear programming (ILP), phase conflict detection (PCD) and node election bipartization (NBD) formulations for the optimization of DPL layout decomposition, with a process-aware cost function that avoids small jogging line-ends, and maximizes overlap at dividing points of polygons. The cost function can also make preferential splits at landing pads, junctions and long runs.

Discrete optimization problem are solved using an analog optimization device such as a quantum processor. Problems are solved using an objective function and at least one constraint corresponding to the discrete optimization problems. The objective function is converted into a first set of inputs and the at least one constraint is converted into a second set of inputs for the analog optimization device. A third set of inputs is generated which are indicative of at least one penalty coefficient. A final state of the analog optimization device corresponds to at least a portion of the solution to the discrete optimization problem.

A power supply system for supplying a grid power to a building includes a power generator, a power storing device, and a power controller. The power generator generates off-grid power from a predetermined energy. The power storing device stores the grid power and the off-grid power and supplies the stored power to the building. The power controller controls consumptions of the grid power and the off-grid power. The power controller calculates predicted consumption data related to power consumed in the building and predicted generation data related to power generated by the power generator. The power controller calculates a charging-discharging schedule for the power storing device based on the predicted consumption data and the predicted generation data by formulating the charging-discharging schedule as a mixed integer programming problem.

The invention discloses a cool-heat-electricity cogeneration type microgrid optimal configuration method. The method includes the steps of system level optimization and equipment level optimization. Safe and stable operation of electricity, heat and cool generation systems of a system is used as the constraint condition of system level optimization, load data, electrovalence policies and fuel cost in a microgrid region to be planned are used as input, energy supply equipment categories are selected on the basis of load data analysis, the lowest full life circle cost of a microgrid is used as an objective function, the objective function is solved by the adoption of a mixed integer programming approach, and then equipment capacity in the microgrid is acquired. Equipment level optimization is based on a cool-heat-electricity cogeneration equipment scheme library, the capacity value ranges of equipment are set on the basis of the result of system level optimization, solution is calculated in a weighted mode, and then the optimal configuration scheme of the system is obtained. According to the method, capacity of the generation systems can be balanced, utilization efficiency of primary energy and the utilization rate of the equipment are improved, unnecessary investment is avoided, meanwhile, overall economy of the system is improved, and annual operation cost is reduced.

The invention belongs to the technical field of urban mass transit and particularly relates to an energy-saving method of train operation of the urban mass transit. The energy-saving method comprises the steps of 1, analyzing operation matching rules of adjacent trains and computing the size of utilized regeneration energy; 2, establishing an optimization model of the train operation by taking the utilized regeneration energy as the target; 3, solving the optimization model to obtain an energy-saving time table of the train operation of the urban mass transit. By means of the energy-saving method, energy consumption during train operation is reduced, and security of an overhead line system is improved. Furthermore, the energy-saving method has the advantages of (1) being high in operation speed and applicable to large-scale computer simulation by adopting an integer programming method; (2) considering comprehensive factors, being high in modeling accuracy and strong in applicability of the planned operation time table; (3) being capable of embedded into hardware of a train energy-saving driving auxiliary system in an online mode, easy to implement, low in cost and wide in application range.

A flexible mechanism for routers to select the egress point for each destination prefix, herein referred to as tunable inter-domain egress (TIE) selection, comprises the step of ranking possible points of egress according to a metric, allowing network administrators to satisfy diverse goals, such as traffic engineering and robustness to equipment failures. A weighting function is discussed whereby known hot potato routing can be weighted against a fixed ranking scheme. TIE has been applied to data of two different autonomous systems posing different problems solved using integer-programming and multi-commodity flow techniques, respectively, to tune the TIE according to the weighting function to satisfy network-wide objectives. Experiments with traffic, topology and routing data from two different backbone networks demonstrate that TIE is both simple (for the routers) and expressive (for the network administrators) and can be practically applied in traffic engineering.

The invention discloses a distributed robust coordinated optimization scheduling model for an electrothermal integrated system with the consideration to wind power uncertainty. The electrothermal integrated system which takes a combined heat and power generation unit and an electric boiler as coupling units is constructed, and wind power output uncertainty is considered. The two-stage distributedrobust coordinated optimization scheduling model is constructed on the basis of the available wind power historical data of the scheduling system. In the model, the start/stop state of a conventionalunit and the related variables of a heat storage device and an electricity storage device are designed to be first-stage robustness variables, and other variables are designed to be second-stage variables. The model is decomposed into a main question and a subquention through a decomposition method for repeated iteration solving, thereby speeding up the solving. The equivalent conversion of an absolute value constrained condition is performed so as to convert a solving problem into a mixed integer programming problem, and a conventional solving toolkit CPLEX is used for effective solving.

Interconnection links between hosts and devices are optimized by using the operational parameters, for example, the bandwidth, of an edge/core switch network. In one embodiment, integer programming is used to create a mathematical model of the connectivity problem so as to optimize the minimum fraction of each host's or device's bandwidth demand routable from that host or devices to a core switch. In one embodiment, the mathematical model is solved by an integer problem solver.

The invention discloses a short-term optimized dispatching method for a cascade hydropower station. The invention discloses a novel 'grading' algorithm suitable for the energy abandoning and consumption of short-term optimized dispatching for a cascade hydropower station. The short-term optimized dispatching method disclosed by the invention adopts a technology of cascade and in-plant two-stage coordination control; each hydropower station of the cascade hydropower station is calculated to obtain the discharge flow and the power generation water head of each reservoir; the optimal turn-on and turn-off plan of each power plant is determined by virtue of mixed integer programming on this basis; then load optimized distribution is carried out on a unit group by enabling the power generation amount to be the maximum by virtue of dynamic programming and according to a given water quantity. Meanwhile, after the process of obtaining the power generation amount of each hydropower station, the result can also be fed back to a cascade system, and the cascade system takes the result as a constraint condition and continues to repeatedly utilize the 'grading' algorithm to carry out iterative calculation. The short-term optimized dispatching method disclosed by the invention is capable of remarkably alleviating the energy abandoning contradiction of a large-scale hydropower system, and increasing the running and dispatching levels of the in-plant unit.

The invention relates to an intelligent warning system based on integer programming. The intelligent warning system adopts a signal acquisition module, a diagnostic startup judgment module, a fault analysis module, a failure report generating module and an analytical result comprehensive display module to warn; the intelligent warning system can be implemented through the following steps of: 1) network modelling, filling primary equipment of a transformer substation and a connected relation of the transformer substation into a database; and generating a structural model meeting IEC (international electrotechnical commission) 61970 standard of an electric system factory station and a system, and then using the model to generate a network device library through a filling library operation; 2) protected information modeling: carrying out protected information modeling according to the hierarchical relationship of the primary equipment, a protective device, protected information and a trip breaker, building an incidence relation between a protection main device, the protected information and a breaker motion, and protecting the main device namely the primary equipment; and 3) carrying out fault diagnosis. The intelligent warning system in the invention can be capable of rapidly and effectively carrying out detailed analysis on a single or complicated failure and protection motion analysis in a failure process.

A multi-day and multi-person trip planning system comprises a planning graph of nodes interconnected by transit arcs which both have associated time-variable costs and time. A user specifies user objectives within trip destinations and customizes a plurality of user preferences for a multi-day, multi-person, multi-modal trip. An optimizer compiles a plurality of permutations of visiting plans within the planning graph which satisfy the specified user objectives including routing to a plurality of trip destinations. The optimizer compares the permutations using mixed integer programming or constraint programming to identify at least one optimized visiting plan having a lowest aggregate associated cost or shortest travel time that also satisfies a plurality of constraints determined by the customizable user preferences or environment condition. Then the user interface presents at least one optimized visiting plan to a user or route related coupons.

The present invention provides a coordinated voltage control method based on the coordinating and restricting a real-time updating power plant and substation, belonging to power system automatic voltage control technical field. The invention selects the substation bus as a coordination variable between plants, firstly, each substation is processed with instation automatic voltage control according to the method of ''Nine zone pictures'', and according to the control result, the constraint condition of the coordination variable of the substation is real-time updated by adopting expert rules method; a constraint condition is added to the coordinated secondary voltage control mode of the region to unify solution, reactive power control strategy of the generator is solved. The CSVC mode has no discrete variable, belonging to conventional secondary planning mode, avoiding the resolving of the problem of the complex mixed integer programming, improving the credibility of the real-time control.

The invention discloses a continuous physical distribution node layout optimization method based on weighted Voronoi diagram, which comprises the following steps: determining the maximum quantity and minimum quantity of the new physical distribution nodes according to the target annual physical distribution total demand, available physical distribution node feeding capacity and candidate physicaldistribution node scales and types, and obtaining a new physical distribution node capacity combination by utilizing an integer programming technique; and after determining the quantity and capacity combination of the new nodes, generating a new node primary site selection scheme by using maximum hollow circle strategy, and implementing the optimization of the new physical distribution node site selection, scale and layout scheme based on weighted Voronoi diagram and maximum hollow circle strategy by combining a simulated annealing algorithm. The invention can enhance the scientificity and rationality of the physical distribution node space layout optimization, and well satisfy the demands for physical distribution system programming, thereby providing references for physical distributionnode site selection, layout and rational operation.

The invention discloses an intelligent dispatching method for home energy management system, which aims at optimizing dispatching control of high-power household appliance loads and distributed energy storage devices in home users. Based on the real-time price, the integer programming method and genetic algorithm is introduced, and the user's preset running time of household appliances and constraint response requirement stipulated by the power grid are satisfied, and combined with the distributed energy storage devices to set the lowest electricity cost as optimized target, and the household electricity load is divided into dispatchable household load and undispatchable household load to realize the optimized control operation of each household appliance load and distributed energy storage device. According to the intelligent dispatching method for home energy management system, the home users, power grid, photovoltaic system and distributed energy storage device are organically linked, and the flow of energy is realized.

A method and an apparatus for zoning in mobile communication system, which makes trade-off between minimized paging cost and minimized location update cost, and can obtain user feature data, established network characteristics, and geographical information, etc., perform clustering operation on the basis the obtained information, and treat with niched Pareto genetic algorithm according to the result of clustering operation, to obtain the final MSC-LA and LA-BS topological matrix, so as to allocate and configure location zones in the mobile communication system. The method and apparatus for zoning in mobile communication system in the present invention resolve the zoning into a multi-objective and multi-constraint integer programming problem, and utilize dynamic user feature data and established network characteristics as heuristic information for solving to assist multi-objective optimization, to make trade-off between minimized paging cost and minimized location update cost, and therefore can improve overall performance of the mobile communication system.

There is assigned at least one first cost for expanding at least one link to a circuit-switched network that is part of a hybrid network comprising the circuit switched network and a packet switched network. All paths in the packet switched network are represented with a virtual link. A cost is assigned to the virtual link. An integer programming problem is solved to determine a number of links to add to the network, the integer programming problem having as inputs a model of the hybrid network and a demand forecast matrix.

The invention relates to the field of resource optimization in an Internet of Vehicles, in particular to an Internet-of-Vehicles resource optimization method based on a non-orthogonal multiple accesstechnology, which comprises the following steps of: when a vehicle task is processed in an NOMA-assisted vehicle edge computing system, taking minimization of total energy consumption of the vehicle edge computing system as a principle; determining an unloading and caching decision of the system, calculating and allocating caching resources, namely considering random flow arrival and queue stability of a vehicle user, and defining as a random optimization problem through joint optimization calculation of the unloading decision and the content caching decision and calculation and allocation ofthe caching resources; and utilizing a Lyapunov optimization theory to propose a dynamic joint calculation unloading, content caching and resource allocation algorithm for solving the problem, decoupling the algorithm into two independent sub-problems, and utilizing 0-1 integer programming and linear programming to solve the two sub-problems. According to the invention, the computing resources ofthe mobile edge computing server can be effectively processed, and the energy consumption of the system is reduced.

The invention discloses a tiny cell cache device allocation algorithm based on user mobility and belongs to the field of wireless communication. The method comprises the following steps: performing data set analysis on a long-term user group mobility track at an initialization phase, and dividing system time of a user mobility track data set into discrete time slots according to certain time intervals; enabling the user to request a file once in each time slot, and calculating the total cache hit rate; converting a cache allocation problem into an integer programming problem; searching an optimal solution of the initial allocation problem of cache device capacity in a solution space by using a genetic-annealing algorithm, wherein the optional solution comprises specially optimized design operations such as an a fitness function, a selection operation and an interlace operation; and outputting the allocation of device files among tiny cell base stations if the solution is converged, and allocating the cache device among the tiny cell base stations according to the allocation, thereby obtaining the optimal cache device allocation scheme. Therefore, the cache hit rate performance of users is improved, and the device installation cost is effectively saved.

A system creating a purchasing and delivery plan for a commodity is provided. This system sets the number of delivery means that deliver the commodity according to each delivery schedule and the amount of the commodity purchases from each supplier as variables, and for a mixed integer programming problem that minimizes the value of a first objective function that computes the expected value for the delivery and purchase costs, computes a dual solution for a qualification problem for a linear relaxation problem for this. Furthermore, a delivery schedule exhibiting a constraint that violates the dual solution of the qualification problem is searched for by solving a dynamic programming problem having a recursive equation that expresses the changes in the value of a second objective function based on constraint equations for the dual problem for the linear relaxation problem by the changes in the delivery state.