Search results

To operate with high efficiency and minimise the risks of power failures, power systems require careful monitoring. The availability of real-time data is crucial for assessing the performance of the grid and assisting operators in gauging the present security of the grid. Traditional supervisory control and data acquisition (SCADA)-based systems actually employed provides steady-state measurement values which are the calculation premise of State Estimation. More often, however, the power grid operates under dynamic state and SCADA measurements can lead to erroneous and inaccurate calculation results. The introduction of the phasor measurement unit (PMU) which provides real-time synchronised voltage and current phasors with very high accuracy is universally recognised as an important aspect of delivering a secure and sustainable power system. PMUs are a relatively new technology and because of their high procurement and installation costs, it is imperative to develop appropriate methodologies to determine the minimum number of PMUs as well as their strategic placements to guarantee full observability of a power system. Thus, the problem of the optimal PMU placement (OPP) is formulated as an optimisation problem subject to various constraints to minimise the number of PMUs while ensuring complete observability of the grid. In this chapter, integer linear programming (ILP), genetic algorithm (GA) and non-linear programming (NLP) constrained models of the OPP problem are presented. A new methodology is proposed to incorporate several constraints using the NLP. The optimisation methods have been written in Matlab software and verified on the standard Institute of Electrical and Electronics Engineers (IEEE) 14-bus test system to authenticate their effectiveness. This chapter targets United Nations Sustainable Development Goal 7.

The purpose of this study is to develop a holistic optimization model for an integrated sustainable fleet planning and closed-loop supply chain (CLSC) network design problem under uncertainty.

A novel mixed-integer programming model that is able to consider interactions between vehicle fleet planning and CLSC network design problems is first developed. Uncertainties of the product demand and return fractions of the end-of-life products are handled by a chance-constrained stochastic program. Several Pareto optimal solutions are generated for the conflicting sustainability objectives via compromise and fuzzy goal programming (FGP) approaches.

The proposed model is tested on a real-life lead/acid battery recovery system. By using the proposed model, sustainable fleet plans that provide a smaller fleet size, fewer empty vehicle repositions, minimal CO₂ emissions, maximal vehicle safety ratings and minimal injury/illness incidence rate of transport accidents are generated. Furthermore, an environmentally and socially conscious CLSC network with maximal job creation in the less developed regions, minimal lost days resulting from the work's damages during manufacturing/recycling operations and maximal collection/recovery of end-of-life products is also designed.

Unlike the classical network design models, vehicle fleet planning decisions such as fleet sizing/composition, fleet assignment, vehicle inventory control, empty repositioning, etc. are also considered while designing a sustainable CLSC network. In addition to sustainability indicators in the network design, sustainability factors in fleet management are also handled. To the best of the authors' knowledge, there is no similar paper in the literature that proposes such a holistic optimization model for integrated sustainable fleet planning and CLSC network design.

This research is aimed to mainly be applicable to expediting engineering projects, uses the method of inverse optimization and the double-layer nested genetic algorithm combined with nonlinear programming algorithm, study how to schedule the number of labor in each process at the minimum cost to achieve an extremely short construction period goal.

The method of inverse optimization is mainly used in this study. In the first phase, establish a positive optimization model, according to the existing labor constraints, aiming at the shortest construction period. In the second phase, under the condition that the expected shortest construction period is known, on the basis of the positive optimization model, the inverse optimization method is used to establish the inverse optimization model aiming at the minimum change of the number of workers, and finally the optimal labor allocation scheme that meets the conditions is obtained. Finally, use algorithm to solve and prove with a case.

The case study shows that this method can effectively achieve the extremely short duration goal of the engineering project at the minimum cost, and provide the basis for the decision-making of the engineering project.

The contribution of this paper to the existing knowledge is to carry out a preliminary study on the relatively blank field of the current engineering project with a very short construction period, and provide a path for the vast number of engineering projects with strict requirements on the construction period to achieve a very short construction period, and apply the inverse optimization method to the engineering field. Furthermore, a double-nested genetic algorithm and nonlinear programming algorithm are designed. It can effectively solve various optimization problems.

The paper aims to introduce a novel concept to solve the bi-level multi-criteria nonlinear fractional programming (BL-MCNFP) problems. Bi-level programming problem (BLPP) is rigorously flourished and studied by several researchers, which deals with decentralized decisions by comprising a sequence of two optimization problems, namely upper and lower-level problems. However, on the other hand, many real-world decision-making problems involve multiple objectives with fraction aspects, called fractional programming problems that reflect technical and economic performance.

This paper introduces a VIKOR (“VlseKriterijumska Optimizacija I Kompromisno Resenje”) approach to solve the BL-MCNFP problem. In this approach, an aggregating function based on L_P metrics is formulated on the basis of the “closeness” scheme from the “ideal” solution. The three steps perform the solution process: First, a new concept is attempted to minimize and maximize of the numerators and denominators from their respective ideal solutions and anti-ideal values simultaneously. Second, for each level, the K-dimensional objective space of each level is converted to a one-dimensional space by an aggregating function. Third, to obtain the final solution, all levels are combined into single-level model where the decision variables of upper levels are interrelated with other levels through fuzzy strategy-based linear and nonlinear membership functions.

The effectiveness of the proposed VIKOR is demonstrated by numerical examples, where the reported results affirm that the extended VIKOR method provides superior results in comparison with the same methods in the literature, and it is a good alternative to BL-MCNFP problems.

In terms of the assistance-based right decision, a parametric analysis for the weight of the majority is provided to exhibit a wide range of compromise solutions for the decision-maker.

Ready-mix concrete delivery problem (RMCDP), a specific version of the vehicle routing problem (VRP), is a relevant supply-chain engineering task for construction management with various formulations and solving methods. This problem can range from a simple scenario involving one source, one material and one destination to a more challenging and complex case involving multiple sources, multiple materials and multiple destinations. This paper presents an Internet of Things (IoT)-supported active building information modeling (BIM) system for optimized multi-project ready-mix concrete (RMC) delivery.

The presented system is BIM-based, IoT supported, dynamic and automatic input/output exchange to provide an optimal delivery program for multi-project ready-mix-concrete problem. The input parameters are extracted as real-time map-supported IoT data and transferred to the system via an application programming interface (API) into a mixed-integer linear programming (MILP) optimization model developed to perform the optimization. The obtained optimization results are further integrated into BIM by conventional project management tools. To demonstrate the features of the suggested system, an RMCDP example was applied to solve that included four building sites, seven eligible concrete plants and three necessary RMC mixtures.

The system provides the optimum delivery schedule for multiple RMCs to multiple construction sites, as well as the optimum RMC quantities to be delivered, the quantities from each concrete plant that must be supplied, the best delivery routes, the optimum execution times for each construction site, and the total minimal costs, while also assuring the dynamic transfer of the optimized results back into the portfolio of multiple BIM projects. The system can generate as many solutions as needed by updating the real-time input parameters in terms of change of the routes, unit prices and availability of concrete plants.

The suggested system allows dynamic adjustments during the optimization process, andis adaptable to changes in input data also considering the real-time input data. The system is based on spreadsheets, which are widely used and common tool that most stakeholders already utilize daily, while also providing the possibility to apply a more specialized tool. Based on this, the RMCDP can be solved using both conventional and advanced optimization software, enabling the system to handle even large-scale tasks as necessary.

The present work seeks to determine the optimal delivery schedule of equipment at a project site in the backdrop of limited storage space, at a minimum cost, and without disturbing the overall project schedule. In addition, the optimized delivery schedule helps in minimizing the fluctuating requirements of space at the project site across the entire project lifespan.

The study is carried out at a Steel plant operating in a constrained space but undergoing a production capacity expansion. The problem motivated us to explore the possibility of postponing the delivery dates of certain equipment closer to the erection dates without compromising on the project schedule. Given the versatility of linear programming models in dealing with such schedule optimization problems, the authors formulated the above problem as a Zero-One Integer Linear Programming problem.

The model is implemented for all the new equipment arriving for two major units – the Hot Strip Mill (HSM) and the Blast Furnace (BF). It generates an optimized delivery schedule by delaying the delivery of some equipment by a certain number of periods, without compromising the overall project schedule and at a minimum storage cost. The average space utilization increases by 25.85 and 14.79% in HSM and BF units respectively. The fluctuations in space requirements are reduced substantially in both units.

The study shows a timeline in the form of a Gantt chart for the delivery of equipment, storage of equipment across different periods, and the number of periods for which the delivery of certain equipment needs to be postponed. The study uses linearly increasing storage costs with the increase in the number of periods for storage of the equipment in the temporary shed.

1. Determined the optimal delivery schedule of the equipment in a project environment in the backdrop of limited storage space in the project site.

2. Formulated the above problem as a Zero-One Integer Linear Programming (ILP) problem.

3. The average space utilization has increased by 25.85 and 14.79% in HSM and BF units respectively.

4. The optimized delivery schedule helps in reducing the fluctuations in space requirements substantially across the entire lifespan of the project.

5. The timeline of delivery of equipment, storage of equipment across different periods and periods of postponement of the equipment are shown in the form of a Gantt Chart.

Determined the optimal delivery schedule of the equipment in a project environment in the backdrop of limited storage space in the project site.

Formulated the above problem as a Zero-One Integer Linear Programming (ILP) problem.

The average space utilization has increased by 25.85 and 14.79% in HSM and BF units respectively.

The optimized delivery schedule helps in reducing the fluctuations in space requirements substantially across the entire lifespan of the project.

The timeline of delivery of equipment, storage of equipment across different periods and periods of postponement of the equipment are shown in the form of a Gantt Chart.

The site layout has a significant impact on the efficiency of construction operations. Planning an effective site layout partly involves identifying and positioning temporary facilities such as tower cranes and areas on the jobsite for materials storage. This study proposes an approach to optimizing the type and location of the tower crane and material supply point on construction sites.

The problem is formulated into an integer linear programming (ILP) model considering the total cost of material transportation as the objective function and site conditions as constraints. The efficacy of the approach is demonstrated by finding the optimum site layout for a numerical example. The proposed model is validated and verified using two methods.

Results indicate that the proposed model successfully identifies the type and location of the tower crane and the location of material supply point, leading to approximately 20% cost reduction compared with when such features of a site layout are decided solely based on experience and educated guesses of the construction manager.

The primary contribution of this study is to present a modified linear mathematical model for site layout optimization that exhibits improved performance compared with previous models. The type and location of the tower crane and the material supply point as decision variables are extracted directly from solving the proposed model. The proposed model will help enhance time and cost efficiency on construction sites.

This chapter of the book aims to introduce multiobjective linear programming (MLP) as an optimum tool to find the best quality engineering techniques (QET) in the main domains of supply chain management (SCM). The importance of finding the best quality techniques in SCM elements in the shortest possible time and at the least cost allows all organizations to increase the power of experts’ analysis in supply chain network (SCN) data under cost-effective conditions. In other words, this chapter aims to introduce an operations research model by presenting MLP for obtaining the best QET in the main domains of SCM. MLP is one of the most determinative tools in this chapter that can provide a competitive advantage. Under goal and system constraints, the most challenging task for decision-makers (DMs) is to decide which components to fund and at what levels. The definition of a comprehensive target value among the required goals and determining system constraints is the strength of this chapter. Therefore, this chapter can guide the readers to extract the best statistical and non-statistical techniques with the application of an operations research model through MLP in supply chain elements and shows a new innovation of the effective application of operations research approach in this field. The analytic hierarchy process (AHP) is a supplemental tool in this chapter to facilitate the relevant decision-making process.

Lightweight, open construction cotton knitted fabrics generally do not impart good protection from solar ultraviolet radiation (UVR). As lightweight 100% cotton single jersey is highly cherished for summerwear, it is sine qua non to understand the structural parameters that effectively strike a good balance between UV protection and thermophysiological comfort of the wearer. Relatively heavy fabrics protect from UVR, but comfort is compromised because of waning porosity, increase in thickness and thermal insulation. The purpose of this paper is to engineer knits that will bestow maximum UV protection while preserving the thermophysiological comfort of the wearer.

In total, 27 cotton single jersey fabrics with different areal densities and yarn counts were selected. Ultraviolet protection factor (UPF) was calculated based on the work of Imrith (2022). To précis, the authors constructed a UV box to measure the UPF of fabrics, denoted as UPF_B. UPF_B data were correlated with AATCC 183-2004 and yielded high correlation, R² 0.977. It was concluded that UPF 50 corresponds to UPF_B 94.3. Thermal comfort properties were measured on the Alambeta and water-vapour resistance on the Permetest. Linear programming (LP) was used to optimize UPF_B and comfort. Linear optimization focused on maximizing UPF_B while keeping the thermophysiological comfort and areal density as constraints.

The resulting linear geometrical and sensitivity analyses generated multiple technically feasible solutions of fabrics thickness and porosity that gave valid UPF_B, thermal absorptivity and water-vapour and thermal resistance. Subsequently, an interactive optimization software was developed to predict the stitch length, tightness factor and yarn count for optimum UPF_B from a given areal density. The predicted values were then used to knit seven 100% cotton single jersey fabrics and were tested for UV protection. All seven fabrics gave UPF_B above the threshold, that is, higher than 94.3. The mathematical model demonstrated good correlations with the optimized parameters and experimental values.

The optimization software predicted the optimum UPF_B reasonably well, starting from the fabric structural and constructional parameters. In addition, the models were developed as interactive user interfaces, which can be used by knitted fabric developers to engineer cotton knits for maximizing UV protection without compromising thermophysiological comfort. It has been demonstrated that LP is an efficient tool for the optimization and prediction of targeted knitted fabrics parameters.

This paper investigates a problem in a reverse logistics (RLs) network to decide whether to dispose of unsold goods in primary stores or re-commercialize them in outlet centers. By deducting the costs associated with each policy from its revenue, this study aims to maximize the profit from managing unsold goods.

A new mixed-integer linear programming model has been developed to address the problem, which considers the selling prices of products in primary and secondary stores and the costs of transportation, cross-docking and returning unwanted items. As a result of uncertain nature of the cost and time parameters, gray numbers are used to deal with it. In addition, an innovative uncertain solution approach for gray programming problems is presented that considers objective function satisfaction level as an indicator of optimism.

According to the results, higher costs, including transportation, cross-docking and return costs, make sending goods to outlet centers unprofitable and more goods are disposed of in primary stores. Prices in primary and secondary stores heavily influence the number of discarded goods. Higher prices in primary stores result in more disposed of goods, while higher prices in secondary stores result in fewer. As a result of the proposed method, the objective function satisfaction level can be viewed as a measure of optimism.

An integral contribution of this study is developing a new mixed-integer linear programming model for selecting the appropriate goods for re-commercialization and choosing the best outlet center based on the products' price and total profit. Another novelty of the proposed model is considering the matching percentage of boxes with secondary stores’ desired product lists and the probability of returning goods due to non-compliance with delivery dates. Moreover, a new uncertain solution approach is developed to solve mathematical programming problems with gray parameters.