Search

This paper provides a mathematical optimization strategy for optimal municipal solid waste management in the context of the COVID-19 epidemic. This strategy integrates two approaches: optimization and machine learning models. First, the optimization model determines the optimal supply chain for the municipal waste management system. Then, machine learning prediction models estimate the required parameters over time, which helps generate future projections for the proposed strategy. The optimization model was coded in the General Algebraic Modeling System, while the prediction model was coded in the Python programming environment. A case study of New York City was addressed to evaluate the proposed strategy, which includes extensive socioeconomic data sets to train the machine learning model. We found the predicted waste collection over time based on the socioeconomic data. The results show trade-offs between the economic (profit) and environmental (waste sent to landfill) objectives for future scenarios, which can be helpful for possible pandemic scenarios in the following years. [ABSTRACT FROM AUTHOR]

In recent years, there has been an increasing need to understand the complex interdependencies between critical infrastructure systems, for example, electric power, natural gas, and potable water. Whereas open-source and commercial tools for the independent simulation of these systems are well established, frameworks for cosimulation with other systems are nascent and tools for co-optimization are scarce—the major challenge being the hidden combinatorics that arise when connecting multiple-infrastructure system models. Building toward a comprehensive solution for modeling interdependent infrastructure systems, this work presents InfrastructureModels, an extensible, open-source mathematical programming framework for co-optimizing multiple interdependent infrastructures. This work provides new insights into methods and programming abstractions that make state-of-the-art independent infrastructure models composable with minimal additional effort. To that end, this paper presents the design of the InfrastructureModels framework, documents key components of the software's implementation, and demonstrates its effectiveness with three case studies on canonical co-optimization tasks arising in interdependent infrastructure systems. History: Accepted by Ted Ralphs, Area Editor for Software Tools. Funding: The work was funded by Los Alamos National Laboratory's Directed Research and Development project "The Optimization of Machine Learning: Imposing Requirements on Artificial Intelligence" and the U.S. Department of Energy's Office of Electricity Advanced Grid Modeling projects "Joint Power System and Natural Gas Pipeline Optimal Expansion Planning" and "Coordinated Planning and Operation of Water and Power Infrastructures for Increased Resilience and Reliability." This work was carried out under the U.S. DOE contract no. [DE-AC52-06NA25396]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0118) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0118). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

The issue of transportation is a particular type of mathematical programming that facilitates searching for and determining an optimal distribution network, considering the set of suppliers and recipients. This paper uses a numerical example to present a solution to a transport problem utilizing classical computation methods, i.e., the northwest corner, the least cost in a matrix, and the VAM approximation method. The objective of the paper was to develop tools in the form of algorithms that would then be implemented in three various computing environments (R, GNU Octave, and Matlab) that allow us to optimize transport costs within an assumed supply network. The model involved determining decision variables and indicating limiting conditions. Furthermore, the authors interpreted and visualized the obtained results. The implementation of the proposed solution enables users to determine an optimal transport plan for individually defined criteria. [ABSTRACT FROM AUTHOR]

Purpose: This research develops a model to improve the quality and freshness of sold vegetables through a funding program between farmers and retailers. Through this program, retailers who are interested in the distribution of first quality vegetables provide funds to farmers to increase their production this type of vegetables through the acquisition of new machinery, technology, or training. Design/methodology/approach: The problem is solved through a multi-objective mathematical programming model that simultaneously optimizes the supply chain profits, the waste of vegetables, the economic unfairness among farmers, the unfairness in the distribution of funds, and the freshness of sold vegetables. The ε-constraint method is used to obtain several non-dominated solutions to the problem after linearizing the non-lineal equations related to the unfairness objectives. Findings: Results show that it is possible to improve the indicators related to the vegetable waste, the economic unfairness, the unfairness in the distribution of funds and the freshness of vegetables while maintaining similar to optimal profits for the supply chain. Interesting trade-offs between the five objectives are identified, which can be used by supply chain members to select the most appropriate solution to be implemented in the real supply chain. Originality/value: This research models aspects relevant to the agri-food sector that have not been previously modelled for the problem under study. The main novelties of this paper are the consideration of the limited shelf life of the vegetables as well as the requirement of ensuring a minimum freshness at the moment of their sale, the price dependence on the quality and freshness of vegetables, the optimization of vegetable waste and the freshness of vegetables sold, as well as the joint optimization of the five previously defined objectives. [ABSTRACT FROM AUTHOR]

In the context of project management, the attention given to project portfolio management has increased in recent years. The use of mathematical programming for portfolio management is also on the rise, because it integrates the project interactions with the multiple objectives of portfolio management into a single model. Among the possible objectives, recent studies have paid special attention to the emerging objective of future preparedness, which has not yet been incorporated into the existing mathematical models. This paper presents a mixed-integer nonlinear optimization model for portfolio selection that considers four main performance measures for project management, namely, value maximization, strategic alignment, balance, and future preparedness. Given the importance of the last measure, the purpose of this paper is to provide a more complete model that provides the marginal contribution and the best combination of projects according to the needs of the company. The model is tested using real data from two companies, one in Brazil and one in Canada, and the results obtained are coherent with their respective practices. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel data-driven optimization approach for trajectory-based air traffic flow management (ATFM). A key aspect of the proposed approach is the inclusion of airspace users' trajectory preferences, which are computed from traffic data by combining clustering and classification techniques. Machine learning is also used to extract consistent trajectory options, whereas optimization is applied to resolve demand-capacity imbalances by means of a mathematical programming model that judiciously assigns a feasible four-dimensional trajectory and a possible ground delay to each flight. The methodology has been tested on instances extracted from the Eurocontrol data repository. With more than 32,000 flights considered, we solve the largest instances of the ATFM problem available in the literature in short computational times that are reasonable from the practical point of view. As a by-product, we highlight the trade-off between preferences and delays as well as the potential benefits. Indeed, computing efficient solutions to the problem facilitates a consensus between the network manager and airspace users. In view of the level of accuracy of the solutions and the excellent computational performance, we are optimistic that the proposed approach can make a significant contribution to the development of the next generation of air traffic flow management tools. [ABSTRACT FROM AUTHOR]

The prosperity of the agricultural sector is crucial not only for the national economy but also for regional development. For the purpose of agricultural planning and decision making, mathematical programming models are widely used. This paper aims to formulate, apply and evaluate a Lexicographic Goal Programming (LGP) model for the best allocation of land under cultivation for the major crops of central Yasin. It is an extension of the research work [1] which was conducted in this area to maximize the profit of the three crops using Linear Programming (LP). Using the LP model the target was achieved but all the land was allocated for alfalfa being the most beneficial crop among the three. But wheat is a basic need which must be cultivated to a specific amount. Considering this problem we extended the previous work by implementing the LGP approach to satisfy multiple goals such as the allocation of land for wheat, maximization of profit and minimization of capital in the agricultural activity. The LGP model is solved using the Simplex method. The LGP model provided the most satisfactory set of allocations possible and satisfied all three goals. It gave optimum profit of Rs.170003 and capital is minimized to Rs. 73687.678. Compared with the farmer’s plan, the profit of the LGP model increased by 49.39% but compared with the LP model, the profit decreased by 13.11%. Likewise, the total crop production expenditure increased by 4.97% and 1.39% respectively in comparison with the farmer’s plan and LP model. [ABSTRACT FROM AUTHOR]

Demand for electricity is constantly increasing, and production is facing new constraints due to the current world situation. An alternative to standard energy production methodologies is based on the use of renewable sources; however, these methodologies do not produce energy consistently due to weather factors. This results in a significant commitment of the user who must appropriately distribute loads in the most productive time slots. In this paper, a comparison is made between two methods of predicting solar energy production, one statistical and the other meteorological. For this work, a system capable of presenting the scheduling of household appliances is tested. The system is able to predict the energy consumption of the users and the energy production of the solar system. The system is tested using data from three different users, and the mean percentage of consumption reduction is about 77.73%. This is achieved through optimized programming of appliance use that also considers user comfort. [ABSTRACT FROM AUTHOR]

The quality and experience of healthcare systems affect the economy and prosperity of cities all over the world. Governments of several countries are struggling to improve the efficiency of their healthcare systems and decrease healthcare spending costs. In this paper, we discuss one of the most critical and busy processes among healthcare topics: ambulatory care center (ACC) appointment scheduling systems. We investigate the appointment-scheduling issue using a robust optimization framework to minimize operational costs while ensuring the improvement of healthcare service quality. Our findings and insights provide healthcare practitioners with tools to improve operational efficiency and service quality. [ABSTRACT FROM AUTHOR]

Optimization is an important and decisive task in science. Many optimization problems in science are naturally too complicated and difficult to be modeled and solved by the conventional optimization methods such as mathematical programming problem solvers. Meta-heuristic algorithms that are inspired by nature have started a new era in computing theory to solve the optimization problems. The paper seeks to find an optimization algorithm that learns the expected quality of different places gradually and adapts its exploration-exploitation dilemma to the location of an individual. Using birds' classical conditioning learning behavior, in this paper, a new particle swarm optimization algorithm has been introduced where particles can learn to perform a natural conditioning behavior towards an unconditioned stimulus. Particles are divided into multiple categories in the problem space and if any of them finds the diversity of its category to be low, it will try to go towards its best personal experience. But if the diversity among the particles of its category is high, it will try to be inclined to the global optimum of its category. We have also used the idea of birds' sensitivity to the space in which they fly and we have tried to move the particles more quickly in improper spaces so that they would depart these spaces as fast as possible. On the contrary, we reduced the particles' speed in valuable spaces in order to let them explore those places more. In the initial population, the algorithm has used the instinctive behavior of birds to provide a population based on the particles' merits. The proposed method has been implemented in MATLAB and the results have been divided into several subpopulations or parts. The proposed method has been compared to the state-of-the-art methods. It has been shown that the proposed method is a consistent algorithm for solving the static optimization problems. [ABSTRACT FROM AUTHOR]

This paper develops an equilibrium-based model for ex ante analysis of capacity withholding under financial virtual divestiture in a day-ahead market, including one dominant producer and a number of small producers considered as a price-taking competitive fringe. We model the offering problem of the dominant producer as a bilevel optimization problem. In the upper-level problem, the dominant producer derives optimal strategy of physical capacity withholding restricted by operational limits of its own generating units and conditions stated in the financial virtual divestiture. In the lower-level problem, market operator clears the day-ahead market on an hourly basis. We recast the bilevel optimization problem as a mathematical programming with equilibrium constraints problem and convert it to a mixed integer linear programming problem. We show how the application of the financial virtual divestiture may mitigate market power in the day-ahead market, through a case study. The numerical results demonstrate that the dominant producer can exploit technological diversification of its own generating units to exercise market power, even in the presence of this market power mitigation policy. [ABSTRACT FROM PUBLISHER]

Caching at mobile devices and leveraging device-to-device (D2D) communication are two promising approaches to support massive content delivery over wireless networks. The analysis of cache-enabled wireless networks is usually carried out by assuming that devices are uniformly distributed, however, in social networks, mobile devices are intrinsically grouped into disjoint clusters. In this regards, this paper proposes a spatiotemporal mathematical model that tracks the service requests arrivals and account for the clustered devices geometry. Two kinds of devices are assumed, particularly, content clients and content providers. Content providers are assumed to have a surplus memory which is exploited to proactively cache contents from a known library, following a random probabilistic caching scheme. Content clients can retrieve a requested content from the nearest content provider in their proximity (cluster), or, as a last resort, the base station (BS). The developed spatiotemporal model is leveraged to formulate a joint optimization problem of the content caching and spectrum partitioning in order to minimize the average service delay. Due to the high complexity of the optimization problem, the caching and spectrum partitioning problems are decoupled and solved iteratively using the block coordinate descent (BCD) optimization technique. To this end, an optimal and suboptimal solutions are obtained for the bandwidth partitioning and probabilistic caching subproblems, respectively. Numerical results highlight the superiority of the proposed scheme over conventional caching schemes under equal and optimized bandwidth allocations. Particularly, it is shown that the average service delay is reduced by nearly 100% and 350%, compared to the Zipf and uniform caching schemes under equal bandwidth allocations, respectively. [ABSTRACT FROM AUTHOR]

An optimal planning model of the sectional switch and tie line for the distribution network is proposed considering the tradeoff between the system reliability and economy. First, the fault incidence matrices are established for the distribution network, and the explicit analytical expression of the system reliability index is realized by the algebraic operation of the fault incidence matrices and fault parameter vectors. Then, the 0–1 integer quadratically constrained optimization model is established for the sectional switch configuration considering the capacity constraint of the tie line. Finally, the sectional switches and tie lines are optimized jointly to ensure the economic investment and maximize the system reliability. The distribution network in Taiwan Power Company is used to verify the applicability of the proposed optimization method. Compared with the intelligent optimization algorithm, the mathematical programming method in this paper can always find the global optimal switch configuration quickly. In addition, the influence of the tie line capacity constraints on the sectional switch configuration is also considered, which can provide practical reference for the power network planners in the optimization design of the distribution network. [ABSTRACT FROM AUTHOR]

Energy-aware scheduling in a manufacturing environment with real-time energy pricing is a challenging problem. The purpose of this paper is to study a nonpreemptive scheduling problem on a single-machine to minimize the total tardiness and total energy cost under time-of-use electricity tariffs, which is a mixed-integer multi-objective mathematical programming model. To achieve these objectives, we develop several new holistic genetic algorithms. The proposed model is solved via several methods including weighted sum method and multiobjective genetic algorithms based on dominance rank (GA-1), weighted sum aggregation (GA-2), dominance ranking procedure and crowding distance comparison (GA-3), and heuristic approach (GA-H). This paper illustrates that operations management, which is typically observed as a significant technique that allows manufacturing to operate in challenging data enabled environment in an industrial internet of things ecosystem, can also carefully optimize a production process to improve energy cost in order to manage environmental challenges. Thus, the findings provide information on when to start each job. We provide detailed experimental results evaluating the performance of the proposed algorithms. In a case study, we illustrate how the results of the multiobjective model could be utilized in decision making using the technique for order preference by similarity to ideal solution method. [ABSTRACT FROM AUTHOR]

Recently, the concept of network virtualization and network slicing attracted significant attention from both industry and academia as a key component of the evolving 5G architecture to allow the efficient entrance of vertical industries and tackle increased aggregate traffic by flexible network re-configurability. However, the potential price to be paid for facilitating network slicing in a multi-tenant virtual network is the underutilization of the scarce wireless network resources due to the different tenant requirements and the inherent dynamics of the traffic. A potential way to avoid such sacrifice of radio resources is to allow efficient inter-tenant resource sharing. To this end, this paper proposes a novel optimization framework for flexible inter-tenant resource sharing embedded with transmission power control to aggressively improve network capacity, the utilization of wireless access resources, user data rate as well as energy efficiency. More specifically, we define two novel resource sharing mechanisms called tight coupling and loose coupling, respectively, via mixed integer linear programming formulations. Furthermore, two resource and power joint allocation algorithms are designed to solve the optimization problem in polynomial time. Based on 3GPP network parameterization, a rigorous analysis via a wide set of numerical investigations reveal that significant gains in network throughput, individual user rate, and energy efficiency can be achieved compared with current baseline network slicing methods and constant power resource sharing algorithms. [ABSTRACT FROM AUTHOR]

This paper proposes a new control chart, denoted by $$ {\overset{-}{X}}^{att} $$ , for evaluating the stability of a process mean. This chart is based on attribute inspection rather than physical measurements (taken with an instrument such as a caliper or precise balance) of the quality characteristics of interest of the sampled items. Based on a go-no-go gauge device (which generates five categorizations), the average of a quality characteristic of interest is controlled. In equally spaced times, samples of n items are collected, and the averages are estimated by means of $$ {\overset{-}{X}}^{att} $$ based solely on the obtained categorization to decide whether the process is in control. Once the distribution of $$ {\overset{-}{X}}^{att} $$ is calculated, the decision problem is defined in terms of a mathematical programming formulation to find the dimensions to be used in the go-no-go gauge and to find the control limits that minimize the average run length (ARL) for the out-of-control situation and that are constrained to a prefixed ARL for the under-control situation. As shown by extensive computational experiments, the newly introduced $$ {\overset{-}{X}}^{att} $$ control chart outperforms the conventional $$ \overset{-}{X} $$ control chart for small shifts in the means and is still competitive otherwise. Because the new $$ {\overset{-}{X}}^{att} $$ control chart uses attributes, it can be considered a viable alternative to the conventional $$ \overset{-}{X} $$ control chart. [ABSTRACT FROM AUTHOR]

Graph cuts are widely used in computer vision. To speed up the optimization process and improve the scalability for large graphs, Strandmark and Kahl introduced a splitting method to split a graph into multiple subgraphs for parallel computation in both shared and distributed memory models. However, this parallel algorithm (the parallel BK-algorithm) does not have a polynomial bound on the number of iterations and is found to be non-convergent in some cases due to the possible multiple optimal solutions of its sub-problems. To remedy this non-convergence problem, in this paper, we first introduce a merging method capable of merging any number of those adjacent sub-graphs that can hardly reach agreement on their overlapping regions in the parallel BK-algorithm. Based on the pseudo-boolean representations of graph cuts, our merging method is shown to be effectively reused all the computed flows in these sub-graphs. Through both splitting and merging, we further propose a dynamic parallel and distributed graph cuts algorithm with guaranteed convergence to the globally optimal solutions within a predefined number of iterations. In essence, this paper provides a general framework to allow more sophisticated splitting and merging strategies to be employed to further boost performance. Our dynamic parallel algorithm is validated with extensive experimental results. [ABSTRACT FROM PUBLISHER]

Biochar application and enhanced weathering are negative emission technologies (NETs) with the potential for large-scale deployment for the removal of CO2 from the atmosphere. Biochar is a solid product of pyrolysis that can permanently store carbon when applied in soil due to its chemical recalcitrance. Enhanced weathering is based on the acceleration of the natural reaction of moisture, CO2, and alkaline minerals. Both of these NETs rely on the application of pulverized material to different types of terrestrial sinks, which can include marginal and agricultural land. These two NETs can be used separately or concurrently, depending on local sink conditions. In some cases, simultaneous application of biochar and mineral powder to soil has the advantage of attaining additional beneficial effects of soil amendment. Although recent papers have reported the development of process integration models for optimizing carbon management networks based on either biochar application or enhanced weathering, none have reported models integrating these two NETs in the same system. To address this gap, a fuzzy mixed-integer linear programming model is developed that integrates biochar application and enhanced weathering for large-scale carbon sequestration. Fuzzy set theory provides a well-tested framework for integration of both subjectivity and uncertainty into mathematical programming. The model determines the optimal allocation of biochar and/or alkaline minerals from each source to each sink, while considering the application limits and CO2 sequestration potential. An illustrative case study is solved that clearly demonstrates the application of the model. The case study shows interesting results that can guide how the full sustainable potential of these two technologies can be utilized in a carbon management network. [ABSTRACT FROM AUTHOR]

This paper presents a mathematical programming model for the optimal location of new industrial plants considering simultaneously the integration of the gaseous emissions and the environmental constrains for the surroundings by synthesizing recycle and reuse networks. The model considers different options to locate the new plant and to integrate it with the neighboring urban areas that may be affected by the installation of the new plant because of the gaseous emissions. Air quality conditions and targets for each city (e.g., wind direction, speed to calculate the dispersion parameters, regulations, etc.) are considered. The objective function minimizes the total annual cost needed for the installation of the new plant, the treatment of gaseous streams, and the fresh sources required by the process units. Three examples for the installation of new plants in Mexico are considered to show the applicability of the proposed model. The results show that the proposed model is capable of identifying the optimal integration inside and outside the plant for the gaseous streams. The model also identifies the governmental incentives required to install the new plant in a specific location. These incentives are based on economic aspects as well as social benefits characterized by the generation of jobs. In addition, the proposed model is useful to identify the set of Pareto solutions that trade off the economic and the environmental objectives. [ABSTRACT FROM AUTHOR]

To satisfy the rapidly growing demands of wireless communications, new structures have been proposed for the fifth-generation (5G) mobile communication networks, such as cloud radio access networks (C-RANs), which have advantages including high energy efficiency, large network capacity, and high flexibility. This paper concentrates on the problem of remote radio head (RRH) activation, user association, and power allocation in C-RANs. To tackle the problem with $l_{0}$ norm, we transform it into a mixed-integer nonlinear programming (MINLP) problem. Instead of solving it by centralized solvers, we propose a novel algorithm based on Benders decomposition, which can obtain the optimal solution of the MINLP problem. To solve the primal problem in Benders decomposition efficiently, we adopt the alternating direction method of multipliers (ADMM) to achieve a parallel implementation. To further reduce the complexity of solving the MINLP problem, a distributed two-stage iterative algorithm combining the ADMM and the max-sum algorithm is also proposed. The simulation results demonstrate that the first proposed algorithm can obtain the optimal solution, and the second proposed algorithm outperforms conventional algorithms significantly. [ABSTRACT FROM AUTHOR]

Accidents, bad weathers, traffic congestions, etc. led to the uncertainties of travel times in real-life road networks, which greatly affected the quality of individual’s life and the reliability of transportation system. This paper addressed the school bus routing problem in such a stochastic and time-dependent road environment. Firstly, the problem was set based on a single-school configuration, and the students were picked up at their homes, which was in line with the current situation of school bus systems in China. Thus, it could be regarded as an independent problem of school bus route generation in random dynamic networks, which could be solved as a variant of extended Vehicle Routing Problem. However, due to the fluctuation and uncertainty of link travel times, the arrival time at each stop including the destination was varying. Therefore, the selection of optimal path connecting the current service node with the next one was treated as a sub-problem in this study, where the reliability of travel times in the stochastic and time-varying network was highly concerned by such time-rigid commuters. To this end, a Robust Optimal Schedule Times model with a hard time windows constraint was built to generate a most cost-reliable route for school buses. By the use of Robust Optimization method, it was intended to minimize the worst-case total cost which combined the cost of earlier schedule delays with the disutility of travel times. It was also proved that the proposed model could be converted into solving a conventional problem in deterministic dynamic networks for a reduction of computation complexity, which provided the potential of applying to the practical problems. Finally, the validity of the proposed model and its performance evaluation was analyzed through a small-scale computational instance, where all the link travel times in the simulated network were attributed to both time-varying and stochastic. Then, a mathematical programming solver was used to find the exact optimal solution. The results indicated that the model was valid, and the necessity of considering the stochastic and time-dependent nature of transportation networks was also confirmed in the case study. [ABSTRACT FROM AUTHOR]

This paper makes a contribution to the branch and cut approach to the capacitated vehicle-routing problem (CVRP). In the CVRP, the demands of a set of customers have to be met at minimum total travel cost using vehicles of identical capacity based at a single depot. The potential of maximally violated mod-p cutting-planes (Caprara et al. 2000) for the CVRP is investigated via a computational study. The foundation of the assessment is formed by classes of problem-specific constraints taken from the literature. In several separation algorithms for the CVRP, it is advantageous to shrink inclusionwise maximal minimum-weight cuts in support graphs as preprocessing. It is mentioned how a partition of the set of customers into such mincuts can be computed in a fast and elegant way using the mincut algorithm of Hao and Orlin (1994). Interestingly, maximally violated mod-p cuts, which are general-purpose cuts of Chvátal-Gomory type, stand comparison with problem-specific cuts for the CVRP and they are clearly useful on top of such cuts. The first-time proven optimal solution of the CVRP instance B-n68-k9 is reported. The computation used a branching strategy with far lookahead and relied on maximally violated mod-p cuts. This paper on maximally violated cuts belongs to a set of papers originating from Applegate et al. (1995) where a separation of maximally violated combs for the traveling-salesman problem (TSP) is suggested. [ABSTRACT FROM AUTHOR]

This study investigates a flow shop scheduling problem with queue time limits and skipping jobs, which are common scheduling requirements for semiconductor and printed circuit board manufacturing systems. These manufacturing systems involve the most complex processes, which are strictly controlled and constrained to manufacture high-quality products and satisfy dynamic customer orders. Further, queue times between consecutive stages are limited. Given that the queue times are limited, jobs must begin the next step within the maximum queue time after the jobs in the previous step are completed. In the considered flow shop, several jobs can skip the first step, referred to as skipping jobs. Skipping jobs exist because of multiple types of products processed in the same flow shop. For the considered flow shop, this paper proposes a mathematical programming formulation and a genetic algorithm to minimize the makespan. The GA demonstrated its strengths through comprehensive computational experiments, demonstrating its effectiveness and efficiency. As the problem size increased, the GA's performance improved noticeably, while maintaining acceptable computation times for real-world fab facilities. We also validated its performance in various scenarios involving queue time limits and skipping jobs, to further emphasize its capabilities. [ABSTRACT FROM AUTHOR]

This research investigates the effectiveness of loops and paths as embedded in a modified pinch package (Aspen Energy Analyzer), that comprises a blend of traditional pinch technique with mathematical programming, in simultaneous optimization of total annual cost (TAC) in heat exchanger network synthesis (HENS). It uses composite curves, grand composites curves, supertargeting and looping system just as in pinch, as well as linear programming and mixed integer linear programming (MILP) in the design of HENs. The tool was adopted in solving some literature problems that had earlier been solved using pinch and mathematical programming techniques. The results obtained compared well with those of various authors that used different techniques as shown in the tables of cost comparison in this paper. The loop and path optimization technique adopted in this research obtained the least TAC in four out of five problems solved in this paper. This shows that loop and path optimization as available in a software-combining pinch and mathematical programming can be more effective than various other methods that have been adopted in the literature. It further demonstrated that no particular technique can return the lowest TAC for all HENS problems. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to present an optimization model for planning the distribution of materials in earthmoving operations, considering possible interferences between cut-and-fill sections such as rivers, vegetation, topographical features, or expropriations. The earth allocation problem incorporating interferences was modeled as a linear programming problem, aiming to minimize the total earthmoving cost while considering the constraints related to volume balance, construction project duration, and time for the release of traffic. The proposed linear programming model was run by an integrated system, using Excel for data analysis and IBM CPLEX as the optimizer. The mathematical model was evaluated by a sensitivity analysis and validated by a real-world project of a dam access road in the state of Ceará, Brazil. The unit costs and productivity rates used in the fictional example and in the real-world application followed the referential cost system created by Ceará's Secretariat of Infrastructure (SEINFRA-CE). The proposed optimization model achieved reasonable processing times for all tested applications, presenting itself as a viable and efficient option for planning earthmoving operations. Furthermore, the linear programming approach provided a 2.12% cost reduction for the real-world case study, when comparing the optimized solution and original budget. This study explored the problem of earth allocation with interferences using a linear programming approach, while avoiding complex modeling issues found in recent literature. As a result, this paper proposes a user-friendly optimization system that can be easily utilized by construction companies and departments. [ABSTRACT FROM AUTHOR]

As there are various risks of failure in its execution, a composite web service (CWS) requires a transactional mechanism to guarantee its reliable execution. Though the existing service selection methods have considered that its transactional properties may affect its quality of service (QoS) such as its execution time, some of these methods can just give the locally optimal transactional CWS while others can give globally optimal CWS only under a given fixed transactional workflow. This paper addresses the issue of selecting and composing web services via a genetic algorithm (GA) and gives a transaction and QoS-aware selection approach. First, it introduces transactional properties of a single web service and CWS and the transactional rules used to compose them. Next, it conducts the performance analysis of basic workflow patterns such as sequential, parallel, selectable, and loop patterns and develops an algorithm to compute the execution time of a complex CWS. Then, it presents a GA-based approach, which takes into account the execution time, price, transactional property, stability, and penalty-factor, to achieve globally optimal service selection. Finally, this paper reports experimental results that compare the proposed approach with the exhaustive search algorithm, transactional-QoS-driven selection algorithm, and transactional service selection algorithm. The experimental results show that the proposed algorithm is efficient and effective and can give a globally optimal transactional CWS. [ABSTRACT FROM PUBLISHER]

Interconnection wide electric transmission system has been envisioned to facilitate the growth of renewable energy, enhance reliability, improve system operating efficiency, and reduce emissions. In this paper, we propose an explicit planning approach for transmission design at the national level. It has been applied to the U.S. system to design transmission overlays for multiple future generation scenarios. Associated simulation results suggest that a national transmission overlay provides economic, environmental, and system performance benefits. [ABSTRACT FROM PUBLISHER]

Topology optimization is a modern method for optimizing the material distribution in a given space, automatically searching for the ideal design of the product. The method aims to maximize the design performance of the system regarding given conditions. In engineering practice, a given space is first described using the finite element method and, subsequently, density-based method with solid isotropic material with penalty. Then, the final shape is found using a gradient-based method, such as the optimality criteria algorithm. However, obtaining the ideal shape is highly dependent on the correct setting of numerical parameters. This paper focuses on the sensitivity analysis of key formulations of topology optimization using the implementation of mathematical programming techniques in MATLAB software. For the purposes of the study, sensitivity analysis of a simple spatial task—cantilever bending—is performed. This paper aims to present the formulations of the optimization problem—in this case, minimization of compliance. It should be noted that this paper does not present any new mathematical formulas but rather provides an introduction into the mathematical theory (including filtering methods and calculating large-size problems using the symmetry of matrices) as well as a step-by step guideline for the minimization of compliance within the density-based topology optimization and search for an optimal shape. The results can be used for complex commercial applications produced by traditional manufacturing processes or by additive manufacturing methods. [ABSTRACT FROM AUTHOR]

Using convenient stratification criteria such as geographical regions or other natural conditions like age, gender, etc., is not beneficial in order to maximize the precision of the estimates of variables of interest. Thus, one has to look for an efficient stratification design to divide the whole population into homogeneous strata that achieves higher precision in the estimation. In this paper, a procedure for determining Optimum Stratum Boundaries (OSB) and Optimum Sample Sizes (OSS) for each stratum of a variable of interest in health surveys is developed. The determination of OSB and OSS based on the study variable is not feasible in practice since the study variable is not available prior to the survey. Since many variables in health surveys are generally skewed, the proposed technique considers the readily-available auxiliary variables to determine the OSB and OSS. This stratification problem is formulated into a Mathematical Programming Problem (MPP) that seeks minimization of the variance of the estimated population parameter under Neyman allocation. It is then solved for the OSB by using a dynamic programming (DP) technique. A numerical example with a real data set of a population, aiming to estimate the Haemoglobin content in women in a national Iron Deficiency Anaemia survey, is presented to illustrate the procedure developed in this paper. Upon comparisons with other methods available in literature, results reveal that the proposed approach yields a substantial gain in efficiency over the other methods. A simulation study also reveals similar results. [ABSTRACT FROM AUTHOR]

Large construction and infrastructure projects are a billion-dollar business, but few studies have addressed the integrated operations in this unique domain of the construction supply chain (CSC). The comparison between the CSC and a conventional supply chain enables us to examine its framework and establish a quantitative optimization model for the CSC. To introduce the integrated operations concept into the CSC, many uncertainties need to be first dealt with, for which a multiobjective uncertain optimization model is developed. As the optimization of the owner and fabricator's costs and the service level are the main objectives, a hybrid genetic algorithm with fuzzy-random method is developed to solve the optimization model. An integrated multiobjective purchasing and production planning model is then constructed and applied to a hydropower construction project in Southwest China. The results illustrate that efficient integrated operations are critical for the CSC performance. The optimization results also indicate that considering of uncertain rush orders and delay times can be vital for optimum CSC performance. With this proposed method, construction managers can quickly respond to changing uncertain demand. This paper has highlighted that project managers need to collaborate with other stakeholders to ensure optimal CSC performance. [ABSTRACT FROM AUTHOR]

This paper provides a summary of some OR/MS software for microcomputers. Lists of packages in many management science techniques are included. A bibliography of other papers is also included. We also summarize the general features of packages in each category. Finally, we mention a few sources to help the reader keep up with the developments in this area. [ABSTRACT FROM AUTHOR]

Manufacturing process optimization is an ever-actual goal. Within this goal, machining parameters optimization is a very important task. Machining parameters strongly influence the manufacturing costs, process productivity and piece quality. Literature presents a series of optimization methods. The results supplied by these methods are comparable and it is difficult to establish which method is the best. For machining parameters optimization, this paper proposes a novel, simple and efficient method, without additional costs related to new software packages. This approach is based on linear mathematical programming. The optimization mathematical models are, however, nonlinear. Therefore, mathematical model linearization is required. The major and difficult problem is the linearization of the objective function. This represents the key element of the proposed optimization method. In this respect, the paper proposes an original mathematical procedure for calculating the part of the objective function that refers to the analytical integration of the tool life into the model. This calculus procedure was transposed into an original software tool. For demonstrating the validity of the method, a comparison is presented among the results obtained by certain optimization techniques. It results that the proposed method is simple and as good as those presented by the literature. [ABSTRACT FROM AUTHOR]

In this paper, we study the multiattribute decision-making (MADM) problem with intuitionistic fuzzy values that represent information regarding alternatives on the attributes. Assuming that the weight information of the attributes is not known completely, we use an approach that utilizes the relative comparisons based on the advantage and disadvantage scores of the alternatives obtained on each attribute. The relative comparison of the intuitionistic fuzzy values in this research use all the three parameters, namely membership degree (“the more the better”), nonmembership degree (“the less the better”), and hesitancy degree (“the less the better”), thereby leading to the tradeoff values of all the three parameters. The score functions (advantage and disadvantage scores) used for this purpose are based on the positive contributions of these parameters, wherever applicable. Furthermore, these scores are used to obtain the strength and weakness scores leading to the satisfaction degrees of the alternatives. The optimal weights of the attributes are determined using a multiobjective optimization model that simultaneously maximizes the satisfaction degree of each alternative. The optimal solution is used for ranking and selecting the best alternative on the basis of the overall attribute values. To validate the proposed methodology, we present a numerical illustration of a real-world case. The methodology is further extended to treat MADM problem with interval-valued intuitionistic fuzzy information. Finally, a thorough comparison is done to demonstrate the advantages of the solution methodology over the existing methods used for the intuitionistic fuzzy MADM problems. [ABSTRACT FROM PUBLISHER]

Microgrids can be operated either grid-connected to reduce system losses and for peak shaving or islanded to increase reliability and provide backup power during utility outage. Such dual configuration capability imposes challenges on the design of the protection system. Fault current magnitudes will vary depending on the microgrid operating mode. In this paper, a microgrid protection scheme that relies on optimally sizing fault current limiters and optimally setting directional overcurrent relays is proposed. The protection scheme is optimally designed taking into account both modes of operation (grid-connected and islanded). The problem has been formulated as a constrained nonlinear programming problem and is solved using the genetic algorithm with the static penalty constraint-handling technique. The proposed approach is tested on two medium-voltage networks: a typical radial distribution system and on the IEEE 30-bus looped power distribution system equipped with directly connected conventional synchronous generators. [ABSTRACT FROM PUBLISHER]

The issue of transportation is a particular type of mathematical programming that facilitates searching for and determining an optimal distribution network, considering the set of suppliers and recipients. This paper uses a numerical example to present a solution to a transport problem utilizing classical computation methods, i.e., the northwest corner, the least cost in a matrix, and the VAM approximation method. The objective of the paper was to develop tools in the form of algorithms that would then be implemented in three various computing environments (R, GNU Octave, and Matlab) that allow us to optimize transport costs within an assumed supply network. The model involved determining decision variables and indicating limiting conditions. Furthermore, the authors interpreted and visualized the obtained results. The implementation of the proposed solution enables users to determine an optimal transport plan for individually defined criteria.

This paper provides a methodology to assist a strategic producer in making informed decisions on generation investment. A single target year is considered with demand variations modeled through blocks. The strategic behavior of the producer is represented through a bilevel model: the upper-level considers both investment decisions and strategic production actions and the lower-level corresponds to market clearing. Prices are obtained as dual variables of power balance equations. Rival uncertainties (on offering and investment) are characterized through scenarios. The resulting model is a large-scale mixed-integer LP problem solvable using currently available branch-and-cut techniques. Results pertaining to an illustrative example and a case study are reported and discussed. [ABSTRACT FROM PUBLISHER]

Time–cost trade-off analysis is addressed as an important aspect of any construction project planning and control. Nonexistence of a unique solution makes the time–cost trade-off problems very difficult to tackle. As a combinatorial optimization problem one may apply heuristics or mathematical programming techniques to solve time–cost trade-off problems. In this paper, a new multicolony ant algorithm is developed and used to solve the time–cost multiobjective optimization problem. Pareto archiving together with innovative solution exchange strategy are introduced which are highly efficient in developing the Pareto front and set of nondominated solutions in a time–cost optimization problem. An 18-activity time–cost problem is used to evaluate the performance of the proposed algorithm. Results show that the proposed algorithm outperforms the well-known weighted method to develop the nondominated solutions in a combinatorial optimization problem. The paper is more relevant to researchers who are interested in developing new quantitative methods and/or algorithms for managing construction projects. [ABSTRACT FROM AUTHOR]

Federated learning is a communication-efficient training process that alternate between local training at the edge devices and averaging of the updated local model at the center server. Nevertheless, it is impractical to achieve perfect acquisition of the local models in wireless communication due to the noise, which also brings serious effect on federated learning. To tackle this challenge in this paper, we propose a robust design for federated learning to decline the effect of noise. Considering the noise in two aforementioned steps, we first formulate the training problem as a parallel optimization for each node under the expectation-based model and worst-case model. Due to the non-convexity of the problem, regularizer approximation method is proposed to make it tractable. Regarding the worst-case model, we utilize the sampling-based successive convex approximation algorithm to develop a feasible training scheme to tackle the unavailable maxima or minima noise condition and the non-convex issue of the objective function. Furthermore, the convergence rates of both new designs are analyzed from a theoretical point of view. Finally, the improvement of prediction accuracy and the reduction of loss function value are demonstrated via simulation for the proposed designs. [ABSTRACT FROM AUTHOR]

In magnetic resonance imaging (MRI) magnets, field shimming technique is, in general, necessary to increase the field homogeneity in imaging region to an acceptable level after manufacturing. This paper presents a novel passive shimming method using permanently magnetized shimming pieces. In the method, the shimming design is modeled as an integer programming problem, and the distribution of shimming pieces is optimized. Through an application to a 0.3-T permanent magnet MRI system, the optimally designed shimming pieces are proven to improve the field homogeneity from 1456 to 784 ppm after just one iteration of shimming courses is carried out. [ABSTRACT FROM AUTHOR]

The prominence of managing municipal solid waste (MSW) in an efficient and effective manner is increasing from day to day. In this paper, the solid waste management (SWM) system of İstanbul is analyzed by applying the techniques from mathematical programming methodology. In this manner, the solutions of the two optimization problems which aim to minimize the total cost and the environmental effects of SWM, respectively, are presented in this study. Additionally, a sensitivity analysis is performed and a multi-objective problem that combines two problems is presented. In this regard, the application of five MSW management technologies which are currently in use in İstanbul on six waste components is analyzed; and the optimal solution regarding the best mixture of these technologies is developed on a given waste composition. Besides, this optimal solution is compared with the current practice in İstanbul; and recommendations are presented about possible future investments for the policymakers. The results of the study emphasize the importance of material recovery and incineration facilities to improve profitability and to minimize environmental side effects. In particular, material recovery facility (MRF) should be expanded to be able to treat all of metal, paper and plastic from a cost management perspective. Incineration (INC) facility should also be expanded in order to treat plastics or organic waste from a Greenhouse Gas (GHG) minimization perspective. In addition to this, landfill appears to be the most prominent treatment technique according to the current problem parameters. However, regarding the waste composition, the amount of organic waste must be decreased by more than 37% for other waste streams to be treated in different facilities other than landfill. Anaerobic digestion and composting facilities need to be more cost-effective for becoming economically feasible. The methodology represented in this study can be extended and generalized to other cities around the world once the correct problem parameters are specified. Image 105510 • Applying multi-objective optimization to solid waste management problem. • Importance of material recovery and incineration to improve profitability. • Landfill appears to be the most prominent treatment technique. • Must decrease the operating costs of composting and anaerobic digestion processes. • Applicable method to other cities after specifying the correct problem parameters. [ABSTRACT FROM AUTHOR]

A professional service firm often faces challenges in matching its available workforce with the demands for service delivery. In this paper, we coin the labor strategy optimization (LSO) problem to prescribe an optimal staffing plan for meeting the target revenues of a professional service firm. It simultaneously optimizes the capacity, capability, location, and flexibility of a firm's workforce at the strategic level. Our modeling framework captures the richness and complexity of a general service transformation process. Mathematical programming based models are developed for both the deterministic and stochastic versions of the problem. A prototype of the LSO technology was implemented at the former HP Consulting & Integration organization. Through a comprehensive computational study, managerial insights are drawn and discussed about the optimal labor strategy under various supply-side risks and uncertainties. The optimal labor strategy provides a cost effective and reliable basis for more detailed workforce optimization concerning scheduling and assignment decisions. Our study also offers a data-driven approach to take advantage of large amount of disparate data, from different organizations and geographical locations of a firm, for improving the workforce planning decisions. [ABSTRACT FROM AUTHOR]

To reduce field-programmable gate array power, Vdd programmability has been recently proposed to select the Vdd level for interconnects and power-gate unused interconnects. However, Vdd-level converters used in the existing Vdd-programmable method consume a large amount of leakage. This paper proposes two ways to avoid using level converters in interconnects, namely; 1) tree-based level converter insertion (TLC) and 2) dual-Vdd tree-based level converter insertion (dTLC). TLC enforces that there is only one Vdd level within each routing tree, while dTLC can have different Vdd levels within a routing tree, but no VddL switch drives VddH switches. Dual-Vdd assignment algorithms were developed considering chip-level time slack allocation for maximum power reduction. The algorithms include TLC-S and dTLC-S, two power sensitivity-based algorithms with implicit time slack allocation, and dTLC-LP, a linear programming (LP)-based algorithm with explicit time slack allocation. All allocate time slack first to interconnects with higher power sensitivity and assign low Vdd to them for more power reduction. Experiments show that dTLC-LP obtains the lowest power consumption. Compared to dTLC-LP, dTLC-S obtains a slightly higher power consumption but runs three times faster. Compared to the existing segment-based level converter insertion for dual Vdd, dTLC-LP reduces interconnect power by 52.90% without performance loss for Microelectronics Center of North Carolina benchmark circuits. [ABSTRACT FROM AUTHOR]

Because of the strong competition in the equipment market, the aim of the manufacturers is to reduce the product price as much as possible, fulfill the high-quality standards, and improve the reliability and efficiency of the transformers. The capitalization of the costs enables to handle the different economic and technological parameters together in the same cost function. Large power autotransformers are usually designed for specific economic and technical conditions specified by the customer. At the tender design stage, the most economical solution has to be found in a limited time, and a great number of feasible transformer designs have to be compared to find the optimal solution. Nowadays, the solution of this design process is mainly based on the experience of the transformer designer, but mathematical programming models can facilitate the process. It is well known that the design of shell-type power transformers can be optimized by geometric programming. The constructed models of geometric programming can be solved accurately with the interior-point-method-based solvers. According to the results, this kind of modeling is not applicable for the core-form transformers. However, with branch-and-bound search, the geometric programming method can also be used for these cases. This paper introduces a new algorithm, which can also handle the autotransformer designs with different positions of the regulating winding by applying a more general metaheuristic routine to perform the calculation of the short-circuit impedance. [ABSTRACT FROM AUTHOR]

The performance of space shift keying (SSK) is known to be dominated by the minimum Euclidean distance (MED) in the received SSK constellation. In this paper, we propose a method of enhancing the MED in the received SSK constellation and improving both the attainable performance and the power efficiency by means of symbol scaling at the transmitter. To this aim, we formulate a pair of optimization problems, one for maximizing the MED subject to a specific transmit power constraint and one for minimizing the transmit power subject to a MED threshold. As these problems are NP-hard, we re-formulate their optimization using semidefinite relaxations, which results in convex problem formulations that can be efficiently solved using standard approaches. Moreover, we design pre-scaling techniques for imperfect channel state information at the transmitter, where the existing approaches are inapplicable. Our results show that the proposed schemes substantially improve the power efficiency of SSK systems with respect to state-of-the-art techniques by offering an improved performance for specific transmit power requirements or, equivalently, a transmit power reduction for a given MED threshold. [ABSTRACT FROM AUTHOR]