This paper addresses the minimum transmission broadcast problem in wireless networks and presents efficient solutions, including an optimal broadcast scheme and a distributed game-based algorithm. Distinct from relate...
详细信息
This paper addresses the minimum transmission broadcast problem in wireless networks and presents efficient solutions, including an optimal broadcast scheme and a distributed game-based algorithm. Distinct from related work in the literature which typically assumes wireless links are reliable, we address the issue of broadcasting over both reliable wireless links and unreliable wireless links. Our main contributions are as follows: We first formulate the minimum transmission broadcast problems over reliable links and over unreliable links as two mixed integer linear programming (MILP) problems, respectively. This way, optimal broadcast schemes can be easily obtained using any existing MILP solver, for small-scale networks. For large-scale networks, we propose a distributed game-based algorithm and prove that the game-based algorithm achieves Nash Equilibrium. Using simulation, we confirm that compared with existing algorithms in the literature and optimal solutions obtained by our MILP techniques, the proposed game-based algorithm performs very well in terms of delivery ratio, the number of transmissions, and convergence speed.
To reduce the interconnect delay and improve the chip performance, three-dimensional (3D) chip emerged with the rapid increasing of chip integration and chip power density. Therefore, thermal issue is one of the cri...
详细信息
To reduce the interconnect delay and improve the chip performance, three-dimensional (3D) chip emerged with the rapid increasing of chip integration and chip power density. Therefore, thermal issue is one of the critical challenges in 3D IC design due to the high power density. Multiple Supply Voltages (MSV) technique provides an efficient way to optimize power consumption which in turn may alleviate the hotspots. But the voltage assignment is limited not only by the performance constraints of the design, but also by the physical layout of circuit modules since the modules with the same voltage should be gathered to reduce the power-network routing resource. Especially in 3D designs, the optimization using MSV technique becomes even more complicated since the high temperature also influences the power consumption and delay on paths. In this paper, we address the voltage-island generation problem for MSV designs in 3D ICs based on a mixed integer linear programming (MILP) model. First, we propose a general MILP formulation for voltage-island generation to optimize thermal distribution as well as power-network routing resources while maintaining the whole chip performance. With the thermal^power interdependency, an iterative optimization approach is proposed to obtain the convergence. Experimental results show that our thermal-aware voltage-island generation approach can reduce the maximal on-chip temperature by 23.64% with a reasonable runtime and save the power-network routing resources by 16.71%.
This paper addresses an equipment maintenance scheduling problem in a coal production system which includes three consecutive stages: the coal mining stage, the coal washing stage and the coal loading stage. Each stag...
详细信息
This paper addresses an equipment maintenance scheduling problem in a coal production system which includes three consecutive stages: the coal mining stage, the coal washing stage and the coal loading stage. Each stage is composed of different equipment that needs maintenance each day. There exists intermediate storage with finite capacities and the finished products are transported by train. Moreover, some equipment has a different preference for (aversion to) the start time of maintenance (STOM). The objective is to minimise the weighted sum of aversion about STOM, changeover times and train waiting time. We first formulate this problem into a mixed integer linear programming (MILP) model, then a hybrid genetic algorithm (HGA) is proposed to solve it. The proposed method has been tested on a practical coal enterprise in China and some randomly generated instances. Computational results indicate that our algorithm can produce near-optimal solutions efficiently.
In this paper, a two-stage optimal planning and design method for combined cooling, heat and power (CCHP) microgrid system was presented. The optimal objective was to simultaneously minimize the total net present cost...
详细信息
In this paper, a two-stage optimal planning and design method for combined cooling, heat and power (CCHP) microgrid system was presented. The optimal objective was to simultaneously minimize the total net present cost and carbon dioxide emission in life circle. On the first stage, multi-objective genetic algorithm based on non-dominated sorting genetic algorithm-II (NSGA-II) was applied to solve the optimal design problem including the optimization of equipment type and capacity. On the second stage, mixed-integerlinearprogramming (MILP) algorithm was used to solve the optimal dispatch problem. The approach was applied to a typical CCHP microgrid system in a hospital as a case study, and the effectiveness of the proposed method was verified. (C) 2013 Elsevier Ltd. All rights reserved.
In the current competitive business world, viable companies are those that have flexible strategies and long-term plans, by which they can appropriately respond to a dynamic environment. These strategies are used to f...
详细信息
In the current competitive business world, viable companies are those that have flexible strategies and long-term plans, by which they can appropriately respond to a dynamic environment. These strategies are used to find the optimum allocation of company income to the main sources of development, for the expansion of company activities and for service expansions. This paper presents a new mathematical model for multiple echelon, multiple commodity Supply Chain Network Design (SCND) and considers different time resolutions for tactical and strategic decisions. Expansions of the supply chain in the proposed model are planned according to cumulative net profits and fund supplied by external sources. Furthermore, some features, such as the minimum and maximum utilisation rates of facilities, public warehouses and potential sites for the establishment of private warehouses, are considered. To solve the model, an approach based on a Lagrangian Relaxation (LR) method has been developed, and some numerical analyses have been conducted to evaluate the performance of the designed approach. (C) 2012 Elsevier Ltd. All rights reserved.
In the design of time-critical applications, schedulability analysis is used to define the feasibility region of tasks with deadlines, so that optimization techniques can find the best design solution within the timin...
详细信息
In the design of time-critical applications, schedulability analysis is used to define the feasibility region of tasks with deadlines, so that optimization techniques can find the best design solution within the timing constraints. The formulation of the feasibility region based on the response time calculation requires many integer variables and is too complex for solvers. Approximation techniques have been used to define a convex subset of the feasibility region, used in conjunction with a branch and bound approach to compute suboptimal solutions for optimal task period selection, priority assignment, or placement of tasks onto CPUs. In this paper, we provide an improved and simpler real-time schedulability test that allows an exact and efficient definition of the feasibility region in mixed integer linear programming (MILP) optimization. Our method requires a significantly smaller number of binary variables and is viable for the treatment of industrial-size problem, as shown by the experiments.
This paper summarizes a mathematical model that relates the geometric and geotechnical features of a road construction site with the allocation of materials, searching for a minimum construction cost. This paper propo...
详细信息
This paper summarizes a mathematical model that relates the geometric and geotechnical features of a road construction site with the allocation of materials, searching for a minimum construction cost. This paper proposes a linearprogramming model to optimize excavation and paving services. With this model, it is possible to evaluate site alternatives with different soil strata and different degrees of compaction. The borrow pit materials are allocated in the most economical way, and it is possible to incorporate more inputs like materials mix. Software was used to solve the model, and a spreadsheet application was used as an interface for data input. The proposed model demonstrated possible cost savings in earthwork planning. It is expected that earthwork and paving optimization with linearprogramming will reduce road construction costs considerably. (C) 2013 American Society of Civil Engineers.
With the urgency of remanufacturing and environmental concerns, closed-loop supply chain (CLSC) networks have drawn the attention of researchers. Although there are many CLSC network models in the literature, most of ...
详细信息
With the urgency of remanufacturing and environmental concerns, closed-loop supply chain (CLSC) networks have drawn the attention of researchers. Although there are many CLSC network models in the literature, most of them do not consider uncertainty in general terms. However, practical situations are often not well defined and thus cannot be described precisely in real world CLSCs. In this paper a mixedinteger fuzzy mathematical model is proposed for a CLSC network which includes both forward and reverse flows with multiple periods and multiple parts. A fuzzy multi-objective model (FMOM) approach is applied to take into account the fuzziness in the capacity, objectives, demand constraints and also in the reverse rates. Computational results are presented for a number of scenarios to show and validate applicability and flexibility of the model. Results show that the proposed model presents a systematic framework which enables the logistics manager (LM) to adjust the search direction during the solution procedure to obtain a desired satisfactory solution.
Distributed generations (DGs) are recently in growing attention as a solution to environmental and economical challenges caused by conventional power plants. In this study, a multi-objective framework as a nonlinear p...
详细信息
Distributed generations (DGs) are recently in growing attention as a solution to environmental and economical challenges caused by conventional power plants. In this study, a multi-objective framework as a nonlinearprogramming (NLP) is proposed for optimal placement and sizing of DG units. Objective functions include minimising the number of DGs and power losses as well as maximising voltage stability margin formulated as a function of decision variables. The objective functions are combined into one objective function. To avoid problems with choosing appropriate weighting factors, fuzzification is applied to objective functions to bring them into the same scale. DG units are placed at more efficient buses rather than end buses of radial links as usually determined by previous methods for improving voltage stability. Also, power system constraints including branch and voltage limits are observed in the problem. The proposed method not only is able to model all types of DG technologies but also it employs adaptive reactive limits for DGs rather than fixed limits. In addition, a three-stage procedure is proposed to gradually solve the multi-objective problem in order to prevent infeasible solutions. Also, a new technique is proposed to formulate the number of DGs without converting the NLP problem into mixed-integer NLP. Results of testing the proposed method show its efficiency.
In this research, the no-wait flowshop sequence-dependent setup time scheduling problem with minimization of weighted earliness and tardiness penalties as the criterion, typically classified as F-m vertical bar nwt, S...
详细信息
In this research, the no-wait flowshop sequence-dependent setup time scheduling problem with minimization of weighted earliness and tardiness penalties as the criterion, typically classified as F-m vertical bar nwt, S-ijk vertical bar Sigma w(j)'E-j + w(j)'' T-j is investigated. A mixed integer linear programming model for the research problem is proposed. As the problem is shown to be strongly NP-hard, several metaheuristic algorithms based on tabu search (TS) and particle swarm optimization (PSO) algorithms are developed to heuristically solve the problem. A timing algorithm is generated to find the optimal schedule and calculate the objective function value of a given sequence. In order to compare the performance of the proposed algorithms, random test problems are generated and solved by all metaheuristic algorithms. Computational results show that the PSO algorithm has better performance than TS algorithm especially for the large sized problems. (C) 2013 Elsevier Ltd. All rights reserved.
暂无评论