Search results

To discuss a new parallel algorithmic platform (minlp_machine) for complex mixed‐integer non‐linear programming (MINLP) problems.

The platform combines features from classical non‐linear optimization methodology with novel innovations in computational techniques. The system constructs discrete search zones around noninteger discrete‐valued variables at local solutions, which simplifies the local optimization problems and reduces the search process significantly. In complicated problems fast feasibility restoration may be achieved through concentrated Hessians. The system is programmed in strict ANSI C and can be run either stand alone or as a support library for other programs. File I/O is designed to recognize possible usage in both single and parallel processor environments. The system has been tested on Alpha, Sun and Linux mainframes and parallel IBM and Cray XT4 supercomputer environments. The constrained problem can, for example, be solved through a sequence of first order Taylor approximations of the non‐linear constraints and feasibility restoration utilizing Hessian information of the Lagrangian of the MINLP problem, or by invoking a nonlinear solver like SQP directly in the branch and bound tree. minlp_machine( ) has been tested as a support library to genetic hybrid algorithm (GHA). The GHA(minlp_machine) platform can be used to accelerate the performance of any linear or non‐linear node solver. The paper introduces a novel multicomputer partitioning of the discrete search space of genuine MINLP‐problems.

The system is successfully tested on a small sample of representative MINLP problems. The paper demonstrates that – through concurrent nonlinear branch and bound search – minlp_machine( ) outperforms some recent competing approaches with respect to the number of nodes in the branch and bound tree. Through parallel processing, the computational complexity of the local optimization problems is reduced considerably, an important aspect for practical applications.

This paper shows that binary‐valued MINLP‐problems will reduce to a vector of ordinary non‐linear programming on a suitably sized mesh. Correspondingly, INLP‐ and ILP‐problems will require no quasi‐Newton steps or simplex iterations on a compatible mesh.

This study proposes strategies for vaccine center allocation for coronavirus disease (COVID) vaccine by determining the number of vaccination stations required for the vaccination drive, location of vaccination station, assignment of demand group to vaccination station, allocation of the scarce medical professional teams to station and number of optimal days a vaccination station to be functional in a week.

The authors propose a mixed-integer nonlinear programming model. However, to handle nonlinearity, the authors devise a heuristic and then propose a two-stage mixed-integer linear programming (MILP) formulation to optimize the allocation of vaccination centers or stations to demand groups in the first stage and the allocation of vaccination centers to cold storage links in the second stage. The first stage optimizes the cost and average distance traveled by people to reach the vaccination center, whereas the second stage optimizes the vaccine’s holding and storage and transportation cost by efficiently allocating cold storage links to the centers.

The model is studied for the real-world case of Chandigarh, India. The results obtained validate that the proposed approach can immensely help government agencies and policymaking body for a successful vaccination drive. The model tries to find a tradeoff between loss due to underutilized medical teams and the distance traveled by a demand group to get the vaccination.

To the best of our knowledge, there are hardly any studies on a vaccination program at such a scale due to sudden outbreaks such as Covid-19.

The purpose of this paper is to develop a model for the production planning decision of a dairy plant in a multi-product setting under supply disruption risk and demand uncertainty while determining the optimal product-mix and material planning requirement.

A mixed-integer nonlinear programming model is proposed to determine the optimal product-mix that maximizes the expected profit of a dairy. The data are collected through visits to the dairy site, conducting brainstorming sessions with the plant manager and marketing head at the corporate office. Disruption data are collected from the India Meteorological Department, Odisha.

From the analysis, it is recommended that the dairy should not produce curd during the planning period. Moreover, turnover from toned, double toned and baby food is maximum than that of the curd and these products are produced in the planning period. The expected profit increases from its present value when an optimal product-mix is followed. Sensitivity analysis is performed to analyze the effect of demand uncertainty, supply disruption and production quota. The expected profit decreases as the supply failure probability increases.

The model is implemented in a dairy plant under Orissa State Cooperative Milk Producers Federation, Odisha, India. The proposed methodology has not been validated, theoretically. The concerned dairy is based on the Indian context, but the authors believe that the study is highly relevant to other dairies as well.

This study provides a methodology for dairy plant managers to plan production effectively under supply disruption risk with demand uncertainty. It also suggests material requirement planning at different factories of the dairy plant.

This paper develops a mathematical model for the production planning decision of a dairy plant that determines the optimal product-mix, which maximizes the expected profit of a dairy under disruption risk and demand uncertainty (in the Indian context).

This paper seeks to construct a model for inventory management for multiple periods. The model considers not only the usual parameters, but also price quantity discount, storage and batch size constraints.

Mixed 0‐1 integer programming is applied to solve the multi‐period inventory problem and to determine an appropriate inventory level for each period. The total cost of materials in the system is minimized and the optimal purchase amount in each period is determined.

The proposed model is applied in colour filter inventory management in thin film transistor‐liquid crystal display (TFT‐LCD) manufacturing because colour filter replenishment has the characteristics of price quantity discount, large product size, batch‐sized purchase and forbidden shortage in the plant. Sensitivity analysis of major parameters of the model is also performed to depict the effects of these parameters on the solutions.

The proposed model can be tailored and applied to other inventory management problems.

Although many mathematical models are available for inventory management, this study considers some special characteristics that might be present in real practice. TFT‐LCD manufacturing is one of the most prosperous industries in Taiwan, and colour‐filter inventory management is essential for TFT‐LCD manufacturers for achieving competitive edge. The proposed model in this study can be applied to fulfil the goal.

The purpose of this paper is cost optimization of project schedules under constrained resources and alternative production processes (APPs).

The model contains a cost objective function, generalized precedence relationship constraints, activity duration and start time constraints, lag/lead time constraints, execution mode (EM) constraints, project duration constraints, working time unit assignment constraints and resource constraints. The mixed-integer nonlinear programming (MINLP) superstructure of discrete solutions covers time–cost–resource options related to various EMs for project activities as well as variants for production process implementation.

The proposed model provides the exact optimal output data for project management, such as network diagrams, Gantt charts, histograms and S-curves. In contrast to classic scheduling approaches, here the optimal project structure is obtained as a model-endogenous decision. The project planner is thus enabled to achieve optimization of the production process simultaneously with resource-constrained scheduling of activities in discrete time units and at a minimum total cost.

A set of application examples are addressed on an actual construction project to display the advantages of proposed model.

The unique value this paper contributes to the body of knowledge reflects through the proposed MINLP model, which is capable of performing the exact cost optimization of production process (where presence and number of activities including their mutual relations are dealt as feasible alternatives, meaning not as fixed parameters) simultaneously with the associated resource-constrained project scheduling, whereby that is achieved within a uniform procedure.

To maximize the network total profit by calculating the difference between costs and revenue (first objective function). To maximize the positive impact on the environment by integrating GSCM factors in RL (second objective function). To calculate the efficiency of disassembly centers by SDEA method, which are selected as suppliers and maximize the total efficiency (third objective function). To evaluate the resources and total efficiency of the proposed model to facilitate the allocation resource process, to increase resource efficiency and to improve the efficiency of disassembly centers by Inverse DEA.

The design of a closed-loop logistics network for after-sales service for mobile phones and digital cameras has been developed by the mixed-integer linear programming method (MILP). Development of MILP method has been performed by simultaneously considering three main objectives including: total network profit, green supply chain factors (environmental sustainability) and maximizing the efficiency of disassembly centers. The proposed model of study is a six-level, multi-objective, single-period and multi-product that focuses on electrical waste. The efficiency of product return centers is calculated by SDEA method and the most efficient centers are selected.

The results of using the model in a case mining showed that, due to the use of green factors in network design, environmental pollution and undesirable disposal of some electronic waste were reduced. Also, with the reduction of waste disposal, valuable materials entered the market cycle and the network profit increased.

(1) Design a closed-loop reverse logistics network for after-sales services; (2) Introduce a multi-objective multi-echelon mixed integer linear programming model; (3) Sensitivity analysis use Inverse-DEA method to increase the efficiency of inefficient units; (4) Use the GSC factors and DEA method in reverse logistics network.

This paper aims to develop a bi-objective mixed integer non-linear programing model to optimize the supply chain networks consisting of raw material providers, final product manufacturers and distribution centers. Raw material substitution caused by varying raw material supply amounts, prices and carbon emissions and final product substitution due to different product prices and carbon emissions are considered.

The proposed model aims to achieve total profit maximization and total carbon emission minimization. The objective function of carbon emissions is converted into a maximization problem by changing minimum to maximum. The composite objective function is the weighted sum of the bias value of each objective function. The model is then solved using software Lingo12.

Numerical analysis results show that an increase in the number of alternate raw materials for original raw material helps improve supply chain network performance, and variation in that number causes detectable but not significant changes in downstream final product substitution results.

The major differences between this work and existing research are as follows: first, although previous research considered carbon emissions in supply chain network optimization, it has not considered the substitution effects of products or raw materials. This paper considers the substitution of both raw material and productions. Second, the item substitution considered by previous research is derived from inventory shortage or price difference of original items. However, the substitution considered in the present paper is a response to differences in purchase price, production cost and carbon emissions for items.

The paper formulates a bi-objective mixed-integer nonlinear programming model, aimed at minimizing the total labor hours and the workload unfairness for the multi-skilled worker assignment problem in Seru production system (SPS).

Three approaches, namely epsilon-constraint method, non-dominated sorting genetic algorithm 2 (NSGA-II) and improved strength Pareto evolutionary algorithm (SPEA2), are designed for solving the problem.

Numerous experiments are performed to assess the applicability of the proposed model and evaluate the performance of algorithms. The merged Pareto-fronts obtained from both NSGA-II and SPEA2 were proposed as final solutions to provide useful information for decision-makers.

SPS has the flexibility to respond to the changing demand for small amount production of multiple varieties products. Assigning cross-trained workers to obtain flexibility has emerged as a major concern for the implementation of SPS. Most enterprises focus solely on measures of production efficiency, such as minimizing the total throughput time. Solutions based on optimizing efficiency measures alone can be unacceptable by workers who have high proficiency levels when they are achieved at the expense of the workers taking more workload. Therefore, study the tradeoff between production efficiency and fairness in the multi-skilled worker assignment problem is very important for SPS.

The study investigates a new mixed-integer programming model to optimize worker-to-seru assignment, batch-to-seru assignment and task-to-worker assignment in SPS. In order to solve the proposed problem, three problem-specific solution approaches are proposed.

This paper proposes a two-level supply chain including suppliers and manufacturers. The purpose of this paper is to design a resilient fuzzy risk-averse supply portfolio selection approach with lead-time sensitive manufacturers under partial and complete supply facility disruption in addition to the operational risk of imprecise demand to minimize the mean-risk costs. This problem is analyzed for a risk-averse decision maker, and the authors use the conditional value-at-risk (CVaR) as a risk measure, which has particular applications in financial engineering.

The methodology of the current research includes two phases of conceptual model and mathematical model. In the conceptual model phase, a new supply portfolio selection problem is presented under disruption and operational risks for lead-time sensitive manufacturers and considers resilience strategies for risk-averse decision makers. In the mathematical model phase, the stages of risk-averse two-stage fuzzy-stochastic programming model are formulated according to the above conceptual model, which minimizes the mean-CVaR costs.

In this paper, several computational experiments were conducted with sensitivity analysis by GAMS (General algebraic modeling system) software to determine the efficiency and significance of the developed model. Results show that the sensitivity of manufacturers to the lead time as well as the occurrence of disruption and operational risks, significantly affect the structure of the supply portfolio selection; hence, manufacturers should be taken into account in the design of this problem.

The study proposes a new two-stage fuzzy-stochastic scenario-based mathematical programming model for the resilient supply portfolio selection for risk-averse decision-makers under disruption and operational risks. This model assumes that the manufacturers are sensitive to lead time, so the demand of manufacturers depends on the suppliers who provide them with services. To manage risks, this model also considers proactive (supplier fortification, pre-positioned emergency inventory) and reactive (revision of allocation decisions) resilience strategies.

Due to unceasing declination in environment, sustainable agro-food supply chains have become a topic of concern to business, government organizations and customers. The purpose of this study is to examine a problem associated with sustainable network design in context of Indian agro-food grain supply chain.

A mixed integer nonlinear programming (MINLP) model is suggested to apprehend the major complications related with two-echelon food grain supply chain along with sustainability aspects (carbon emissions). Genetic algorithm (GA) and quantum-based genetic algorithm (Q-GA), two meta-heuristic algorithms and LINGO 18 (traditional approach) are employed to establish the vehicle allocation and selection of orders set.

The model minimizes the total transportation cost and carbon emission tax in gathering food grains from farmers to the hubs and later to the selected demand points (warehouses). The simulated data are adopted to test and validate the suggested model. The computational experiments concede that the performance of LINGO is superior than meta-heuristic algorithms (GA and Q-GA) in terms of solution obtained, but there is trade-off with respect to computational time.

In literature, inadequate study has been perceived on defining environmental sustainable issues connected with agro-food supply chain from farmer to final distribution centers. A MINLP model has been formulated as practical scenario for central part of India that captures all the major complexities to make the system more efficient. This study is regulated to agro-food Indian industries.

The suggested network design problem is an innovative approach to design distribution systems from farmers to the hubs and later to the selected warehouses. This study considerably assists the organizations to design their distribution network more efficiently.