Search results

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.

This chapter presents two multicriteria optimization models with bi and triple objectives solved with weighted-sum approach. Solved problems are allocation of personnel in a health care institution. To deal with these problems, mixed integer programming formulation has been applied. Results have shown the impact of problem parameter change for importance of the different objectives. Presented problems have been solved using AMPL programming language with solver CPLEX v9.1, with the use of branch and bound method.

The purpose of this paper is to measure the financial risk and optimal capital structure of a corporation.

Irregular disjunctive programming problems arising in firm models and risk management can be solved by the techniques presented in the paper.

Parallel processing and mathematical modeling provide a fruitful basis for solving ultra-scale non-convex general disjunctive programming (GDP) problems, where the computational challenge in direct mixed-integer non-linear programming (MINLP) formulations or single processor algorithms would be insurmountable.

The test is limited to a single firm in an experimental setting. Repeating the test on large sample of firms in future research will indicate the general validity of Monte-Carlo-based VAR estimation.

The authors show that the risk surface of the firm can be approximated by integrated use of accounting logic, corporate finance, mathematical programming, stochastic simulation and parallel processing.

Parallel processing has potential to simplify large-scale MINLP and GDP problems with non-convex, multi-modal and discontinuous parameter generating functions and to solve them faster and more reliably than conventional approaches on single processors.

Supply chain risk management can effectively reduce the loss of retailers. In this regard, retailers need to consider the competition risks of competitors in addition to the disruption risks. This paper designs a resilient retail supply chain network for perishable foods under the dynamic competition to maximize retailer's profits.

A two-stage mixed-integer non-linear model is presented for designing the supply chain network. In the first stage, an equilibrium model that considers the characteristics of perishable foods is developed. In the second stage, a mixed integer non-linear programming model is presented to deal with the strategic decisions. Finally, an efficient memetic algorithm is designed to deal with large-scale problems.

The optimal the selection of suppliers, distribution centers and the order allocation are found among the supply chain entities. Considering the perishability of agri-food products, the equilibrium retail price and selling quantity are determined. Through a numerical example, the optimal inventory period under different maximum shelf life and the impact of three resilient strategies on retailer's profit, selling price and selling quantity are analyzed.

As for future research, the research can be extended in a number of directions. First, this paper studies the retail supply chain network design problem under competition among retailers. It can be an interesting direction to consider retailers competing with suppliers. Second, the authors can try to linearize the non-linear model and solve the large-scale integer programming problem by exact algorithm. Finally, the freshness of perishable foods gradually declines linearly to zero as the maximum shelf life approaches, and it would be a meaningful attempt to consider the freshness of perishable foods declines exponentially.

This paper innovatively designs the resilient supply chain network for perishable foods under dynamic competition. The retailer's dynamic competition and resilient strategies are considered simultaneously when designing supply chain network for perishable foods. In addition, this paper gives insights into how to obtain the optimal inventory period and compare the retailer's resilient strategies.

The dairy industry needs to make important decisions regarding its supply chain. In a context with many available suppliers, deciding which of them will be part of the supply chain and deciding when to buy raw milk is key to the supply chain performance. This study aims to propose a mathematical model to support milk supply decisions. In addition to determining which producers should be chosen as suppliers, the model decides on a milk pickup schedule over a planning horizon. The model addresses production decisions, inventory, setup and the use of by-products generated in the raw milk processing.

The model was formulated using mixed integer linear programming, tested with randomly generated instances of various sizes and solved using the Gurobi Solver. Instances were generated using parameters obtained from a company that manufactures dairy products to test the model in a more realistic scenario.

The results show that the proposed model can be solved with real-world sized instances in short computational times and yielding high quality results. Hence, companies can adopt this model to reduce transportation, production and inventory costs by supporting decision making throughout their supply chains.

The novelty of the proposed model stems from the ability to integrate milk pickup and production planning of dairy products, thus being more comprehensive than the models currently available in the literature. Additionally, the model also considers by-products, which can be used as inputs for other products.

Distribution network design (DND) has become an important strategic decision for supply chain managers with increasing competitive nature of the industry nowadays. The purpose of this paper is to propose a web-based decision support system (DSS) for fuzzy distribution network optimization. For this purpose, a web-based DSS using fuzzy linear programming model is proposed to solve DND problem under uncertainty and a framework is created to optimize a distribution network.

In this study, the fuzziness in distribution network optimization is addressed. Fuzzy linear programming is used in a DSS to consider the uncertain and imprecise data. A web-based DSS architecture is presented. Furthermore, as an application, distribution network optimization is conducted for a company in the ceramics industry.

By using this DSS, the optimal transshipment amounts in the distribution network and the required facility and distribution centers can be determined for different fuzziness levels. In fact, for different uncertainty levels of input parameters, the planner can understand the range of optimum network planning costs. Based on the results of this study, planners will be able to decide how to develop the distribution network under uncertain demand.

Reviewing previous research in the related literature revealed that there are no studies presenting a web-based DSS using fuzzy linear programming model to solve this type of problems under uncertainty.

Presents a new approach to working set generation for personnel scheduling problems. In full‐time (FT) and mixed‐workforce (MW) experiments, generates the schedules in the working sets from the use of two‐phase heuristic labour scheduling solution procedures. The solution procedures were implemented on a 386 microcomputer and did not require the specification of the size of the working sets in advance. In the FT experiment, the general set‐covering formulations (GSCFs) associated with the produced working sets were solved with integer programming. The new working set procedure yielded optimal integer solutions for all 36 test problems in the FT experiment. Owing to the size and complexity of the problem data in the MW experiment, the GSCFs associated with the working sets were solved with linear programming, and heuristic rounding procedures were applied to obtain feasible integer solutions. The mean labour costs of these solutions averaged 0.69 per cent less than the mean cost of solutions obtained via the application of heuristic rounding procedures applied to the linear programme solutions for the GSCFs associated with the master sets. Compares solution costs for the new working set method with those associated with other working set generation/refinement procedures. Results indicate that the new method produces lower solution costs in less control processing unit time.

Uncertainty in data, whether in real-valued or integer-valued data, may result in infeasible optimal solutions or unreliable efficiency scores and ranking of decision-making units. To handle the uncertainty in integer-valued factors in data envelopment analysis (DEA) models, this study aims to propose a robust DEA model which is applicable in the presence of such factors.

This research focuses on the application of fuzzy interpretation of efficiency to a mixed-integer DEA (MIDEA) model. The robust optimization approach is used to address the uncertain integer-valued parameters in the proposed MIDEA model.

In this study, the authors proposed an MIDEA model without any equality constraint to avoid the arise problem by such constraints in the construction of the robust counterpart of the conventional MIDEA models. We have studied the characteristics and conditions for constructing the uncertainty set with uncertain integer-valued parameters and a robust MIDEA model is proposed under a combined box-polyhedral uncertainty set. The applicability of the developed models is shown in a case study of Malaysian public universities.

This study develops an MIDEA model equivalent to the conventional MIDEA model excluding any equality constraint which is crucial in robust approach to avoid restricted feasible region or infeasible solutions. This study proposes a robust DEA approach which is applicable in cases with uncertain integer-valued parameters, unlike previous studies in robust DEA field where uncertain parameters are generally assumed to be only real-valued.

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 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.