To enable the huge saving of the kit-breakdown, we developed MaxIt v1.2 to generate an optimal capacity plan at the kit component level for the mid-range build plan in multi-factory environment. We describe the MILP (...
详细信息
To enable the huge saving of the kit-breakdown, we developed MaxIt v1.2 to generate an optimal capacity plan at the kit component level for the mid-range build plan in multi-factory environment. We describe the MILP (mixed integer linear programming) model and system architecture of MaxIt v1.2. We also conduct detailed sensitivity analysis on parameter setting and objective prioritizing. With the implementation in the Intel Shanghai and Manila sites, we have significantly improved data integrity and enabled a -US/spl ges/ cost savings.
In this paper, we present an algebraic decision diagram (ADD) based approach to determine and implicitly represent the leakage value for all input vectors of a combinational circuit. In its exact form, our technique c...
详细信息
In this paper, we present an algebraic decision diagram (ADD) based approach to determine and implicitly represent the leakage value for all input vectors of a combinational circuit. In its exact form, our technique can compute the leakage value of each input vector. To broaden the applicability of our technique, we present an approximate version of our algorithm as well. The approximation is done by limiting the total number of discriminant nodes in any ADD. Previous sleep vector computation techniques can find either the maximum or minimum sleep vector. Our technique computes the leakages for all vectors, storing them implicitly in an ADD structure. We experimentally demonstrate that these approximate techniques produce results which have reasonable errors. We also show that limiting the number of discriminants to a value between 12 and 16 is practical, allowing for good accuracy and lowered memory utilization.
In this paper, predictive energy management strategies that utilize the previewed traffic pattern and terrain information are developed. A generalized predictive optimal control framework is used to find the condition...
详细信息
In this paper, predictive energy management strategies that utilize the previewed traffic pattern and terrain information are developed. A generalized predictive optimal control framework is used to find the conditions under which the predictive strategies, will give superior fuel economy to that of the instantaneous strategies. mixed integer linear programming methodology, with no assumptions on the control structure, is used to find the predictive energy management strategies. It is shown, by using theoretical work and simulation, that certain conditions are needed to make the predictive strategies, that utilize the previewed driving pattern and terrain information, give superior fuel economy to the instantaneous ones.
This paper studies the capacitated minimum spanning tree problem, which is one of the most fundamental and significant problems in the optimal design of communication networks. A solution method using combined neighbo...
详细信息
ISBN:
(纸本)0769523161
This paper studies the capacitated minimum spanning tree problem, which is one of the most fundamental and significant problems in the optimal design of communication networks. A solution method using combined neighborhood search and branch and bound technique is introduced and its performance is presented. The advantage of the algorithm is shown while the process of searching for the optimal solution is illustrated. Computational experiences demonstrate that the proposed strategy significantly improves the efficiency of the previous arc-orientated branch and bound algorithm.
We consider the problem of jointly maximizing the time-to-first-failure (TTFF), defined as the time till the first node in the network runs out of battery energy, and minimizing the total power in energy constrained s...
详细信息
We consider the problem of jointly maximizing the time-to-first-failure (TTFF), defined as the time till the first node in the network runs out of battery energy, and minimizing the total power in energy constrained static wireless networks. It is shown in A.K. Das et al. (2004) that simply optimizing the TTFF criterion may not provide the ideally optimum solution. Besides maximizing the TTFF, the ideally optimum solution guarantees that the lifetimes of all nodes are at least as high as in other trees which provide the same TTFF. A composite objective function involving the TTFF and the sum of the transmitter powers is therefore proposed in A.K. Das et al. (2004), along with a discussion of an optimal solution methodology using mixed integer linear programming. In this paper, we discuss a 2-step heuristic-procedure for the joint optimization problem. The first step is a greedy iterative algorithm which provides an optimal solution, but with respect to the TTFF criterion only. The second step is a tree-improvement technique which is used to refine the TTFF-optimal tree such that the total transmitter power is minimized, without affecting the optimal TTFF. Recent work has shown that the power consumed in the receiver circuitry can be almost comparable to the transmit power, especially in short-range networks. Our algorithms are therefore designed to take into account both the transmitter side and receiver side power expenditures. Simulation results are presented to validate the performance of the algorithm
We present some proposals to approximately solve a period vehicle routing problem used to model the extraction of oil from a set of onshore oil wells in Brazil. This problem differs from the well-known period vehicle ...
详细信息
We present some proposals to approximately solve a period vehicle routing problem used to model the extraction of oil from a set of onshore oil wells in Brazil. This problem differs from the well-known period vehicle routing problem in several aspects. One major difference between them, responsible for increasing the complexity of the problem, is that, in the proposed problem, the number of visits required by a customer during the period is not previously determined. We developed some pure GRASP heuristics and some other heuristics that include the use of memory in GRASP. Experimental results illustrate the effectiveness of GRASP with adaptive memory over pure GRASP heuristics
e-Procurement is an Internet based business process for sourcing direct or indirect materials. This paper considers a procurement scenario of a buyer procuring large quantities of a single good. The suppliers submit n...
详细信息
e-Procurement is an Internet based business process for sourcing direct or indirect materials. This paper considers a procurement scenario of a buyer procuring large quantities of a single good. The suppliers submit nonconvex piecewise linear supply curves as their bids. Such bids enable the suppliers to effectively express their economies of scale and transportation constraints. The buyer imposes a business rule of limiting the winning suppliers within a preferred range. The bid evaluation problem faced by the buyer is to select the winning suppliers and their trading quantities, such that the cost of procurement is minimized while satisfying the supply, demand, and business constraints. The bid evaluation problem is NP-hard even for a simple special case. In this paper, the problem is formulated as a mixed integer linear programming problem and we propose a Lagrangian relaxation based heuristic to find a near optimal solution. The computational experiments performed on representative data sets show that the proposed heuristic produces a feasible solution with negligible optimality gap.
This paper presents the methodology and the results of the must offer waiver process as applied in the California electricity market. The goal of this cost saving process is to minimize the market operation costs by d...
详细信息
This paper presents the methodology and the results of the must offer waiver process as applied in the California electricity market. The goal of this cost saving process is to minimize the market operation costs by deploying an optimal unit commitment approach. This procedure replaces the "first come, first served" must offer waiver process that is currently in place. It uses a security constrained unit commitment application to commit enough units to meet the reliability requirement and minimize the total start up and minimum load costs over the specified time period. A post must offer waiver procedure utilizing the security constrained unit commitment is also established to calculate and allocate the incremental costs associated with the local reliability requirement. The key components of the new must offer waiver procedure, the methodology and computer algorithm of security constrained unit commitment, and the methodology of the incremental cost calculation and allocation are addressed in this paper. The paper finally presents computational results based on actual data to illustrate the benefits of the new approach
This paper presents the application of a machine learning technique (neural networks) to the problem of optimising the traffic flows (label switched path placement) within telecommunications networks using multi-proto...
详细信息
This paper presents the application of a machine learning technique (neural networks) to the problem of optimising the traffic flows (label switched path placement) within telecommunications networks using multi-protocol label switching (MPLS). It is shown here that the machine learning technique achieves very fast computation of accurate solutions to the problem of placing label switched paths in order to maximise the performance of the network. Results are presented which compare the accuracy of the neural network solutions with the optimal solutions produced by the standard mixed integer linear programming technique, and the time taken to produce the solutions. As well, network simulation results are presented which show the improvement in network performance, in terms of packet loss, that can be achieved when using such a technique.
暂无评论