Search results

Introduction Operations research, i.e. the application of scientific methodology to operational problems in the search for improved understanding and control, can be said to have started with the application of mathematical tools to military problems of supply bombing and strategy, during the Second World War. Post‐war these tools were applied to business problems, particularly production scheduling, inventory control and physical distribution because of the acute shortages of goods and the numerical aspects of these problems.

Addresses the problem of maintenance planning and scheduling and reviews pertinent literature. Discusses the characteristics and the complexity of the problem. Advocates mathematical programming approaches for addressing the maintenance scheduling problem. Gives examples to demonstrate the utility of these approaches. Proposes expansion of the state‐of‐the‐art maintenance management information system to utilize the mathematical programming approaches and to have better control over the maintenance scheduling problem.

The use of three non‐linear mathematical programming techniques for the optimization of structural design problems is discussed. The methods — sequential linear programming, the feasible direction method and the sequential unconstrained minimization technique — are applied to a portal frame problem to enable a study of their convergence efficiency to be studied. These methods are used for both the sizing of the structural members and determining the optimum roof pitch. The sequential linear programming method is shown to be particularly efficient for application to structural design problems. Some comments on the development of computer software for structural optimization are also given.

The multiple objective decision making problem arises when two or more non‐comparable objective functions are to be simultaneously optimised. There is a definite trend towards utilising interactive techniques for solving the multiple objective decision making problem. Interactive techniques allow the involvement of the DM throughout the decision process. In this paper we first provide a brief overview of multiple objective decision making, and then give a survey of literature dealing with interactive multiple objective decision making from 1965 to 1988.

The purpose of this paper is to develop a methodology for automatically determining the optimal allocation of police officers in accordance with the division and organization of labor.

The problem is defined as the problem of the goal programming for which the mathematical model of mixed integer programming was developed. In modeling of the scheduling problem the approach police officer/scheme, based on predefined scheduling patterns, was used. The approach is applied to real data of a police station in Bosnia and Herzegovina.

This study indicates that the determination of monthly scheduling policemen is complex and challenging problem, which is usually performed without the aid of software (self-rostering), and that it can be significantly facilitated by the introduction of scheduling optimization approach.

The developed mathematical model, in its current form, can directly be applied only to the scheduling of police officers at police stations which have the same or a similar organization of work.

Optimization of scheduling significantly reduces the time to obtain a monthly schedule. In addition, it allows the police stations to experiment with different forms of organization work of police officers and to obtain an optimal schedule for each of them in a short time.

The problem of optimal scheduling of employees is often resolved in other fields. To the authors knowledge, this is the first time that the approach of goal programming is applied in the field of policing.

The purpose of this paper is to survey and express the advantages and disadvantages of the existing approaches for solving grey linear programming in decision-making problems.

After presenting the concepts of grey systems and grey numbers, this paper surveys existing approaches for solving grey linear programming problems and applications. Also, methods and approaches for solving grey linear programming are classified, and its advantages and disadvantages are expressed.

The progress of grey programming has been expressed from past to present. The main methods for solving the grey linear programming problem can be categorized as Best-Worst model, Confidence degree, Whitening parameters, Prediction model, Positioned solution, Genetic algorithm, Covered solution, Multi-objective, Simplex and dual theory methods. This survey investigates the developments of various solving grey programming methods and its applications.

Different methods for solving grey linear programming problems are presented, where each of them has disadvantages and advantages in providing results of grey linear programming problems. This study attempted to review papers published during 35 years (1985–2020) about grey linear programming solving and applications. The review also helps clarify the important advantages, disadvantages and distinctions between different approaches and algorithms such as weakness of solving linear programming with grey numbers in constraints, inappropriate results with the lower bound is greater than upper bound, out of feasible region solutions and so on.

The purpose of this paper is to discuss the animal diet problem in grey environment which is adapted to the real situations. In particular, a new approach to solve these problems is proposed.

With the objective to produce the least-cost diet, in the traditional model for optimizing the diet problem, the price of foods, the nutrients requirements and the necessity of foods requirement have been considered as grey interval numbers. Grey linear programming approach has been employed to solve the grey diet problem. Grey linear programming with flexibility in selection of the coefficients can be more effective for solving the diet problems. In this research, only the positioned method has been used. The grey diet model is solved by using GAMS software based on the positioned method.

The main contribution of this work is to introduce a new model in the practical case that is concerned with diet problem under a kind of uncertainty environment and furthermore, proposing a novel method to solve the formulated problem. In this way, using a grey model and applying all restrictions, the least cost for one kilogram of total mixed ration was 6,893-10,163 Rials, and at this level, cow’s nutrient requirement was met. Based on the numerical examination, which was done on the real case, the achieved results have showed that the uncertainty of foods requirement and nutrients requirements had slight effect on the animal budget diet.

This problem must be viewed from another perspective because of the uncertainty regarding the amount of nutrients per unit of foods and the diversity of animals’ daily needs to receive them. In particular, a new method to optimize the fully mixed diet of lactating cows in early lactation that are readily available in the northeast of Iran in uncertainty environment has been proposed.

Logistics is the part of the supply chain (SC) that plans, executes and handles forward and reverse movement and storage of products, services and related information, in order to respond to customers' needs effectively and efficiently. The main concern for logistics is to ensure that the correct product is placed at the right time. This paper introduces a linear model of shipping focused on decision-making, which includes configuration of shipping network, choosing of transport means and transfer of individual customer shipments through a particular transport system.

In this study, authors try to address the problem of supply chain network (SCN) where the primary goal is to determine the appropriate order allocation of products from different sources to different destinations. They also seek to minimize total transportation cost and inventory cost by simultaneously determining optimal locations, flows and shipment composition. The formulated problem of getting optimal allocation turns out to be a problem of multi-objective programming, and it is solved by using the max-addition fuzzy goal programming approach, for obtaining optimal order allocation of products. Furthermore, the problem demand and supply parameters have been considered random in nature, and the maximum likelihood estimation approach has been used to assess the unknown probabilistic distribution parameters with a specified probability level (SPL).

A case study has also been applied for examining the effectiveness and applicability of the developed multi-objective model and the proposed solution methods. Results of this study are very relevant for the manufacturing sector in particular, for those facing logistics issues in SCN. It enables researchers and managers to cope with various types of uncertainty and logistics risks associated with SCN.

The principal contribution of the proposed model is the improved modelling of transportation and inventory, which are affected by different characteristics of SCN. To demonstrate computational information of the suggested methods and proposed model, a case illustration of SCN is provided. Also, environmentalism is increasingly becoming a significant global concern. Hence, the concept proposed could be extended to include environmental aspects as an objective function or constraint.

Efficient integration of logistical cost components, such as transportation costs, inventory costs, with mathematical programming models is an important open issue in logistics optimization. This study expands conventional facility location models to incorporate a range of logistic system elements such as transportation cost and different types of inventory cost, in a multi-product, multi-site network. The research is original and is focused on case studies of real life.

This paper attempts to establish the general formula for computing the inverse of grey matrix, and the results are applied to solve grey linear programming. The inverse of a grey matrix and grey linear programming plays an important role in establishing a grey computational system.

Starting from the fact that missing information often appears in complex systems, and therefore that true values of elements are uncertain when the authors construct a matrix, as well as calculate its inverse. However, the authors can get their ranges, which are called the number-covered sets, by using grey computational rules. How to get the matrix-covered set of inverse grey matrix became a typical approach. In this paper, grey linear programming was explained in detail, for the point of grey meaning and the methodology to calculate the inverse grey matrix can successfully solve grey linear programming.

The results show that the ranges of grey value of inverse grey matrix and grey linear programming can be obtained by using the computational rules.

Because the matrix and the linear programming have been widely used in many fields such as system controlling, economic analysis and social management, and the missing information is a general phenomenon for complex systems, grey matrix and grey linear programming may have great potential application in real world. The methodology realizes the feasibility to control the complex system under uncertain situations.

The paper successfully obtained the ranges of uncertain inverse matrix and linear programming by using grey system theory, when the elements of matrix and the coefficients of linear programming are intervals and the results enrich the contents of grey mathematics.

Given the importance of estimating the demand for relief items in earthquake disaster, this research studies the complex nature of demand uncertainty in a vehicle routing problem in order to distribute first aid relief items in the post disaster phase, where routes are subject to disruption.

To cope with such kind of uncertainty, the demand rate of relief items is considered as a random fuzzy variable and a robust scenario-based possibilistic-stochastic programming model is elaborated. The results are presented and reported on a real case study of earthquake, along with sensitivity analysis through some important parameters.

The results show that the demand satisfaction level in the proposed model is significantly higher than the traditional scenario-based stochastic programming model.

In reality, in the occurrence of a disaster, demand rate has a mixture nature of objective and subjective and should be represented through possibility and probability theories simultaneously. But so far, in studies related to this domain, demand parameter is not considered in hybrid uncertainty. The worth of considering hybrid uncertainty in this study is clarified by supplementing the contribution with presenting a robust possibilistic programming approach and disruption assumption on roads.