Template-Type: ReDIF-Article 1.0
Author-Name: P. Vignesh
Author-X-Name-First: P.
Author-X-Name-Last: Vignesh
Author-Name: S. Srinivasan
Author-X-Name-First: S.
Author-X-Name-Last: Srinivasan
Author-Name: S. Maragatha Sundari
Author-X-Name-First: S. Maragatha
Author-X-Name-Last: Sundari
Title: Analysis of a non-Markovian single server batch arrival queueing system of compulsory three stages of services with fourth optional stage service, service interruptions and deterministic server vacations
Abstract:
This paper deals with the steady state analysis of a single server batch arrival queueing system with three stages of compulsory service. An additional supposition of a fourth stage optional service is well thought-out. The server may take a vacation after completion of service. In this model, the vacation is of predetermined duration. A busy server may break down at any moment. It is tracked by a repair process. Service time, vacation time and repair time follow general distribution. The steady state probability generating function for the system and also system recital measures is obtained by using a supplementary variable technique. Some special cases of the model are also discussed. The model is justified by means of numerical illustrations followed by graphical representation.
Journal: Int. J. of Operational Research
Pages: 28-53
Issue: 1
Volume: 34
Year: 2019
Keywords: batch arrival; three stage service; fourth optional service; service interruption; deterministic server vacation.
File-URL: http://www.inderscience.com/link.php?id=96937
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:1:p:28-53

Template-Type: ReDIF-Article 1.0
Author-Name: Qidong Cao
Author-X-Name-First: Qidong
Author-X-Name-Last: Cao
Author-Name: Thomas E. Griffin
Author-X-Name-First: Thomas E.
Author-X-Name-Last: Griffin
Author-Name: Xiaoming Li
Author-X-Name-First: Xiaoming
Author-X-Name-Last: Li
Title: A case of unconstrained multiple-factor optimisation with unknown function in the textile industry
Abstract:
We applied an extremal experiment in a paper machine clothing factory to solve a quality problem caused by automatic bobbin-changers. The experimental study maximised the breaking strength of weld point and therefore led to a substantial gain in the gross profit. Questions answered in the extremal experiment of this study are useful to other practitioners who can apply the extremal experiment to their industries where an unconstrained multiple-factor optimisation model with unknown functions between the dependent variable and the factors is employed.
Journal: Int. J. of Operational Research
Pages: 54-65
Issue: 1
Volume: 34
Year: 2019
Keywords: extremal experiment; sequential experiments; steepest ascent method; parameter optimisation; factorial design.
File-URL: http://www.inderscience.com/link.php?id=96938
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:1:p:54-65

Template-Type: ReDIF-Article 1.0
Author-Name: M. Sanjai
Author-X-Name-First: M.
Author-X-Name-Last: Sanjai
Author-Name: S. Periyasamy
Author-X-Name-First: S.
Author-X-Name-Last: Periyasamy
Title: An inventory model for imperfect production system with rework and shortages
Abstract:
This paper considers a production inventory model with planned backorders for a single product. The product is manufactured in a single stage manufacturing system. The manufacturing system generates imperfect quality products. All these defective products are reworked in the same cycle. This paper develops two inventory models for two operational policies. The first policy covers the case that the rework is done and the shortages are not permitted. The second policy covers the case that the rework is done and the shortages are permitted. The generation of defective items during most practical production processes is almost inevitable. These imperfect quality items can sometimes be reworked and repaired, hence the <i>overall production costs can be reduced significantly</i>. To achieve this objective, a mathematical model is developed. In particular, the optimal production lot size which minimises the total cost is derived. This model is developed for deriving the necessary and sufficient conditions for having a unique solution. An illustrative example is provided and validated. The validation of result in this model was coded in Microsoft Visual Basic 6.0.
Journal: Int. J. of Operational Research
Pages: 66-84
Issue: 1
Volume: 34
Year: 2019
Keywords: economic production quantity; EPQ; defective items; cycle time; rework; shortages; demand and production.
File-URL: http://www.inderscience.com/link.php?id=96939
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:1:p:66-84

Template-Type: ReDIF-Article 1.0
Author-Name: Sanaz Khatibi
Author-X-Name-First: Sanaz
Author-X-Name-Last: Khatibi
Author-Name: Morteza Khakzar Bafruei
Author-X-Name-First: Morteza Khakzar
Author-X-Name-Last: Bafruei
Author-Name: Morteza Rahmani
Author-X-Name-First: Morteza
Author-X-Name-Last: Rahmani
Title: Modelling a bi-objective airport gate scheduling with controllable processing time using hybrid NSGA-II and VNS algorithm
Abstract:
In this research, we address a bi-objective model in a more realistic situation such that airport gate processing time is controllable. It is assumed that the possible compression/expansion processing time of a flight can be continuously controlled. The aim is simultaneously: 1) minimise the total cost of tardiness, earliness, delay and compression as well as expansion costs of job processing time; 2) minimise the passengers overcrowding on gate. In this study, a mixed-integer programming model is proposed. For solving the problem, two multi-objective meta-heuristic algorithms, namely non-dominated sorting genetic algorithm II (NSGA-II) and hybrid NSGA-II and variable neighbourhood search (VNS) are applied. VNS is used for preventing the solution from trapping in the local optimum, instead of mutation operator in NSGA-II. The algorithms are tested with the real life data from Mehrabad International Airport. Computational experiments reveal that hybrid NSGA-II and VNS generate better Pareto-optimal solution as compared to NSGA-II.
Journal: Int. J. of Operational Research
Pages: 1-27
Issue: 1
Volume: 34
Year: 2019
Keywords: gate scheduling problem; multi-objective decision making; hybrid meta-heuristic; NSGA-II; variable neighbourhood search; VNS; controllable processing times.
File-URL: http://www.inderscience.com/link.php?id=96940
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:1:p:1-27

Template-Type: ReDIF-Article 1.0
Author-Name: Akash Tayal
Author-X-Name-First: Akash
Author-X-Name-Last: Tayal
Author-Name: Surya Prakash Singh
Author-X-Name-First: Surya Prakash
Author-X-Name-Last: Singh
Title: Analysis of simulated annealing cooling schemas for design of optimal flexible layout under uncertain dynamic product demand
Abstract:
Manufacturing facilities are subjected to many uncertainties such as variability in demand, queuing delays, variable task times, rejects and machine breakdown. These volatilities have a large impact on leap time, inventory cost and delivery performance of a manufacturing unit. To operate efficiently the manufacturing facilities should adapt to these variations. The paper explores the way uncertainties are addressed in designing of flexible optimal layout. Such facility layout problem is known as stochastic dynamic facility layout problem (SDFLP). SDFLP is an NP-hard combinatorial optimization problem, which means the time taken to solve increases exponentially with problem size. To solve SDFLP, the paper presents an adaptation of simulated annealing (SA) meta-heuristic. Various SA cooling schemas are discussed, computed and evaluated for generating the optimal flexible layout. An optimal layout is one that minimises the distance travelled by materials taking into account uncertain product demand (material handling cost). A computer-based tool was developed and analysis was conducted on small to large size problem set. The results showed that SA with exponential cooling schedule provides better solution in terms of layout efficiency and gave better solution as compared to literature.
Journal: Int. J. of Operational Research
Pages: 85-103
Issue: 1
Volume: 34
Year: 2019
Keywords: facility layout; stochastic dynamic facility layout; simulated annealing; cooling schedule; meta-heuristic; modified simulated annealing; MSA.
File-URL: http://www.inderscience.com/link.php?id=96941
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:1:p:85-103

Template-Type: ReDIF-Article 1.0
Author-Name: Jamal Lmariouh
Author-X-Name-First: Jamal
Author-X-Name-Last: Lmariouh
Author-Name: Nizar El Hachemi
Author-X-Name-First: Nizar El
Author-X-Name-Last: Hachemi
Author-Name: Mohamed Anouar Jamali
Author-X-Name-First: Mohamed Anouar
Author-X-Name-Last: Jamali
Author-Name: Driss Bouami
Author-X-Name-First: Driss
Author-X-Name-Last: Bouami
Author-Name: Louis Martin Rousseau
Author-X-Name-First: Louis Martin
Author-X-Name-Last: Rousseau
Title: An integrated production and distribution problem with direct shipment: a case from Moroccan bottled-water market
Abstract:
We consider an industrial application encountered in the Moroccan context that involves the production and distribution of bottled water. Our industrial partner owns one plant from which all requests are delivered in direct shipments and usually full truckloads to the customers (a set of regional depots and wholesalers). We must take into account the production, the delivery requirements, multiple products, and inventory levels. The objective is to minimise the sum of the production, transportation, and inventory costs. We propose a mixed integer linear program for a variant of the multi-vehicle, multi-product production routing problem. Experiments have been conducted using CPLEX 12.3.0, and almost all instances were solved with a reasonable optimality gap. The results show that significant savings can be obtained by using our approach with respect to the current company practice.
Journal: Int. J. of Operational Research
Pages: 144-160
Issue: 1
Volume: 34
Year: 2019
Keywords: production planning; vendor-managed inventory; bottled-water; production-distribution problem; Morocco.
File-URL: http://www.inderscience.com/link.php?id=96942
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:1:p:144-160

Template-Type: ReDIF-Article 1.0
Author-Name: Peter E. Ezimadu
Author-X-Name-First: Peter E.
Author-X-Name-Last: Ezimadu
Author-Name: Chukwuma R. Nwozo
Author-X-Name-First: Chukwuma R.
Author-X-Name-Last: Nwozo
Title: A manufacturer-retailers dynamic cooperative advertising with retail competition
Abstract:
This work deals with the cooperative advertising in a manufacturer retailers supply chain. It considers the manufacturer as the Stackelberg leader and the retailers as the followers playing a Nash game with each other. Using differential game theory it obtains a time consistent feedback Stackelberg equilibrium for the optimal advertising strategies and payoffs for a situation where retail advertising is subsidised and where it is not subsidised. The work shows that while the manufacturer's advertising effort reduces with subsidy, the retailers' advertising efforts and product awareness increase. These consequently lead to increase in all the players' payoffs. While a fair player would increase his advertising effort with increasing payoff, the others reduce their efforts. Further a retailer's advertising effort should be subsidised only if the rate of increase of the manufacturer's payoff through that retailer's margin to the manufacturer is twice greater than the rate of increase of that retailer's payoff.
Journal: Int. J. of Operational Research
Pages: 104-143
Issue: 1
Volume: 34
Year: 2019
Keywords: supply chain; Stackelberg differential game; Nash differential game; Sethi's sales-advertising model; Ericson's extension of Sethi model.
File-URL: http://www.inderscience.com/link.php?id=96943
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:1:p:104-143

Template-Type: ReDIF-Article 1.0
Author-Name: Pinki Majumder
Author-X-Name-First: Pinki
Author-X-Name-Last: Majumder
Author-Name: Uttam Kumar Bera
Author-X-Name-First: Uttam Kumar
Author-X-Name-Last: Bera
Author-Name: Manoranjan Maiti
Author-X-Name-First: Manoranjan
Author-X-Name-Last: Maiti
Title: An EPQ model of deteriorating substitute items under trade credit policy
Abstract:
This study presents a multi item EPQ model of deteriorating items under trade credit policy where items are substitute in nature. Sometimes demand for one good also depends on the stock of other related goods. The standard economic textbooks indicate that related products' for a product include complement as well as substitute products. Two goods are substitutes if one can be used in place of the other one. Many products that are on the market today have substitutes. For example, bread and crackers, stocks and bonds, two different brands of soft drinks or water etc. The change in a substitute product's stock level could alter quantity demanded for another good. Here whole profit is calculated with retailer's point of view. In this model we take different types of budget. GRG method and LINGO (13.0) is used to find the optimal solutions. Some sensitivity analyses are made and presented graphically.
Journal: Int. J. of Operational Research
Pages: 161-212
Issue: 2
Volume: 34
Year: 2019
Keywords: EPQ model; substitute item; uncertain budget.
File-URL: http://www.inderscience.com/link.php?id=97576
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:2:p:161-212

Template-Type: ReDIF-Article 1.0
Author-Name: Charles I. Nkeki
Author-X-Name-First: Charles I.
Author-X-Name-Last: Nkeki
Title: Mean-variance investment strategy with proportional transaction costs and withdrawal process for a defined contribution pension scheme
Abstract:
In this paper, we consider an extension of the Markowitz portfolio and investment problem in which transaction costs are incurred; contributions and withdrawals are made by the pension plan members (PPMs) in the investment portfolio. The transaction costs are modelled as a proportion of the value of risky assets transacted. The aims of this paper are to: a) minimise the investment risks; b) minimise the contribution risks and simultaneously maximise amount of contributions; c) strategically minimise the amount of withdrawal by the PPMs. The optimal portfolio, contributions and withdrawal processes, with proportional transaction costs were obtained. Some numerical results are also presented in this paper.
Journal: Int. J. of Operational Research
Pages: 213-239
Issue: 2
Volume: 34
Year: 2019
Keywords: mean-variance; investment strategy; withdrawal; transaction costs; pension plan member; PPM; defined contribution; pension scheme.
File-URL: http://www.inderscience.com/link.php?id=97577
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:2:p:213-239

Template-Type: ReDIF-Article 1.0
Author-Name: Vinayak Vishwakarma
Author-X-Name-First: Vinayak
Author-X-Name-Last: Vishwakarma
Author-Name: Chandra Prakash Garg
Author-X-Name-First: Chandra Prakash
Author-X-Name-Last: Garg
Author-Name: Mukesh Kumar Barua
Author-X-Name-First: Mukesh Kumar
Author-X-Name-Last: Barua
Title: Modelling the barriers of Indian pharmaceutical supply chain using fuzzy AHP
Abstract:
Due to the profound discrepancy in the developing country's production, which possibly affects the quality of producing medicine, harms patient's health. The pharmaceutical supply chain has been challenged by the barriers especially in the context of developing nations like India. The identification of barriers is desired to enhance the performance of the industry. This study identifies 28 barriers under six major criteria of Indian PSC through relevant literature and expert's opinions. This paper proposes a hybrid model based on fuzzy AHP to prioritised rank barriers in PSC. This approach is best for analysing experts' judgments and uncertainty involved in the process of prioritisation. The findings and framework developed could be used by the drug industry, which helps them to destroy barriers to addressing sustainability and quality manufacturing. The results indicate that market-related barriers are the most important for Indian PSC. Further sensitivity analysis is performed to test the robustness of the proposed approach.
Journal: Int. J. of Operational Research
Pages: 240-268
Issue: 2
Volume: 34
Year: 2019
Keywords: pharmaceutical supply chain; PSC; barriers; fuzzy-AHP; sensitivity analysis; India.
File-URL: http://www.inderscience.com/link.php?id=97578
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:2:p:240-268

Template-Type: ReDIF-Article 1.0
Author-Name: Amin Mohammadnejad
Author-X-Name-First: Amin
Author-X-Name-Last: Mohammadnejad
Author-Name: Kourosh Eshghi
Author-X-Name-First: Kourosh
Author-X-Name-Last: Eshghi
Title: An efficient hybrid meta-heuristic ant system for minimum sum colouring problem
Abstract:
Graph sum colouring problem is a special class of graph vertex colouring problem. Because of its various applications in practical areas, especially in scheduling, many researchers have been focused on it during the past decade. In recent years, several heuristic and meta-heuristic algorithms have been developed to solve sum colouring problem. In this research, a hybrid algorithm based on mini-max ant system and simulated annealing is applied for the problem. This algorithm is tested on benchmark random graphs and compared to the previous algorithms. Results show that in many cases, the best known results can be obtained or improved by the proposed algorithm.
Journal: Int. J. of Operational Research
Pages: 269-284
Issue: 2
Volume: 34
Year: 2019
Keywords: graph sum colouring; graph colouring; ant colony; meta-heuristics.
File-URL: http://www.inderscience.com/link.php?id=97579
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:2:p:269-284

Template-Type: ReDIF-Article 1.0
Author-Name: Mehdi Fazeli-Kebria
Author-X-Name-First: Mehdi
Author-X-Name-Last: Fazeli-Kebria
Author-Name: Ghasem Moslehi
Author-X-Name-First: Ghasem
Author-X-Name-Last: Moslehi
Author-Name: Naser Mollaverdi
Author-X-Name-First: Naser
Author-X-Name-Last: Mollaverdi
Author-Name: Mohammad Reisi-Nafchi
Author-X-Name-First: Mohammad
Author-X-Name-Last: Reisi-Nafchi
Title: Customer's order acceptance and scheduling to maximise total profit
Abstract:
In this paper, in order to maximise total profit, the order acceptance and scheduling problem was generalised by considering some customers with their own orders who do not agree with partial rejection/acceptance of them. Therefore, it was assumed that accepting or rejecting one customer is equal to accepting or rejecting all his orders. In addition, the considered penalty function for scheduling the orders was total weighted lateness. A mathematical programming model, an upper bound, a branch and bound, and an efficient heuristic algorithm were proposed for this problem. It was shown that before starting the problem solving procedure, it is possible to certainly reject or accept some customers. The proposed branch and bound algorithm solved 93% of 810 randomly designed problem instances in a reasonable time. Besides, the heuristic algorithm solved the problem instances with the size of 2,000 customers at most with 0.1% deviation from a lower bound.
Journal: Int. J. of Operational Research
Pages: 301-320
Issue: 2
Volume: 34
Year: 2019
Keywords: scheduling; customer; order acceptance; lateness; branch and bound.
File-URL: http://www.inderscience.com/link.php?id=97580
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:2:p:301-320

Template-Type: ReDIF-Article 1.0
Author-Name: Babak H. Tabrizi
Author-X-Name-First: Babak H.
Author-X-Name-Last: Tabrizi
Author-Name: Seyed Farid Ghaderi
Author-X-Name-First: Seyed Farid
Author-X-Name-Last: Ghaderi
Author-Name: Siamak Haji-Yakhchali
Author-X-Name-First: Siamak
Author-X-Name-Last: Haji-Yakhchali
Title: Net present value maximisation of integrated project scheduling and material procurement planning
Abstract:
A mixed-integer programming model is developed in this paper to consider simultaneous planning of project scheduling and material procurement problem as an efficient approach to improve project costs. The proposed formulation provides the model with the possibility to procure materials from a number of suppliers each offering a distinctive all-unit discount method. The purpose of the mathematical model is to develop schedules with the best net present value in order to guarantee successful completion of the project. We have applied a genetic algorithm to solve the problem, whose key factors are tuned by the Taguchi method. It is discussed how to generate initial feasible solutions as a preprocessing method to start the solution algorithm. Finally, the efficiency and applicability of the model is tested by a different set of category-based instances.
Journal: Int. J. of Operational Research
Pages: 285-300
Issue: 2
Volume: 34
Year: 2019
Keywords: project scheduling; procurement; net present value; NPV; genetic algorithm.
File-URL: http://www.inderscience.com/link.php?id=97581
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:2:p:285-300

Template-Type: ReDIF-Article 1.0
Author-Name: Avik Pradhan
Author-X-Name-First: Avik
Author-X-Name-Last: Pradhan
Author-Name: M.P. Biswal
Author-X-Name-First: M.P.
Author-X-Name-Last: Biswal
Title: Linear fractional programming problems with some multi-choice parameters
Abstract:
Linear fractional programming is a class of mathematical programming problem where we optimise the ratio of two linear functions subject to some linear constraints. In this paper, we present a linear fractional programming model where some or all the parameters are multi-choice type. We present a novel and efficient method, which integrates classical Charnes-Cooper transformation and Lagrange's interpolating polynomial, to transform multi-choice linear fractional programming problems into an equivalent mixed-integer nonlinear programming (MINLP) problems. A theorem is presented to establish the relation between the optimal solution of the multi-choice linear fractional programs and the equivalent MINLP. Some numerical examples are studied to illustrate the methodology.
Journal: Int. J. of Operational Research
Pages: 321-338
Issue: 3
Volume: 34
Year: 2019
Keywords: linear fractional programming; LFP; multi-choice programming; transportation problem; interpolating polynomial; mixed integer programming.
File-URL: http://www.inderscience.com/link.php?id=98310
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:3:p:321-338

Template-Type: ReDIF-Article 1.0
Author-Name: Keyvan Shokoufi
Author-X-Name-First: Keyvan
Author-X-Name-Last: Shokoufi
Author-Name: Javad Rezaeian
Author-X-Name-First: Javad
Author-X-Name-Last: Rezaeian
Author-Name: Babak Shirazi
Author-X-Name-First: Babak
Author-X-Name-Last: Shirazi
Author-Name: Iraj Mahdavi
Author-X-Name-First: Iraj
Author-X-Name-Last: Mahdavi
Title: Preemptive just-in-time scheduling problem on uniform parallel machines with time-dependent learning effect and release dates
Abstract:
This paper considers uniform parallel machines scheduling problem with time-dependent learning effects, release dates, allowable preemption and machine idle time to minimise the total weighted earliness and tardiness penalties which is known to be strongly NP-hard. To solve this problem, this research proposes a mixed integer nonlinear programming (MINLP) model. Afterward, in order to find the best solution in an effective solution space, a dominant set is proposed for the length of the schedule experimentally. Also, based on the allowable idle time, a new time-dependent learning model on parallel machines is proposed. Furthermore, a genetic algorithm (GA) and a hybrid of genetic algorithm and particle swarm optimisation (HGA-PSO) are proposed. Taguchi method is applied to calibrate the parameters of the proposed algorithms. Finally, the computational results are provided to compare the results of the algorithms. Then, the efficiency of the proposed algorithms is discussed.
Journal: Int. J. of Operational Research
Pages: 339-368
Issue: 3
Volume: 34
Year: 2019
Keywords: just-in-time scheduling; uniform parallel machines; time-dependent learning effect; preemption; machine idle time; release date.
File-URL: http://www.inderscience.com/link.php?id=98311
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:3:p:339-368

Template-Type: ReDIF-Article 1.0
Author-Name: Venkata Prasad Palakiti
Author-X-Name-First: Venkata Prasad
Author-X-Name-Last: Palakiti
Author-Name: Usha Mohan
Author-X-Name-First: Usha
Author-X-Name-Last: Mohan
Author-Name: Viswanath Kumar Ganesan
Author-X-Name-First: Viswanath Kumar
Author-X-Name-Last: Ganesan
Title: Order acceptance and scheduling: overview and complexity results
Abstract:
The order acceptance and scheduling (OAS) problem is an important aspect of the manufacturing process, especially when production is carried out on a made-to-order basis with stringent deadlines and limited production capacity. This paper provides an overview of existing OAS problems by considering due date related dimensions in deterministic scenarios. A three-field notation was introduced for classifying OAS problems, and reviewing solution algorithms and complexity results for the same. This research effort proved the complexity results for existing, open as well as new OAS problems with due dates, and additionally, outlined the complexity results for newly defined OAS problems without due date dimensions.
Journal: Int. J. of Operational Research
Pages: 369-386
Issue: 3
Volume: 34
Year: 2019
Keywords: complexity; order acceptance; scheduling; due dates.
File-URL: http://www.inderscience.com/link.php?id=98312
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:3:p:369-386

Template-Type: ReDIF-Article 1.0
Author-Name: Prabhat Kumar Rout
Author-X-Name-First: Prabhat Kumar
Author-X-Name-Last: Rout
Author-Name: Sudarsan Nanda
Author-X-Name-First: Sudarsan
Author-X-Name-Last: Nanda
Author-Name: Srikumar Acharya
Author-X-Name-First: Srikumar
Author-X-Name-Last: Acharya
Title: Multi-objective fuzzy probabilistic quadratic programming problem
Abstract:
The aim of the paper is to present a multi-choice multi-objective fuzzy probabilistic quadratic programming problem and its solution methodology. The mathematical programming problem suggested here is difficult to solve directly. Therefore, three major steps are suggested to solve the proposed mathematical programming problem. In first step, fuzzy chance constraint is transformed to its equivalent chance constraint programming problem using <i>α-cut</i> technique. Chance constraint technique is used to obtain a crisp multi-choice multi-objective quadratic programming problem. In the next step, importance is given to handle multi-choice parameter using least square approximation technique. At the end of second step, a multi-objective quadratic mathematical programming is obtained. Finally, goal programming approach is used to solve the transformed multi-objective quadratic mathematical programming. Using existing methodology and software, the final solution of the proposed model is obtained. The proposed method is implemented with a numerical example.
Journal: Int. J. of Operational Research
Pages: 387-408
Issue: 3
Volume: 34
Year: 2019
Keywords: multi-objective; fuzzy probability; goal programming; multi-choice programming; least square approximation; quadratic programming; fuzzy quadratic programming; stochastic quadratic programming; fuzzy random variable.
File-URL: http://www.inderscience.com/link.php?id=98313
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:3:p:387-408

Template-Type: ReDIF-Article 1.0
Author-Name: Mir Mohammad Alipour
Author-X-Name-First: Mir Mohammad
Author-X-Name-Last: Alipour
Author-Name: Seyed Naser Razavi
Author-X-Name-First: Seyed Naser
Author-X-Name-Last: Razavi
Title: A new local search heuristic based on nearest insertion into the convex hull for solving Euclidean TSP
Abstract:
The travelling salesman problem (TSP) is probably the most famous and extensively studied problem in the field of combinatorial optimisation. This problem is in the fields of logistics, transportation, and distribution. Since the TSP is NP-hard, many heuristics for the TSP have been developed. In this paper, we developed a novel local search heuristic, based on nearest insertion into the convex hull construction heuristic for solving Euclidean TSP. The proposed method, nearest insertion into the convex hull local search (NICH-LS) is used to improve the initial tour, which is taken from a tour construction heuristic, multi-agent reinforcement learning (MARL) heuristic, by locally manipulating the order of nodes in the consecutive partial tours of the initial tour. Changing the order of nodes in a partial tour is done via constructing the NICH tour of these nodes and replacing the partial tour with the modified partial tour, if its length is reduced. The proposed novel local search heuristic is applied to 29 benchmark instances from TSPLIB. The computational results show the efficiency of the proposed local search compared with five state-of-the-art heuristics.
Journal: Int. J. of Operational Research
Pages: 409-429
Issue: 3
Volume: 34
Year: 2019
Keywords: local search; NICH-LS; travelling salesman problem; TSP; multi-agent reinforcement learning; MARL; nearest insertion; convex hull.
File-URL: http://www.inderscience.com/link.php?id=98314
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:3:p:409-429

Template-Type: ReDIF-Article 1.0
Author-Name: Asie Soudi
Author-X-Name-First: Asie
Author-X-Name-Last: Soudi
Author-Name: Mehdi Heydari
Author-X-Name-First: Mehdi
Author-X-Name-Last: Heydari
Author-Name: Mohammad Mahdavi Mazdeh
Author-X-Name-First: Mohammad Mahdavi
Author-X-Name-Last: Mazdeh
Title: A new approach for integrated surgical procedure scheduling with arrival uncertainty
Abstract:
Efficient utilisation of operating room (OR) is a common anxiety of surgical suite manager. It necessitates an effective planning and scheduling of surgeries. In this paper, weekly planning and scheduling of an integrated surgical procedure is formulated as a hybrid flow shop scheduling problem which can take capacity constraints of ward beds and multi operating rooms into account. By further considering the arrival uncertainty of emergency patients, in order to generate a stable primary schedule in predictive phase, a chance constrained programming (CCP) model is developed for the first time. It is shown how applying CCP model will reduce to considering virtual patients. Afterwards, a reactive programming model is proposed based on a new performance measure for preserving stability of the primary schedule in reactive phase. The efficiency of proposed approach for predictive/reactive scheduling problem is demonstrated through computational results in comparison with classic one.
Journal: Int. J. of Operational Research
Pages: 430-449
Issue: 3
Volume: 34
Year: 2019
Keywords: stability of primary schedule; integrated surgical procedure; chance constrained programming; CCP; emergency patient; sequencing.
File-URL: http://www.inderscience.com/link.php?id=98315
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:3:p:430-449

Template-Type: ReDIF-Article 1.0
Author-Name: J. Jayabharathiraj
Author-X-Name-First: J.
Author-X-Name-Last: Jayabharathiraj
Title: Goal programming model for predicting the parameters involved in growth of cancer cells
Abstract:
Some nonlinear goal programming problems are formulated for predicting the decision parameters involved in the cancer and related cell growths such growth rate of normal and malignant cells, death rate of normal and malignant cells and mutation rate of normal cells. An application of preemptive and non-preemptive goal programming problem, some optimisation programming problems are constructed using the statistical moments derived from two state cancer cell growths model and solved using the optimisation LINGO software.
Journal: Int. J. of Operational Research
Pages: 450-465
Issue: 3
Volume: 34
Year: 2019
Keywords: goal programming problem; GPP; birth and death processes; cancer cell growths.
File-URL: http://www.inderscience.com/link.php?id=98316
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:3:p:450-465

Template-Type: ReDIF-Article 1.0
Author-Name: Rajesh Attri
Author-X-Name-First: Rajesh
Author-X-Name-Last: Attri
Author-Name: Sandeep Grover
Author-X-Name-First: Sandeep
Author-X-Name-Last: Grover
Title: Structural modelling and analysis of production system life cycle: a graph theoretic approach
Abstract:
The main purpose of this paper is to cultivate a cohesive system model for the structural modelling and analysis of production system life cycle (PSLC) in terms of its prompting systems and interfaces between the systems and sub-systems. By means of graph theoretic approach (GTA), PSLC is first modelled with help of graph theory, then by matrix method and at last, by a multinomial known as a permanent function. Different factors (hereby known as quality enabled factors) affecting the PSLC or its decisions are identified to develop a graph theoretic model, a matrix model, and a multinomial permanent model of the PSLC. The present work recommends an index with the help of GTA which can be effectively employed for assessing the quality of decisions made in the different phases of PSLC. The step by step procedure for the application of GTA methodology is itemised with an example that may assist the managers or decision makers to implement it in their organisations.
Journal: Int. J. of Operational Research
Pages: 467-506
Issue: 4
Volume: 34
Year: 2019
Keywords: production system life cycle; PSLC; graph theoretic approach; GTA; index; methodology; decision; quality enabled factors; QEFs.
File-URL: http://www.inderscience.com/link.php?id=99105
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:4:p:467-506

Template-Type: ReDIF-Article 1.0
Author-Name: Galal M. Abdella
Author-X-Name-First: Galal M.
Author-X-Name-Last: Abdella
Author-Name: Khalifa N. Al-Khalifa
Author-X-Name-First: Khalifa N.
Author-X-Name-Last: Al-Khalifa
Author-Name: Maha A. Tayseer
Author-X-Name-First: Maha A.
Author-X-Name-Last: Tayseer
Author-Name: Abdel Magid S. Hamouda
Author-X-Name-First: Abdel Magid S.
Author-X-Name-Last: Hamouda
Title: Modelling trends in road crash frequency in Qatar State
Abstract:
The data-based regression models are widely popular in modelling the relationship between the crash frequencies and contributing factors. However, one common problem usually associated with the classical regression models is the multicollinearity, which leads to biased estimation of the model coefficients. This paper mainly focuses on the consequences of multicollinearity and introduces a multiple objective-based best-subset approach for promoting the accuracy of the road crash model in Qatar State. The prediction performance of the methodology is verified through a comparative study with two of well-known time series models, namely autoregressive moving average (ARMA) and double exponential smoothing (DES). The mean absolute percentage error (MAPE) is used to assess the ability of each model in maintaining minimum prediction errors. The methodology is illustrated by using a data set of road crashes in Qatar State, 2007-2013.
Journal: Int. J. of Operational Research
Pages: 507-523
Issue: 4
Volume: 34
Year: 2019
Keywords: ARMA; multicollinearity; road crash modelling.
File-URL: http://www.inderscience.com/link.php?id=99106
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:4:p:507-523

Template-Type: ReDIF-Article 1.0
Author-Name: Nachiappan Subramanian
Author-X-Name-First: Nachiappan
Author-X-Name-Last: Subramanian
Author-Name: Ramakrishnan Ramanathan
Author-X-Name-First: Ramakrishnan
Author-X-Name-Last: Ramanathan
Title: A heuristics approach for computing the largest eigenvalue of a pairwise comparison matrix
Abstract:
Pairwise comparison matrices (PCMs) are widely used to capture subjective human judgements, especially in the context of the analytic hierarchy process (AHP). Consistency of judgements is normally computed in the AHP context in the form of consistency ratio (CR), which requires estimation of the largest eigenvalue (<i>λ</i><SUB align="right"><SMALL>max</SMALL></SUB>) of PCMs. Since many of these alternatives methods do not require calculation of eigenvector, <i>λ</i><SUB align="right"><SMALL>max</SMALL></SUB> and hence the CR of a PCM cannot be easily estimated. We propose in this paper a simple heuristics for calculating <i>λ</i><SUB align="right"><SMALL>max</SMALL></SUB> without any need to use eigenvector method (EM). We illustrated the proposed procedure with larger size matrices. Simulation is used to compare the accuracy of the proposed heuristics procedure with actual <i>λ</i><SUB align="right"><SMALL>max</SMALL></SUB> for PCMs of various sizes. It has been found that the proposed heuristics is highly accurate, with errors less than 1%. The proposed procedure would avoid biases and help managers to make better decisions. The advantage of the proposed heuristics is that it can be easily calculated with simple calculations without any need for specialised mathematical procedures or software and is independent of the method used to derive priorities from PCMs.
Journal: Int. J. of Operational Research
Pages: 524-541
Issue: 4
Volume: 34
Year: 2019
Keywords: multiple criteria analysis; pairwise comparison matrix; PCM; eigenvector method; the largest eigenvalue; consistency index.
File-URL: http://www.inderscience.com/link.php?id=99107
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:4:p:524-541

Template-Type: ReDIF-Article 1.0
Author-Name: Saeed Dehnavi-Arani
Author-X-Name-First: Saeed
Author-X-Name-Last: Dehnavi-Arani
Author-Name: Mohammad Saidi-Mehrabad
Author-X-Name-First: Mohammad
Author-X-Name-Last: Saidi-Mehrabad
Author-Name: Vahidreza Ghezavati
Author-X-Name-First: Vahidreza
Author-X-Name-Last: Ghezavati
Title: An integrated model of cell formation and scheduling problem in a cellular manufacturing system considering automated guided vehicles' movements
Abstract:
In this paper, an integrated mathematical model for cellular manufacturing system (CMS) incorporating cell formation problem (CFP) and intra-cell scheduling is considered. It is assumed that in order to make the flexibility in handling system, automated guided vehicles (AGVs) are responsible for transferring the exceptional parts from one cell to another cell. Employing the AGVs in CMS can be challenging from mathematical model's point of view. In other words, despite the common constraints in CFP and intra-cell scheduling, several constraints such as AGVs' movement, preventing the AGVs' collision as well as parts' pickup/delivery by AGVs must be taken to account. There is no comprehensive model including the role of AGVs in a CMS. Hence, we endeavour to formulate CFP, scheduling and role of AGVs at the same time. The objective function is to minimise the sum of the maximum completion time (makespan) and inter-cellular movements of parts. The proposed nonlinear model is transformed to a linear form in order to solve it for optimality. Eventually, two small-size computational experiments are generated and ran on the GAMS.9 commercial software to show the efficiency and accuracy of the proposed model.
Journal: Int. J. of Operational Research
Pages: 542-561
Issue: 4
Volume: 34
Year: 2019
Keywords: cellular manufacturing system; CMS; cell formation problem; CFP; intra-cell scheduling; inter-cellular AGV.
File-URL: http://www.inderscience.com/link.php?id=99108
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:4:p:542-561

Template-Type: ReDIF-Article 1.0
Author-Name: Varinder Kumar Mittal
Author-X-Name-First: Varinder Kumar
Author-X-Name-Last: Mittal
Author-Name: Rahul Sindhwani
Author-X-Name-First: Rahul
Author-X-Name-Last: Sindhwani
Author-Name: Himanshu Shekhar
Author-X-Name-First: Himanshu
Author-X-Name-Last: Shekhar
Author-Name: Punj Lata Singh
Author-X-Name-First: Punj Lata
Author-X-Name-Last: Singh
Title: Fuzzy AHP model for challenges to thermal power plant establishment in India
Abstract:
Thermal power plant is a huge project in context of resource utilisation, time required for its completion and also large amount of funds are required for its establishment. So, delay in any activity especially activity of critical path would results in delay of whole project. Due to delay, the stress on the resources would also increase, which may further result in substandard quality of work. A fuzzy AHP process model has been used to prioritise the challenges to thermal power plant establishment through the inputs by experts from managers at the actual construction sites, designers, and consultants. The challenges identified in the present study can be categorised in three categories viz. high impact, medium impact and least impact challenges. This paper presented the ranking of 19 challenges faced in the establishment of a new thermal power plant in India.
Journal: Int. J. of Operational Research
Pages: 562-581
Issue: 4
Volume: 34
Year: 2019
Keywords: fuzzy AHP; challenges; multi-criteria decision making; ranking; project management; thermal power plant.
File-URL: http://www.inderscience.com/link.php?id=99109
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:4:p:562-581

Template-Type: ReDIF-Article 1.0
Author-Name: K. Sikdar
Author-X-Name-First: K.
Author-X-Name-Last: Sikdar
Title: Analysing a finite buffer queue with finite number of vacation policy and correlated arrivals
Abstract:
This paper analyses a <i>MAP</i>/<i>G</i>/1/<i>N</i> queue having finite number of vacations. The server takes a finite number (say <i>J</i> ≥ 0) of vacations whenever the system becomes empty at service completion epoch. If no clients are found by the end of the <i>J</i><SUP align="right"><SMALL>th</SMALL></SUP> vacation, the server does not go for vacation and stays in the system (called dormant period) until one client arrives. The number of vacations being finite and the server can utilise vacation periods for any other jobs. This is obvious that <i>J</i> = 1 and <i>J</i> → 1 lead to single and multiple vacation models, respectively. This research work mainly focuses more generalised vacation policy and different use cases. The following results have been obtained: 1) the distributions of clients in the queue at various epochs; 2) the Laplace-Stieltjes transform of the actual waiting-time distribution in the queue of a client under the FCFS discipline. The numerical data and graphs are presented to establish the analytical result.
Journal: Int. J. of Operational Research
Pages: 582-605
Issue: 4
Volume: 34
Year: 2019
Keywords: finite buffer; finite vacation; Markovian arrival process; MAP; queue; steady state; single server; waiting time.
File-URL: http://www.inderscience.com/link.php?id=99110
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:34:y:2019:i:4:p:582-605

Template-Type: ReDIF-Article 1.0
Author-Name: Habibollah Danai
Author-X-Name-First: Habibollah
Author-X-Name-Last: Danai
Author-Name: Shahram Hashemnia
Author-X-Name-First: Shahram
Author-X-Name-Last: Hashemnia
Author-Name: Rokhshad Ahmadi
Author-X-Name-First: Rokhshad
Author-X-Name-Last: Ahmadi
Author-Name: Seyed Hojjat Bazazzadeh
Author-X-Name-First: Seyed Hojjat
Author-X-Name-Last: Bazazzadeh
Title: Application of fuzzy ANP method to select the best supplier in the supply chain
Abstract:
Positive performance of the purchase department has a direct impact on reducing cost and increasing profitability, and survival of the supply chain. One of the major tasks of the purchase department in the supply chain is to evaluate and select suppliers. The process of selecting a suitable supplier among different options and variables is an important task. Inappropriate selection of supplier in addition to imposing more costs will have devastating impacts on the organisation's performance. The main objective of this study is to provide a useful approach to fuzzy ANP for evaluation of issues related to supplier selection. Many quantitative and qualitative concerns may be brought by the issues related to supplier selection, they are complicated issues. In this study, an ANP model was designed in fuzzy environment; through which the best accessories suppliers in HivaSanat Company are identified and prioritised.
Journal: Int. J. of Operational Research
Pages: 1-19
Issue: 1
Volume: 35
Year: 2019
Keywords: fuzzy ANP; supply chain.
File-URL: http://www.inderscience.com/link.php?id=99540
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:1:p:1-19

Template-Type: ReDIF-Article 1.0
Author-Name: Mojtaba Ghiyasi
Author-X-Name-First: Mojtaba
Author-X-Name-Last: Ghiyasi
Title: Novel criterion models in the inverse DEA problem
Abstract:
This article deals with 'inverse' data envelopment analysis (DEA) problem which is a mathematical programming-based technique. The process of checking perturbed DMUs is simplified by proposing a new criterion model. This yields to a reduction of computational complexity for the criterion model. In addition, more realistic criterion model is also proposed and the relationship between existing criterion model and proposed models are discussed. Moreover, it is shown that proposed models solve some problematic failures of the existing inverse DEA models in the literature. Two numerical examples are provided to illustrate the idea. The proposed model are illustrated by a real life data and a comparison between existing criterion model in the literature and proposed criterion models is also provided.
Journal: Int. J. of Operational Research
Pages: 20-36
Issue: 1
Volume: 35
Year: 2019
Keywords: multiple-objective programming; input/output estimation; criterion model; inverse DEA.
File-URL: http://www.inderscience.com/link.php?id=99541
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:1:p:20-36

Template-Type: ReDIF-Article 1.0
Author-Name: R. Sudhesh
Author-X-Name-First: R.
Author-X-Name-Last: Sudhesh
Author-Name: R. Sebasthi Priya
Author-X-Name-First: R. Sebasthi
Author-X-Name-Last: Priya
Title: An analysis of discrete-time Geo/Geo/1 queue with feedback, repair and disaster
Abstract:
A discrete-time queue with feedback subject to system disaster, server failures and repair is considered in this paper. The time-dependent system-size probabilities are obtained by using generating functions where the system of difference equations in two parameters namely time epoch (<i>m</i>) and number of customers (<i>n</i>) are transformed into another difference equation in terms of generating functions. The difference equations of generating functions satisfy a three-term recurrence relation which leads to continued fraction. System-size probabilities and some performance measures in steady-state are derived. Further, busy period distribution, reliability and availability are also obtained. Numerical illustrations are provided for different parameter values to see their effect on performance measures and to get more in-sight of the model behaviour.
Journal: Int. J. of Operational Research
Pages: 37-53
Issue: 1
Volume: 35
Year: 2019
Keywords: disasters; feedback; reliability; busy period; continued fractions.
File-URL: http://www.inderscience.com/link.php?id=99542
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:1:p:37-53

Template-Type: ReDIF-Article 1.0
Author-Name: K.R. Ramkishore
Author-X-Name-First: K.R.
Author-X-Name-Last: Ramkishore
Author-Name: R.K. Amit
Author-X-Name-First: R.K.
Author-X-Name-Last: Amit
Title: Optimal bargaining mechanisms with refusal cost
Abstract:
We consider a bargaining situation between an arriving buyer and a seller, where the buyer and the seller have private valuations. The seller has an inventory, which has to be sold over the infinite horizon. It is assumed that the seller incurs a refusal cost, if the trade does not take place. Myerson (1985) discusses four bilateral bargaining mechanisms in static settings - price negotiation, splitting the difference between seller's and buyer's offer, buyer posted price and seller posted price. The objective of this research is to study these mechanisms in the dynamic setting, with consideration of the refusal cost. In this paper, we model the situation as a Markov decision process, which endogenises the seller's marginal inventory valuation. We find that the seller prefers posting prices when the refusal cost is low. Seller is indifferent between buyer posted price and negotiation for the high refusal cost.
Journal: Int. J. of Operational Research
Pages: 54-66
Issue: 1
Volume: 35
Year: 2019
Keywords: Markov decision process; refusal cost; bilateral bargaining mechanisms.
File-URL: http://www.inderscience.com/link.php?id=99543
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:1:p:54-66

Template-Type: ReDIF-Article 1.0
Author-Name: Ahmad Abubaker
Author-X-Name-First: Ahmad
Author-X-Name-Last: Abubaker
Author-Name: Adam Baharum
Author-X-Name-First: Adam
Author-X-Name-Last: Baharum
Author-Name: Mahmoud Alrefaei
Author-X-Name-First: Mahmoud
Author-X-Name-Last: Alrefaei
Title: A pruned Pareto set for multi-objective optimisation problems via particle swarm and simulated annealing
Abstract:
A Pareto optimal set, which is obtained from solving multi-objective optimisation problems, usually contain a large number of optimal solutions. This situation poses a challenge for decision makers in choosing a suitable solution from a large number of overlapping and complex Pareto solutions. This paper proposes a new procedure for solving multi-objective optimisation problems by reducing the size of the Pareto set. The procedure is divided into two major stages. In the first stage, the multi-objective simulated annealing algorithm is used to solve a multi-objective optimisation problem by constructing the Pareto optimal set. In the second stage, the automatic clustering algorithm is used to prune the Pareto set. This procedure is implemented to solve two multi-objective optimisation problems, namely, the 0/1 multi-objective multi-dimensional knapsack problem and the multi-objective inventory system. The procedure enables the decision maker to select an appropriate solution efficiently.
Journal: Int. J. of Operational Research
Pages: 67-86
Issue: 1
Volume: 35
Year: 2019
Keywords: multi-objective problem; inventory control; simulated annealing; particle swarm optimisation; automatic clustering.
File-URL: http://www.inderscience.com/link.php?id=99544
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:1:p:67-86

Template-Type: ReDIF-Article 1.0
Author-Name: K. Selvakumar
Author-X-Name-First: K.
Author-X-Name-Last: Selvakumar
Author-Name: L. Sairamesh
Author-X-Name-First: L.
Author-X-Name-Last: Sairamesh
Author-Name: A. Kannan
Author-X-Name-First: A.
Author-X-Name-Last: Kannan
Title: Wise intrusion detection system using fuzzy rough set-based feature extraction and classification algorithms
Abstract:
In recent times, it is critical to give abnormal state security to guarantee protected and successful correspondence of data through the web. Nonetheless, secured information correspondence over the internet or some other system is dependably a tested undertaking because of the risk of interruptions and assaults. Along these lines, intrusion detection systems (IDS) have turned into a key segment in system security. Previously, different methodologies were used for creating interruption in location frameworks. In any case, sadly, any of these frameworks are not totally faultless because of the vulnerability of system activity made by ordinary clients and assailants. Henceforth, the requirement for the advancement of productive IDS has expanded consistently. This work proposes a versatile IDS taking into account fuzzy rough sets for characteristic determination. Also, another fluffy unpleasant set-based nearest neighbourhood grouping is proposed for powerful arrangement of the KDD container dataset. This model uses a biased dataset that has 50:50 normal and attack information rather than the ordinary datasets that have 80:20 normal and attack information. The effectiveness of the proposed IDS is upgraded because of the utilisation of one-sided information. The blend of highlight determination and characterisation utilising biased information set diminishes the false alert rate and builds the identification precision.
Journal: Int. J. of Operational Research
Pages: 87-107
Issue: 1
Volume: 35
Year: 2019
Keywords: intrusion detection system; intrusion detection; FRNN; fuzzy rough set; nearest neighbourhood; NN; biased dataset.
File-URL: http://www.inderscience.com/link.php?id=99545
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:1:p:87-107

Template-Type: ReDIF-Article 1.0
Author-Name: Ajay Kumar Bhurjee
Author-X-Name-First: Ajay Kumar
Author-X-Name-Last: Bhurjee
Author-Name: Geetanjali Panda
Author-X-Name-First: Geetanjali
Author-X-Name-Last: Panda
Title: Parametric multi-objective fractional programming problem with interval uncertainty
Abstract:
The present work defines interval and interval valued function in terms of parameters. Two types of multi-objective programming problems are considered: one is a general multi-objective interval fractional programming problem and the other is a parametric form of the first problem, where the objective and constraint functions are interval valued. Relationships between the solutions of both problems are developed, and some of the results are illustrated through numerical example.
Journal: Int. J. of Operational Research
Pages: 132-145
Issue: 1
Volume: 35
Year: 2019
Keywords: interval valued function; multi-objective programming problem; fractional programming problem; efficient solution.
File-URL: http://www.inderscience.com/link.php?id=99546
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:1:p:132-145

Template-Type: ReDIF-Article 1.0
Author-Name: Saeed Asadi Bagloee
Author-X-Name-First: Saeed Asadi
Author-X-Name-Last: Bagloee
Author-Name: Mohsen Asadi
Author-X-Name-First: Mohsen
Author-X-Name-Last: Asadi
Title: Side constrained traffic assignment problem for multiclass flow
Abstract:
Capacity constraints (or side constraints) - though representing realistic features - are largely overlooked in the traffic assignment due to the inherent mathematical complexities. To this end; we first relaxed the capacity constraints by an intuitive interpretation of their corresponding Lagrange values, that is, the amount of penalty imposed to the travel time of the oversaturated road to make them saturated. This approach is basically a subgradient method in which the penalty terms bear some resemblances to the marginal cost of the concept of system optimal traffic flow. We then circumvented the complexity of multiclass facet by adopting a bias term for each user class in the Beckmann's formulation. Hence, we arrived at an uncapacitated single-class TAP in which the penalty terms are updated iteratively. The proposed algorithm obviates any additional parameter, which is not a trivial task as shown in the past studies.
Journal: Int. J. of Operational Research
Pages: 108-131
Issue: 1
Volume: 35
Year: 2019
Keywords: multiclass traffic assignment; side constraint; capacity constraint.
File-URL: http://www.inderscience.com/link.php?id=99547
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:1:p:108-131

Template-Type: ReDIF-Article 1.0
Author-Name: Dipankar Mandal
Author-X-Name-First: Dipankar
Author-X-Name-Last: Mandal
Author-Name: Sri Vanamalla Venkataraman
Author-X-Name-First: Sri Vanamalla
Author-X-Name-Last: Venkataraman
Title: A dynamic programming model for perishable inventory management
Abstract:
Perishable inventories have a limited lifetime and it may happen that a substantial quantity gets outdated and wasted leading to an additional cost due to outdating. In this paper, we develop a model which reduces such costs and hence increases the overall profit; we classify the entire lifetime of the products into two periods: in the first period a customer derives a higher utility from the product than from the second. In the traditional models discussed in literature, the net profit which is the difference between selling price and overall costs is maximised. Through this research, we propose a modification of this traditional model by varying the preferences of the product and hence its price over time. Under assumptions of stochastic demand we compare the traditional model with the modified model through numerical simulations. Our results indicate an improvement over the traditional model.
Journal: Int. J. of Operational Research
Pages: 147-177
Issue: 2
Volume: 35
Year: 2019
Keywords: inventory management; dynamic programming; perishable products.
File-URL: http://www.inderscience.com/link.php?id=100722
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:2:p:147-177

Template-Type: ReDIF-Article 1.0
Author-Name: V. Poongothai
Author-X-Name-First: V.
Author-X-Name-Last: Poongothai
Author-Name: P. Godhandaraman
Author-X-Name-First: P.
Author-X-Name-Last: Godhandaraman
Title: Cross trained servers with balking and feedback service facility by applying constraint programming model
Abstract:
This paper deals with a service facility, which has front and back room operations. In the front room, the servers deals with serving customers, perhaps from a queue and those in the back room perform a job, which is generated by the front room. In service facilities, two major issues have been considered. A constraint programming model is used to solve queue control problem. A customer on arrival finds other customers in the front room, may join the queue or may leave service facility. After completing the front room service if the customer is unsatisfied with the service, he may rejoin for service again until the service is completed successfully. The goal is to determine the expected waiting time in the queue subject to back room constraints. The effects of various parameters on the performance measures are analysed numerically.
Journal: Int. J. of Operational Research
Pages: 178-195
Issue: 2
Volume: 35
Year: 2019
Keywords: switching time; balking; feedback; constraint programming; CP; optimisation.
File-URL: http://www.inderscience.com/link.php?id=100723
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:2:p:178-195

Template-Type: ReDIF-Article 1.0
Author-Name: Íñigo L. Ansorena
Author-X-Name-First: Íñigo L.
Author-X-Name-Last: Ansorena
Title: Forecasting of quay line activity with neural networks
Abstract:
This paper presents a generalised regression neural network (GRNN) to forecast the activity of the North Quay at the port of Callao (Peru). To the author's knowledge, this is the first application of artificial neural network theory to container terminals in South America. On the basis of service characteristics, operating profiles, and dimension of vessels, the model examines the berthing line. Five numerical variables are used to estimate one dependent variable. The results achieved are satisfactory and the model built up using neural network theory is able to estimate the staying time of vessels in port.
Journal: Int. J. of Operational Research
Pages: 196-207
Issue: 2
Volume: 35
Year: 2019
Keywords: neural network; berthing line; Callao Port.
File-URL: http://www.inderscience.com/link.php?id=100724
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:2:p:196-207

Template-Type: ReDIF-Article 1.0
Author-Name: R.P. Tripathi
Author-X-Name-First: R.P.
Author-X-Name-Last: Tripathi
Author-Name: Dinesh Singh
Author-X-Name-First: Dinesh
Author-X-Name-Last: Singh
Author-Name: Devendra Singh
Author-X-Name-First: Devendra
Author-X-Name-Last: Singh
Author-Name: Pushpa Rao
Author-X-Name-First: Pushpa
Author-X-Name-Last: Rao
Title: Inventory model with quantity discount, pricing and partial backlogging for a deteriorating items
Abstract:
Some products like fruits, vegetables, pharmaceuticals, volatile liquids, etc., deteriorate continuously due to evaporation, spoilage, obsolescence, etc. The objective of this study is to establish a deterministic inventory model with quantity discount, pricing and partial backordering when the product in stock deteriorates over time. Large number of retailers makes pricing decision of their products at certain times and these decisions affect demand. The demand rate is considered to be exponential price dependent. In this proposed model deterioration rate is taken as linear time dependent. Mathematical model is established to find optimal price, cycle and total profit. The second order approximation is used to obtain closed form optimal solution. Numerical examples are provided to illustrate the proposed model. Sensitivity analysis is established with the variation of several parameters.
Journal: Int. J. of Operational Research
Pages: 208-223
Issue: 2
Volume: 35
Year: 2019
Keywords: inventory; shortage; pricing; partially backlogged; deterioration.
File-URL: http://www.inderscience.com/link.php?id=100725
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:2:p:208-223

Template-Type: ReDIF-Article 1.0
Author-Name: Maryam Bagherikahvarin
Author-X-Name-First: Maryam
Author-X-Name-Last: Bagherikahvarin
Title: A DEA-PROMETHEE approach for complete ranking of units
Abstract:
Data envelopment analysis (DEA) and multiple criteria decision aid (MCDA) are two well-known approaches to rank so-called decision-making units (DMUs) or alternatives. In this contribution, a two-step model is presented to completely rank units according to multiple inputs and outputs. In the first step, DEA is applied between each pair of DMUs independently to generate a pairwise comparison matrix. In the second step, the obtained matrix is exploited by means of Preference Ranking Organization Method for Enrichment Evaluations (PROMETHEE) to completely rank units. We show the compatibility between the resulting ranking of DEA and DEA-PROMETHEE methods while there exist just one input and one output. We also discuss the monotonicity property of the method. We compare DEA-PROMETHEE with an integrated DEA-AHP approach on a numerical example.
Journal: Int. J. of Operational Research
Pages: 224-244
Issue: 2
Volume: 35
Year: 2019
Keywords: data envelopment analysis; DEA; multiple criteria decision aid; MCDA; PROMETHEE; efficiency; ranking; decision-making; DM.
File-URL: http://www.inderscience.com/link.php?id=100726
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:2:p:224-244

Template-Type: ReDIF-Article 1.0
Author-Name: Arindam Garai
Author-X-Name-First: Arindam
Author-X-Name-Last: Garai
Author-Name: Palash Mandal
Author-X-Name-First: Palash
Author-X-Name-Last: Mandal
Author-Name: Tapan Kumar Roy
Author-X-Name-First: Tapan Kumar
Author-X-Name-Last: Roy
Title: Preferable Pareto optimal solutions for specified key objective functions to multiple objective linear programming problems using trade-off ratios under fuzzy environment: an iterative process
Abstract:
In this paper, one general iterative process is proposed for obtaining preferable Pareto optimal solutions, based on specified key objective functions, to multiple objective linear programming problems under fuzzy environment. In reality, decision maker usually specifies one key objective function to such problems. But there are known disadvantages in applying existing fuzzy optimisation techniques, in which weights, utility functions etc. are used; whereas in other techniques, none of the objective functions can be specified effectively as key objective function. Moreover, correlation between key objective function and other objective functions may not be exactly known to the decision maker. In existing interactive fuzzy optimisation techniques, initially developed by Sakawa et al. (1984), all such reference levels of fuzzy objective functions are taken as unity. But we may find it unrealistic to expect each of conflicting objective functions to attain individual goals simultaneously. In this paper, we propose to employ trade-off ratios of membership functions of fuzzy objective functions to determine corresponding reference membership levels analytically and develop one iterative process to find preferable Pareto optimal solutions under fuzzy environment. Numerical examples further illustrate our proposed iterative process. Finally conclusions are drawn.
Journal: Int. J. of Operational Research
Pages: 245-262
Issue: 2
Volume: 35
Year: 2019
Keywords: fuzzy decision-making; fuzzy optimisation; iterative process; key objective functions; multiple objective linear programming; Pareto optimal solutions; reference membership levels; trade-off ratios.
File-URL: http://www.inderscience.com/link.php?id=100727
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:2:p:245-262

Template-Type: ReDIF-Article 1.0
Author-Name: Dušan Hrabec
Author-X-Name-First: Dušan
Author-X-Name-Last: Hrabec
Author-Name: Jan Mazal
Author-X-Name-First: Jan
Author-X-Name-Last: Mazal
Author-Name: Petr Stodola
Author-X-Name-First: Petr
Author-X-Name-Last: Stodola
Title: Optimal manoeuvre for two cooperative military elements under uncertain enemy threat
Abstract:
Consider an armed military group of two friendly elements that need to move between two given locations - a starting point and an end point - in an environment with the possible presence of armed enemy elements. The potential positions of the enemy may or may not be known in advance. Therefore, we capture the possible threat by identifying the locations that are advantageous from the enemy's perspective. We model the problem using a stochastic programming approach. We then provide a deterministic reformulation of the problem in consideration of this possible threat and, through the use of cooperation, we minimise the total predicted threat as well as the suitability of the terrain for movement (or total length). Finally, we provide concrete experimental calculations and visualisations in our tactical information system, which serves as a tool for commanders to support their decision-making processes, and compare the obtained results to a selection of different approaches.
Journal: Int. J. of Operational Research
Pages: 263-277
Issue: 2
Volume: 35
Year: 2019
Keywords: optima/safe manoeuvre; operations research; mathematical modelling; decision-making; stochastic optimisation; shortest path; military tactics; cooperative military elements.
File-URL: http://www.inderscience.com/link.php?id=100728
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:2:p:263-277

Template-Type: ReDIF-Article 1.0
Author-Name: Vo Hung Duong
Author-X-Name-First: Vo Hung
Author-X-Name-Last: Duong
Author-Name: Nguyen Hung Bui
Author-X-Name-First: Nguyen Hung
Author-X-Name-Last: Bui
Title: The consideration of opened facilities' operational volumes in designing supply chain network
Abstract:
In this paper, we deal with single-item, multi-period, two-echelon capacitated facility location problems where manufacturing plants and distribution centres (DCs) are decided to be opened or not at the pre-determined potential sites. At each opened facility, our model controls operational level over or under its minimum requirement volume. To do that, we use the big M technique to detect running status. If the opened facility runs at lower minimum requirement volume, penalty cost will occur and add to objective value, which should be as low as possible. This information helps the investors and managers to evaluate performance of their supply chain (SC) network system. The problem is formulated as a mixed integer linear programming (MILP) model with the objective to minimise the total cost including transportation costs, production costs, inventory holding costs, fixed costs for opening facilities, and penalty costs. Based on the specific structure of the developed model, we need one additional constraint set before using Lagrangian relaxation algorithm to solve the problem. Numerical experiments are then conducted to compare the solution of the proposed approach and the optimal solution obtained by the commercial lingo solver.
Journal: Int. J. of Operational Research
Pages: 278-300
Issue: 2
Volume: 35
Year: 2019
Keywords: supply chain; mixed integer linear programming; Lagrangian relaxation; network design.
File-URL: http://www.inderscience.com/link.php?id=100729
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:2:p:278-300

Template-Type: ReDIF-Article 1.0
Author-Name: Gholam R. Amin
Author-X-Name-First: Gholam R.
Author-X-Name-Last: Amin
Author-Name: Amar Oukil
Author-X-Name-First: Amar
Author-X-Name-Last: Oukil
Title: Flexible target setting in mergers using inverse data envelopment analysis
Abstract:
In a merger, one important issue is the estimation of the levels of inputs and outputs required from each merging decision-making unit (DMU) so that the merged entity can realise a desired efficiency target. This paper uses the potential of inverse data envelopment analysis (InvDEA) to build a flexible target setting of the inputs and outputs. This study expands the application of the InvDEA methodology in a merger by introducing a flexible target setting that allows the decision maker to favour specific input in the target setting. We use a dataset of 30 universities to illustrate the practical scope of the proposed flexible target setting method, which can obviously be employed in any other merging context.
Journal: Int. J. of Operational Research
Pages: 301-317
Issue: 3
Volume: 35
Year: 2019
Keywords: data envelopment analysis; DEA; inverse data envelopment analysis; InvDEA; mergers; multiple optimal solutions; flexible target setting.
File-URL: http://www.inderscience.com/link.php?id=101196
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:3:p:301-317

Template-Type: ReDIF-Article 1.0
Author-Name: Gurupada Maity
Author-X-Name-First: Gurupada
Author-X-Name-Last: Maity
Author-Name: Sankar Kumar Roy
Author-X-Name-First: Sankar Kumar
Author-X-Name-Last: Roy
Title: Multi-item multi-choice integrated optimisation in inventory transportation problem with stochastic supply
Abstract:
This paper explores the study of multi-item multi-choice transportation problem (TP) in the ground of inventory optimisation. Using the concept of basic inventory optimisation, we develop a methodology for integrated optimisation in inventory transportation (IOIT) to reduce the logistic cost of a system. To accommodate the present situations of real-life TP, the stochastic supply is taken into consideration in the article. We describe a technique to reduce stochastic constraint to deterministic constraint with the help of stochastic programming. An algorithm is presented to solve the proposed problem using MATLAB. Then the proposed problem is solved by well-known optimisation technique; and the obtained solution is compared with the solution of basic inventory optimisation method. An example is presented to verify the effectiveness of the paper.
Journal: Int. J. of Operational Research
Pages: 318-339
Issue: 3
Volume: 35
Year: 2019
Keywords: transportation problem; multi-item inventory problem; multi-choice programming; stochastic programming.
File-URL: http://www.inderscience.com/link.php?id=101197
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:3:p:318-339

Template-Type: ReDIF-Article 1.0
Author-Name: Hossein Zoulfaghari
Author-X-Name-First: Hossein
Author-X-Name-Last: Zoulfaghari
Author-Name: Javad Nematian
Author-X-Name-First: Javad
Author-X-Name-Last: Nematian
Title: Minimising total weighted tardiness with considering compulsory idle times on a single machine
Abstract:
In this paper, we introduce a total weighted tardiness minimisation problem of single machine system with considering compulsory idle times of a machine (such as maintenance operations, etc.). Then, the problem is solved by using a variable restricted neighbourhood search approach. In this approach, an algorithm has been designed in which some special methods are used to produce and improve good initial solution. To represent our algorithm performance, 200 instances with small and medium sizes and 200 instances with large sizes are solved and their results have been achieved in favour of minimisation of weighted total tardiness. Furthermore, special relations operated based on a factor are used to produce instances and obtained results are investigated.
Journal: Int. J. of Operational Research
Pages: 340-354
Issue: 3
Volume: 35
Year: 2019
Keywords: total weighted tardiness; single machine; compulsory idle time; variable restricted neighbourhood search; VRNS.
File-URL: http://www.inderscience.com/link.php?id=101198
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:3:p:340-354

Template-Type: ReDIF-Article 1.0
Author-Name: Majid Anisi
Author-X-Name-First: Majid
Author-X-Name-Last: Anisi
Author-Name: Hasan Salehi Fathabadi
Author-X-Name-First: Hasan Salehi
Author-X-Name-Last: Fathabadi
Title: Survivable multi-commodity network flow design: case of node capacities and arc failure
Abstract:
This paper is focused on the design of a survivable network with node capacities and flow restrictions. The goal is to design a survivable network at minimum cost so that feasible flows exist at the time of multiple simultaneous failure arcs (failure scenario). To solve this problem Benders' decomposition (BD) was initially proposed and, then, a new strategy was presented to obtain specific failure scenarios. We computationally demonstrated that BD using this strategy could obtain the optimal solution faster. This strategy reduced iterations more greatly than the BD approach. Using this strategy, the length CPU time required for solving the problem was reduced by 30% on average.
Journal: Int. J. of Operational Research
Pages: 355-365
Issue: 3
Volume: 35
Year: 2019
Keywords: survivable; network design; Benders' decomposition; node capacities.
File-URL: http://www.inderscience.com/link.php?id=101199
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:3:p:355-365

Template-Type: ReDIF-Article 1.0
Author-Name: Martino Luis
Author-X-Name-First: Martino
Author-X-Name-Last: Luis
Author-Name: Chandra A. Irawan
Author-X-Name-First: Chandra A.
Author-X-Name-Last: Irawan
Author-Name: Arif Imran
Author-X-Name-First: Arif
Author-X-Name-Last: Imran
Title: A two-stage method for the capacitated multi-facility location-allocation problem
Abstract:
This paper examines the capacitated planar multi-facility location-allocation problem, where the number of facilities to be located is specified and each of which has a capacity constraint. A two-stage method is put forward to deal with the problem where in the first stage a technique that discretises continuous space into discrete cells is used to generate a relatively good initial facility configurations. In stage 2, a variable neighbourhood search (VNS) is implemented to improve the quality of solution obtained by the previous stage. The performance of the proposed method is evaluated using benchmark datasets from the literature. The numerical experiments show that the proposed method yields competitive results when compared to the best known results from the literature. In addition, some future research avenues are also suggested.
Journal: Int. J. of Operational Research
Pages: 366-377
Issue: 3
Volume: 35
Year: 2019
Keywords: capacitated; continuous location problem; heuristics; variable neighbourhood search; VNS.
File-URL: http://www.inderscience.com/link.php?id=101200
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:3:p:366-377

Template-Type: ReDIF-Article 1.0
Author-Name: Suresh B. Pathare
Author-X-Name-First: Suresh B.
Author-X-Name-Last: Pathare
Author-Name: Vinayak K. Gedam
Author-X-Name-First: Vinayak K.
Author-X-Name-Last: Gedam
Title: Mean response time of a two stage open queueing network model with feedback
Abstract:
The response time plays an important role in studying the various characteristics of queueing network models with feedback. Database recurrence relation is used to compute a sequence of response time of queueing network models with feedback. The sample means from those response times are used to estimate true mean response times. Further we construct some confidence intervals for mean response times. We investigate the accuracy of the different confidence intervals and the proposed estimators with the help of numerical simulation study.
Journal: Int. J. of Operational Research
Pages: 397-423
Issue: 3
Volume: 35
Year: 2019
Keywords: response time; coverage percentage; relative coverage; relative average length; feedback; confidence intervals.
File-URL: http://www.inderscience.com/link.php?id=101201
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:3:p:397-423

Template-Type: ReDIF-Article 1.0
Author-Name: Mohammadbagher Afshar-Bakeshloo
Author-X-Name-First: Mohammadbagher
Author-X-Name-Last: Afshar-Bakeshloo
Author-Name: Fariborz Jolai
Author-X-Name-First: Fariborz
Author-X-Name-Last: Jolai
Author-Name: Mostafa Mazinani
Author-X-Name-First: Mostafa
Author-X-Name-Last: Mazinani
Author-Name: Farhad Salehian
Author-X-Name-First: Farhad
Author-X-Name-Last: Salehian
Title: One-for-one period policy and its optimal solution over a finite horizon
Abstract:
Recently, a new ordering policy named one-for-one period policy has been introduced in a steady state condition for the zero ordering cost with an assumption of lost sales. In this policy, constant time interval between two consecutive unique orders is assumed. In contrast to this policy, this paper addresses a new approach in which inter-arrival times are determined in a finite horizon with limited amount of arrivals. Due to the transient condition of our approach, namely (S(<i>n</i>), 1), matrix multiplication must be employed, but it quickly becomes cumbersome for large n as there are (<i>n</i> − 1) decision variables for n arrivals. Thus, we have invoked the genetic search strategy to reduce the amount of search. Finally, we provide a numerical analysis to evaluate the performance of our approach. The results showed that by applying the suggested approach we can save cost compared with the one-for-one period policy for <i>n</i> < 200, especially when the ratio of lost sales to holding cost is large. Furthermore, arrivals scheduling creates a dome-shaped inter-arrival times.
Journal: Int. J. of Operational Research
Pages: 378-396
Issue: 3
Volume: 35
Year: 2019
Keywords: inventory control; one-for-one period policy; scheduling; Poisson process; genetic algorithm.
File-URL: http://www.inderscience.com/link.php?id=101202
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:3:p:378-396

Template-Type: ReDIF-Article 1.0
Author-Name: Michal Weber
Author-X-Name-First: Michal
Author-X-Name-Last: Weber
Author-Name: Tchai Tavor
Author-X-Name-First: Tchai
Author-X-Name-Last: Tavor
Author-Name: Uriel Spiegel
Author-X-Name-First: Uriel
Author-X-Name-Last: Spiegel
Title: The effect of market concentration on total welfare and its distribution in a supply chain case
Abstract:
The concentration of industries affects the total welfare of the economy and changes its distribution among all economic agents. This paper examines an entire supply chain that includes multiple stages within the cheese industry. It presents the effect of market concentration levels on prices, quantities, profits, consumer surplus and the total welfare of all sectors involved in the production and consumption processes. Since increased concentration may lead to a higher degree of inequality, the relationship between inequality and efficiency is investigated. These issues are demonstrated by using a simplified structure of the cheese industry.
Journal: Int. J. of Operational Research
Pages: 424-445
Issue: 3
Volume: 35
Year: 2019
Keywords: concentration; Herfindahl-Hirschman index; HHI; supply chain; monopoly; retailers.
File-URL: http://www.inderscience.com/link.php?id=101203
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:3:p:424-445

Template-Type: ReDIF-Article 1.0
Author-Name: Harpreet Kaur
Author-X-Name-First: Harpreet
Author-X-Name-Last: Kaur
Author-Name: Surya Prakash Singh
Author-X-Name-First: Surya Prakash
Author-X-Name-Last: Singh
Title: Modelling sustainable procurement problem: a goal-based approach
Abstract:
Sustainable procurement problem not only considers traditional parameters such as purchasing cost, ordering cost, holding cost, and logistics cost but also considers non-traditional parameters such as carbon emission cost, thus, making it a multi-objective optimisation problem. However, in competitive business scenario, organisations have also some set targets for various traditional and non-traditional parameters making the procurement process a goal oriented one. These goals in turn make the overall procurement problem conflicting while the organisation tries to achieve all these goals with minimum deviations. Therefore, this paper is a novel attempt to optimise multi-objective sustainable procurement problem (MoSPP) in presence of various goals using goal programming approach and is referred as Multi_Goal_SPP. The goals for goal programming formulation are computed through MoSPP. The methodology is demonstrated through two illustrative examples solved in LINGO 10. Multi_Goal_SPP establishes optimal trade-off between conflicting goals set by organisation. The proposed model ensures the minimum total deviation from goals required to meet specified demand.
Journal: Int. J. of Operational Research
Pages: 447-469
Issue: 4
Volume: 35
Year: 2019
Keywords: multi-objective sustainable procurement problem; MoSPP; Multi_Goal_SPP; sustainable procurement problem; goal programming; multiple objectives; carbon emissions.
File-URL: http://www.inderscience.com/link.php?id=101455
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:4:p:447-469

Template-Type: ReDIF-Article 1.0
Author-Name: Harendra Kumar
Author-X-Name-First: Harendra
Author-X-Name-Last: Kumar
Author-Name: Pankaj Kumar
Author-X-Name-First: Pankaj
Author-X-Name-Last: Kumar
Author-Name: Manisha Sharma
Author-X-Name-First: Manisha
Author-X-Name-Last: Sharma
Title: A genetic algorithm for a flow shop scheduling problem with breakdown interval, transportation time and weights of jobs
Abstract:
A flow shop problem exists when all the jobs have the same processing order through the machines. In flow shop problem, the technological demand that the jobs pass between the machines in the same order. The objective of this paper is to find an optimal ordering of 'n' jobs for three machines involving processing times, transportation times, break down interval and weights of the jobs by using genetic algorithm (GA) approach. The proposed algorithm is compared with already published problems in literature. The numerical results show that the present algorithm is a good one within the best well known heuristic algorithms in the field.
Journal: Int. J. of Operational Research
Pages: 470-483
Issue: 4
Volume: 35
Year: 2019
Keywords: flow shop scheduling; processing time; break down interval; genetic algorithm.
File-URL: http://www.inderscience.com/link.php?id=101456
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:4:p:470-483

Template-Type: ReDIF-Article 1.0
Author-Name: Mehdi Seifbarghy
Author-X-Name-First: Mehdi
Author-X-Name-Last: Seifbarghy
Author-Name: Salman Barzegar
Author-X-Name-First: Salman
Author-X-Name-Last: Barzegar
Title: An integrated vendor-buyer model with equal shipments, normally distributed demand and empirically distributed lead-time
Abstract:
This study addresses joint economic lot-sizing (JELS) problem with a vendor and a buyer which replenishes a given product from the vendor. Shipments transferred from the vendor to the buyer are assumed to have equal sizes. In addition, unlike the previous studies, demand and delivery are assumed to be stochastic and following normal and experimental distributions respectively. In the given model, we assume that the combination of the two types of backordered and lost demand can exist. In addition, service level constraint is also considered. The purpose is to find the optimal order values, the number of shipments, reorder point and safety stock. We present a heuristic method in order to reach the decision variables of the model. Numerical examples indicated frugality in chain cost in the integrated model and efficiency in the heuristic method. In addition, the results showed that chain costs increase by increasing delivery time, but the values of reorder point and safety stock depend on the changes in the level of services and they increase as the service level increases.
Journal: Int. J. of Operational Research
Pages: 484-504
Issue: 4
Volume: 35
Year: 2019
Keywords: supply chain; vendor-buyer integration; equal shipments; stochastic demand; stochastic lead-time.
File-URL: http://www.inderscience.com/link.php?id=101457
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:4:p:484-504

Template-Type: ReDIF-Article 1.0
Author-Name: Guo-Liang Yang
Author-X-Name-First: Guo-Liang
Author-X-Name-Last: Yang
Author-Name: Ali Emrouznejad
Author-X-Name-First: Ali
Author-X-Name-Last: Emrouznejad
Title: Modelling efficient and anti-efficient frontiers in DEA without explicit inputs
Abstract:
Data envelopment analysis (DEA) is one of the most widely used tools in efficiency analysis of many business and non-profit organisations. Recently, more and more researchers investigated DEA models without explicit input (DEA-WEI). DEA-WEI models can divide DMUs into two categories: efficient DMUs and inefficient DMUs. Usually there is a set of DMUs, which are 'efficient' so that conventional DEA models could not rank them. In this paper, we first develop a performance index based on efficient and anti-efficient frontiers in DEA-WEI models. Further, the corresponding performance index in DEA-WEI models with quadratic utility terms (quadratic DEA-WEI) is proposed also. Finally, we present two case studies on performance assessment of basketball players and the evaluation of research institutes in Chinese Academy of Sciences (CAS) to show the applicability and usefulness of the performance indices developed in this paper.
Journal: Int. J. of Operational Research
Pages: 505-528
Issue: 4
Volume: 35
Year: 2019
Keywords: data envelopment analysis; DEA without explicit input; efficient frontier; anti-efficient frontier.
File-URL: http://www.inderscience.com/link.php?id=101458
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:4:p:505-528

Template-Type: ReDIF-Article 1.0
Author-Name: Chandra K. Jaggi
Author-X-Name-First: Chandra K.
Author-X-Name-Last: Jaggi
Author-Name: Mamta Gupta
Author-X-Name-First: Mamta
Author-X-Name-Last: Gupta
Author-Name: Sunil Tiwari
Author-X-Name-First: Sunil
Author-X-Name-Last: Tiwari
Title: Credit financing in economic ordering policies for deteriorating items with stochastic demand and promotional efforts in two-warehouse environment
Abstract:
Retailers are nowadays focusing on promotional activities in order to attract customers because of increasing competition. Promotional efforts have significant impact on the replenishment policy and the sale price of goods. In this paper, a two warehouse inventory model is developed for deteriorating items subject to promotional efforts under permissible delay in payments. Here, a price dependent stochastic demand function is considered with partially backlogged shortages. Several realistic cases, sub cases and scenarios have been taken into account and the corresponding problems have been formulated as nonlinear constrained optimisation problems. To illustrate the proposed model two numerical examples have been solved. Further, a numerical example has been extended to perform sensitivity analysis of the model and discuss specific managerial insights.
Journal: Int. J. of Operational Research
Pages: 529-550
Issue: 4
Volume: 35
Year: 2019
Keywords: inventory; deterioration; partially backlogging; permissible delay in payment; price dependent stochastic demand; promotional effort.
File-URL: http://www.inderscience.com/link.php?id=101459
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:4:p:529-550

Template-Type: ReDIF-Article 1.0
Author-Name: Noha Mostafa
Author-X-Name-First: Noha
Author-X-Name-Last: Mostafa
Author-Name: Amr Eltawil
Author-X-Name-First: Amr
Author-X-Name-Last: Eltawil
Title: Using valid inequalities to solve the integrated production-inventory-distribution-routing problem
Abstract:
The production-inventory-distribution-routing problem is an integrated supply chain management problem that combines decisions on several functions. The objective is to minimise the total costs without violating demand fulfilment policy. A production-inventory-distribution-routing problem of medium size is a combinatorial optimisation problem mostly intractable to solve using exact methods. The main contribution of this work is to introduce valid inequalities for a problem with a single plant, multiple products and multiple heterogeneous vehicles to improve the quality of lower bounds, obtain a good approximation of the convex hull of the polyhedron of the problem and reduce its hypervolume, so that the computation time can be reduced without a significant effect on the quality of the solutions found. The results showed that adding the valid inequalities to the model can improve the percentage gaps for all the tested instances with a significant improvement in the lower bounds from the poor bounds obtained from the linear programming relaxation (up to 98.8% for the dataset of 50 customers and up to 79.7% for the dataset of 100 customers).
Journal: Int. J. of Operational Research
Pages: 551-574
Issue: 4
Volume: 35
Year: 2019
Keywords: production-inventory-distribution-routing problem; PIDRP; vehicle routing; lower bounds; valid inequalities; supply chain management; SCM; lot sizing; inventory management; distribution.
File-URL: http://www.inderscience.com/link.php?id=101460
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:4:p:551-574

Template-Type: ReDIF-Article 1.0
Author-Name: Nahid Jafari
Author-X-Name-First: Nahid
Author-X-Name-Last: Jafari
Title: A non-assignment problem-based formulation for the asymmetric travelling salesman problem and its variation
Abstract:
In this paper, an exact formulation for the asymmetric travelling salesman problem (ATSP) is presented by approaching it as a single commodity flow problem. This approach is different from existing exact formulations in the literature which are based on the assignment problem (AP), thus, it resolves issues that the AP-based formulations pose for solving certain real world instances by standard integer programming methods such as branch and bound. Moreover, in our computational experiments, half of the total computational time is expended to find the first feasible solution, then it is converged quickly to optimality. In contrast, the AP-based models rapidly computed an initial feasible solution but showed slow convergence to the optimum. Moreover, it is extendable to other variations of the travelling salesman problem (TSP) such as the multiple TSP and the selective TSP.
Journal: Int. J. of Operational Research
Pages: 575-585
Issue: 4
Volume: 35
Year: 2019
Keywords: asymmetric travelling salesman problem; ATSP; multiple travelling salesman problem; m-TSP; selective travelling salesman problem.
File-URL: http://www.inderscience.com/link.php?id=101461
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:35:y:2019:i:4:p:575-585

Template-Type: ReDIF-Article 1.0
Author-Name: Shruti Kapoor
Author-X-Name-First: Shruti
Author-X-Name-Last: Kapoor
Author-Name: Selvamuthu Dharmaraja
Author-X-Name-First: Selvamuthu
Author-X-Name-Last: Dharmaraja
Author-Name: Viswanathan Arunachalam
Author-X-Name-First: Viswanathan
Author-X-Name-Last: Arunachalam
Title: Transient solution of fluid queue modulated by two independent birth-death processes
Abstract:
The objective of this paper is to study the transient distribution of the buffer content in any intermediate node of a wireless network based on IEEE 802.11 standards. The steady state solution of the discussed model has already been given in Arunachalam et al. (2010). The methodology used, maps the underlying model to a fluid queue model driven by two independent finite state birth-death processes with the aim to simplify the solution which is obtained in closed form with numerical illustration. Along with the buffer occupancy distribution, other performance measures: throughput, server utilisation and expected buffer content are also obtained numerically.
Journal: Int. J. of Operational Research
Pages: 1-11
Issue: 1
Volume: 36
Year: 2019
Keywords: IEEE 802.11 wireless networks; fluid queue; buffer occupancy distribution.
File-URL: http://www.inderscience.com/link.php?id=102067
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:1:p:1-11

Template-Type: ReDIF-Article 1.0
Author-Name: Mostafa Zandieh
Author-X-Name-First: Mostafa
Author-X-Name-Last: Zandieh
Author-Name: Seyed Omid Mohaddesi
Author-X-Name-First: Seyed Omid
Author-X-Name-Last: Mohaddesi
Title: Portfolio rebalancing under uncertainty using meta-heuristic algorithm
Abstract:
In this paper, we solve portfolio rebalancing problem when security returns are represented by uncertain variables considering transaction costs. The performance of the proposed model is studied using constant-proportion portfolio insurance (CPPI) as rebalancing strategy. Numerical results showed that uncertain parameters and different belief degrees will produce different efficient frontiers, and affect the performance of the proposed model. Moreover, CPPI strategy performs as an insurance mechanism and limits downside risk in bear markets while it allows potential benefit in bull markets. Finally, using a globally optimisation solver and genetic algorithm (GA) for solving the model, we concluded that the problem size is an important factor in solving portfolio rebalancing problem with uncertain parameters and to gain better results, it is recommended to use a meta-heuristic algorithm rather than a global solver.
Journal: Int. J. of Operational Research
Pages: 12-39
Issue: 1
Volume: 36
Year: 2019
Keywords: portfolio rebalancing; transaction costs; constant-proportion portfolio insurance; CPPI; uncertainty theory; meta-heuristic algorithm.
File-URL: http://www.inderscience.com/link.php?id=102068
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:1:p:12-39

Template-Type: ReDIF-Article 1.0
Author-Name: Faizul Huq
Author-X-Name-First: Faizul
Author-X-Name-Last: Huq
Author-Name: M. Khurrum S. Bhutta
Author-X-Name-First: M. Khurrum S.
Author-X-Name-Last: Bhutta
Author-Name: Ziaul Huq
Author-X-Name-First: Ziaul
Author-X-Name-Last: Huq
Title: A heuristic search routine for solving two objective mixed integer LP problems for scheduling in a service factory
Abstract:
This paper presents a two-objective mixed binary integer linear programming model and a search routine solution method is proposed using a service factory environment with multi-processor workstations and a constant daily workload, for employee scheduling, number of machines per station, and makespan minimisation objectives. The search routine is simple enough to be implemented by managers using readily available spreadsheet programs. Solution of the four-station service factory formulation yielded results for improvement in the makespan of the shop. This search routine can be used by management in streamlining and optimising the service factory production environment as exemplified in the four-station case, and could also be applied to multi-processor flow shops.
Journal: Int. J. of Operational Research
Pages: 40-61
Issue: 1
Volume: 36
Year: 2019
Keywords: service factory; scheduling; lot splitting; binary integer linear programming; makespan.
File-URL: http://www.inderscience.com/link.php?id=102069
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:1:p:40-61

Template-Type: ReDIF-Article 1.0
Author-Name: Yazan Khalid Abed-Allah Migdadi
Author-X-Name-First: Yazan Khalid Abed-Allah
Author-X-Name-Last: Migdadi
Author-Name: Hala Suliaman Mahmoud Al-Momani
Author-X-Name-First: Hala Suliaman Mahmoud
Author-X-Name-Last: Al-Momani
Title: The adopting of Markov analysis to forecast the probability of students' enrolment at universities scientific faculties in Jordan
Abstract:
The main aim of the research is to evaluate and measure the probabilities of scientific faculties' enrolment at public universities in Jordan and examine the impact of universities location. Secondary data were collected from the annual statistical reports of the Ministry of Higher Education and Scientific Research. Eight out of ten public universities were surveyed, ten scientific faculties were investigated. Markov analysis technique was used to evaluate and measure the probabilities. Linear regression was used to forecast the changes of probabilities over time. Non-parametric statistical technique was used to compare the difference among universities and to examine the impact of universities location. This study revealed that the expected number of enrolled students over time of the majority of universities will decrease. The changes of probabilities were found. Significant differences among some universities were found. It also was found that the location of university is not a determinant for expected enrolled students. Many previous studies have used Markov analysis, but there is no one analysed the faculty level.
Journal: Int. J. of Operational Research
Pages: 62-77
Issue: 1
Volume: 36
Year: 2019
Keywords: Markov analysis; forecasting; enrolment; scientific faculty; university; Jordan.
File-URL: http://www.inderscience.com/link.php?id=102070
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:1:p:62-77

Template-Type: ReDIF-Article 1.0
Author-Name: Rakesh Kumar
Author-X-Name-First: Rakesh
Author-X-Name-Last: Kumar
Author-Name: Sapana Sharma
Author-X-Name-First: Sapana
Author-X-Name-Last: Sharma
Title: Transient analysis of an M/M/c queuing system with retention of reneging customers
Abstract:
In this paper, we study the transient behaviour of an M/M/c queuing system with reneging and retention of reneging customers. The probability generating function technique along with Bessel function properties is used to derive the time-dependent state probabilities explicitly. The transient behaviour of system size probabilities, the expected system size, the average reneging rate, and the average retention rate is studied with the help of a numerical example.
Journal: Int. J. of Operational Research
Pages: 78-91
Issue: 1
Volume: 36
Year: 2019
Keywords: transient analysis; M/M/c queuing system; expected system size; operational research; reneging; retention.
File-URL: http://www.inderscience.com/link.php?id=102071
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:1:p:78-91

Template-Type: ReDIF-Article 1.0
Author-Name: Santosh Vitthal Bhaskar
Author-X-Name-First: Santosh Vitthal
Author-X-Name-Last: Bhaskar
Author-Name: Hari Narayan Kudal
Author-X-Name-First: Hari Narayan
Author-X-Name-Last: Kudal
Title: Multi-criteria decision-making approach to material selection in tribological application
Abstract:
This paper presents application of various multi-criteria decision-making (MCDM) techniques to material selection in tribological application. The alternative materials considered for ranking are variants of AISI 4140 which is nitrided and then coated with various low-friction surface coating materials. This study analyses and discusses the priority settings on the basis of constructed model which compares the ranking outcomes among simple additive weighting (SAW), multiplicative analytic hierarchy process (MAHP), technique for order preference by similarity to ideal solution (TOPSIS), modified-TOPSIS (M-TOPSIS) and compromise ranking method (VIKOR). Attribute weights obtained by analytic hierarchy process (AHP), are used as the inputs and outputs are materials' rankings on the basis of material selection index (MSI), which help designers and engineers to reach a consensus on materials selection for a specific application. The ranks obtained by various methods are compared. Results indicate that suggested method can effectively be applied to similar problems.
Journal: Int. J. of Operational Research
Pages: 92-122
Issue: 1
Volume: 36
Year: 2019
Keywords: analytic hierarchy process; AHP; multiplicative analytic hierarchy process; MAHP; multi-criteria decision making; MCDM; simple additive weighting; SAW; technique for order preference by similarity to ideal solution; TOPSIS; compromise ranking method; VIKOR.
File-URL: http://www.inderscience.com/link.php?id=102072
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:1:p:92-122

Template-Type: ReDIF-Article 1.0
Author-Name: Saeed Asadi Bagloee
Author-X-Name-First: Saeed Asadi
Author-X-Name-Last: Bagloee
Author-Name: Glenn Withers
Author-X-Name-First: Glenn
Author-X-Name-Last: Withers
Title: Side constrained optimisation to capture capacity of choices in the multinomial logit model: case study of income tax policy in the USA prior to the 2009 economic crisis
Abstract:
The choices' limited capacities of the discrete choice models must be taken into account. We propose a convex optimisation formulation in which the exponential formulation of the logit model is upheld in the Karush-Kuhn-Tucker (KKT) conditions. The capacities of the choices are then added to the formulation as side constraints. A solution algorithm based on the successive coordinate descent is proposed. For numerical evaluation, we investigate US income tax policies for the years prior to the 2009 crisis using multinomial logit models. The tendency of the states for choice of income tax versus other tax sources is assessed and it is found that: 1) all states show a propensity to levy more income tax; 2) this propensity has a ceiling cap similar to what is already known from the 'Laffer curve'; 3) residents in the states with already high income tax are more likely to be subjected to even heavier income tax within caps.
Journal: Int. J. of Operational Research
Pages: 123-149
Issue: 1
Volume: 36
Year: 2019
Keywords: convex optimisation; successive coordinate descent; SCD; logit; income tax; behavioural model; Laffer curve; economic crisis; recession; USA.
File-URL: http://www.inderscience.com/link.php?id=102073
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:1:p:123-149

Template-Type: ReDIF-Article 1.0
Author-Name: Farshad Faezy Razi
Author-X-Name-First: Farshad Faezy
Author-X-Name-Last: Razi
Author-Name: Hamed Sarkari
Author-X-Name-First: Hamed
Author-X-Name-Last: Sarkari
Title: Proposing a new approach to the selection of material portfolio using a combination of data mining and optimisation methods
Abstract:
The present paper aims to provide a new framework for the selection of a portfolio of materials. This paper shows that, compared with the traditional methods in the selection of materials, how the new materials are analysed based on new ideas. The case study is materials required for production of tile glaze in both traditional and modern methods. Modelling in this study was done based on mathematical description approach. The results of execution of feature selection algorithm revealed that important factors in the selection of glaze for production of tile in both traditional and modern methods include cracking, self-cleaning, uniformity, water absorption, and market potential. In addition, the results of K-means algorithm showed that all the materials of choice for production of tile glaze are not placed in a single cluster. Therefore, each cluster should be evaluated separately. Unlike the classical approaches to the selection of materials, in the new approach, candidates for the selection of tile glaze are firstly clustered by K-means algorithm. Each cluster is independently ranked using free disposal hull model. Free disposal hull is a mathematical programming model based on data envelopment analysis. The final optimised portfolio of materials was determined using the genetic algorithm.
Journal: Int. J. of Operational Research
Pages: 151-169
Issue: 2
Volume: 36
Year: 2019
Keywords: material selection; feature selection algorithm; K-means algorithm; DEA-FDH; genetic algorithm.
File-URL: http://www.inderscience.com/link.php?id=102408
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:2:p:151-169

Template-Type: ReDIF-Article 1.0
Author-Name: Sri Vanamalla Venkataraman
Author-X-Name-First: Sri Vanamalla
Author-X-Name-Last: Venkataraman
Author-Name: Dereje Asfaw
Author-X-Name-First: Dereje
Author-X-Name-Last: Asfaw
Title: Revenue sharing contract under asymmetric information
Abstract:
We analyse a two stage supply chain with a single risk neutral manufacturer and a risk neutral retailer in a single period setting. The retailer associates costs towards procurement of the product and its marketing and sales. These costs are often private information of the retailer; the retailer has an incentive to overstate his associated costs to acquire a larger share of revenue. In this paper, assuming retailers have private information about their associated costs we derive an optimal revenue sharing contract as designed by the manufacturer for each of the cost structure of the retailers. The retailer's choice from such a contract menu reveals information about their true cost. We analyse our model under various scenarios; we observe that the proposed revenue sharing contract improves the profit of manufacturer and that of the total supply chain.
Journal: Int. J. of Operational Research
Pages: 170-187
Issue: 2
Volume: 36
Year: 2019
Keywords: supply chain management; asymmetric information; revenue sharing contract.
File-URL: http://www.inderscience.com/link.php?id=102409
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:2:p:170-187

Template-Type: ReDIF-Article 1.0
Author-Name: Sérgio Guerreiro
Author-X-Name-First: Sérgio
Author-X-Name-Last: Guerreiro
Author-Name: Khaled Gaaloul
Author-X-Name-First: Khaled
Author-X-Name-Last: Gaaloul
Title: A decision-making approach for enterprise architecture evolution using simulation
Abstract:
Enterprise architecture (EA) is a discipline that provides management with appropriate indicators and controls to steer and model the enterprise during change. However, the management of such change is a challenging task for enterprise architects due to the complex dependencies amongst EA models when evolving from initial (As-is) to posterior (To-be) states. We present an approach supporting design decision during EA evolution, by assisting enterprise architects in computing best alternatives to a posterior state. In doing so, we model EA artefacts dependencies and identify their evolution during change. This model is, then, processed using a control schema to inform EA design decisions. Further, we rationalise on design decision by computing EA models alternatives, using Markov theory. Finally, we evaluate this decision-making approach using a motivating example by simulating a stochastic solution in order to argue about the usefulness and applicability of our proposal.
Journal: Int. J. of Operational Research
Pages: 188-208
Issue: 2
Volume: 36
Year: 2019
Keywords: enterprise architecture; evolution; design decision; simulation; Markov theories.
File-URL: http://www.inderscience.com/link.php?id=102410
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:2:p:188-208

Template-Type: ReDIF-Article 1.0
Author-Name: Ashoke Kumar Bera
Author-X-Name-First: Ashoke Kumar
Author-X-Name-Last: Bera
Author-Name: Dipak Kumar Jana
Author-X-Name-First: Dipak Kumar
Author-X-Name-Last: Jana
Title: A multiple-criteria decision analysis for criticality of boiler tube failures in interval type-2 fuzzy environment
Abstract:
This paper presents a multi-factor decision-making approach for prioritising criticality of failure modes as an alternative to traditional approach of failure mode effect and criticality analysis (FMECA). A review of the literature reveals that although a number of studies have been done on these issues, but none of them have explicitly studied the variations in expert's opinion (intra-personal uncertainty) and the variations in the understanding among experts (inter-personal uncertainty) together. To deal with this problem, this literature proposes a new fuzzy FMECA approach based on IT2 fuzzy sets, which has the ability to capture both intra-personal and inter-personal uncertainty. This approach introduces a more accurate representation of the aggregated data by presenting variations among the individual judgements into type-2 fuzzy numbers, allowing suitable weights for each risk factor by decision makers and thereby developing a flexibility for analysis. The proposed method is applied to evaluate the criticality of different failure modes of boiler tubes of a coal-fired thermal power plants. Interval type-2 fuzzy sets with signed distances, a multi criteria decision-making tool, is used to evaluate the criticalities of the different failure modes (alternatives) of the system.
Journal: Int. J. of Operational Research
Pages: 209-231
Issue: 2
Volume: 36
Year: 2019
Keywords: failure mode effect and criticality analysis; FMECA; interval type-2 fuzzy set; multiple-criteria decision analysis; signed distance; linear assignment method; interval type-2 fuzzy number.
File-URL: http://www.inderscience.com/link.php?id=102411
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:2:p:209-231

Template-Type: ReDIF-Article 1.0
Author-Name: Tuan Son Nguyen
Author-X-Name-First: Tuan Son
Author-X-Name-Last: Nguyen
Author-Name: Sherif Mohamed
Author-X-Name-First: Sherif
Author-X-Name-Last: Mohamed
Author-Name: Anisur Rahman
Author-X-Name-First: Anisur
Author-X-Name-Last: Rahman
Title: A new hybrid supplier selection model
Abstract:
Selecting the right supplier is one of the most challenging tasks for organisations as it essentially reduces purchasing cost and improves corporate competitiveness. This study aims at developing a hybrid model in supplier selection for a non-homogeneous group decision-making process to select a supplier that best satisfies the purchaser. The analytical hierarchy process (AHP), house of quality (HOQ), and linguistic ordered weighted averaging (LOWA) operator are applied in the proposed model. This model is illustrated with a real world example by applying it to a mechanical manufacturing company in Vietnam. It is found that supplier selection does not only depend on a low price offer, but also on supplier's quality, technological capability, capability of on-time delivery, flexibility and good relationship. This study makes new methodological and practical contributions to supplier selection research and applications through development of a hybrid model for non-homogeneous group decision making in supplier selection, and for the first time this study applies the LOWA operator in aggregating linguistic terms of non-homogeneous group decision making in a supplier selection process.
Journal: Int. J. of Operational Research
Pages: 232-253
Issue: 2
Volume: 36
Year: 2019
Keywords: supply chain management; decision making; supplier selection; analytic hierarchy process; house of quality; HOQ; linguistic ordered weighted averaging; LOWA.
File-URL: http://www.inderscience.com/link.php?id=102412
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:2:p:232-253

Template-Type: ReDIF-Article 1.0
Author-Name: Palash Ranjan Das
Author-X-Name-First: Palash Ranjan
Author-X-Name-Last: Das
Author-Name: Gopal Govindasamy
Author-X-Name-First: Gopal
Author-X-Name-Last: Govindasamy
Title: On the application of Bayesian credibility theory in movie rankings
Abstract:
Credibility theory is a branch of actuarial science devoted to quantify how unique a particular outcome will be when compared to an outcome deemed as typical. In this paper, we will examine the application of the principles of Bayesian credibility theory in rating and ranking movies by a premier online movie database which is based on user's votes. Although the Bayesian credibility theory was developed originally as a method to calculate the risk premium by combining the individual risk experience with the class risk experience, it is generic enough to deal with a wide range of practical applications quite different from the classical application mentioned above. One such diverse application of the theory in an unlikely domain will be discussed in this paper.
Journal: Int. J. of Operational Research
Pages: 254-269
Issue: 2
Volume: 36
Year: 2019
Keywords: credibility theory; prior distribution; likelihood function; posterior distribution; loss function; Bayesian approach.
File-URL: http://www.inderscience.com/link.php?id=102413
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:2:p:254-269

Template-Type: ReDIF-Article 1.0
Author-Name: A.R. Jayaraman
Author-X-Name-First: A.R.
Author-X-Name-Last: Jayaraman
Author-Name: M.R. Srinivasan
Author-X-Name-First: M.R.
Author-X-Name-Last: Srinivasan
Title: Determinants of Indian banks efficiency: a two-stage approach
Abstract:
Analysing the performance of banks at periodical intervals assumes importance from the perspective of bankers, investors and regulator. This study seeks to examine the cost, revenue and profit efficiency of Indian banks during 2004 to 2013 using data envelopment analysis (DEA) and identifies the determinants of efficiency using Tobit regression. Results show that the cost and profit efficiency of banks are positively correlated and reveal that if the banks are cost efficient, they are also profit efficient. Further, profit efficiency is the better differentiator of performing and non-performing banks, in Indian context. The main determinants of efficiency of banks under cost, revenue and profit DEA models are size and management of the banks. Contrary to popular belief, the GDP growth has an inverse relationship with efficiency of the banks.
Journal: Int. J. of Operational Research
Pages: 270-291
Issue: 2
Volume: 36
Year: 2019
Keywords: bank; data envelopment analysis; DEA; cost efficiency; profit efficiency; Tobit regression; India.
File-URL: http://www.inderscience.com/link.php?id=102414
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:2:p:270-291

Template-Type: ReDIF-Article 1.0
Author-Name: R. Sudhesh
Author-X-Name-First: R.
Author-X-Name-Last: Sudhesh
Author-Name: A. Azhagappan
Author-X-Name-First: A.
Author-X-Name-Last: Azhagappan
Title: Analysis of an M/M/c queue with heterogeneous servers, balking and reneging
Abstract:
This paper analyses a heterogeneous multi-server queuing system with balking and reneging. In this system, when all the c servers are busy, an arriving customer decides either to join the queue with probability <i>p</i> or balk with probability 1 - <i>p</i>. The customers waiting in the queue become impatient due to the long wait for service. Therefore, each individual waiting customer activates an independent impatience timer such that the customer's service starts before his timer expires, he gets the service and leaves the system after the completion of service. Otherwise, he abandons the system and never returns. The time-dependent system size probabilities are derived explicitly using generating function. Further the time-dependent mean, variance, busy period distribution and steady-state probabilities are obtained. Finally, some numerical illustrations are presented.
Journal: Int. J. of Operational Research
Pages: 293-309
Issue: 3
Volume: 36
Year: 2019
Keywords: M/M/c queue; heterogeneous servers; balking; reneging; transient probabilities; busy period; generating function.
File-URL: http://www.inderscience.com/link.php?id=103120
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:3:p:293-309

Template-Type: ReDIF-Article 1.0
Author-Name: Snigdha Karmakar
Author-X-Name-First: Snigdha
Author-X-Name-Last: Karmakar
Author-Name: Sujit Kumar De
Author-X-Name-First: Sujit Kumar
Author-X-Name-Last: De
Author-Name: Adrijit Goswami
Author-X-Name-First: Adrijit
Author-X-Name-Last: Goswami
Title: Solution of a sustainable bi-objective book-producers' problem using statistical approach
Abstract:
This article leads to statistical approach on bi-objective economic production quantity (EPQ) inventory problem especially on two book producers' problem under unit selling price and production run time dependent demand rate. The concept of 'early product-early demand' and 'low price-high demand' policy has been employed for developing this bi-objective inventory problem. The discounts on marked unit selling price have been offered at the time of selling the books on spot for both the producers also. In this model we are optimising the objective functions of both producers for this it is considered as bi-objective model. However, behind any computational process there might have the effects of extraneous variables for which we have used correlation approach to solve the model. In addition, we use goal attainment (GA) approach to solve the bi-objective problems first and then generate dataset from sensitivity analysis of the model. Moreover, we compute the correlation coefficients matrix for both joint and independent relations of the objective functions. The decision is made on the basis of testing of hypothesis over the decision maker's (DM) zone of intelligence. Finally, the dot plots are made for justification of the model.
Journal: Int. J. of Operational Research
Pages: 310-336
Issue: 3
Volume: 36
Year: 2019
Keywords: bi-objective inventory; extraneous variables; discounts; goal attainment method; Spearman's correlation coefficient; optimisation.
File-URL: http://www.inderscience.com/link.php?id=103121
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:3:p:310-336

Template-Type: ReDIF-Article 1.0
Author-Name: Antonio Del Torto
Author-X-Name-First: Antonio Del
Author-X-Name-Last: Torto
Author-Name: Rossella Pozzi
Author-X-Name-First: Rossella
Author-X-Name-Last: Pozzi
Author-Name: Emanuele Porazzi
Author-X-Name-First: Emanuele
Author-X-Name-Last: Porazzi
Author-Name: Elisabetta Garagiola
Author-X-Name-First: Elisabetta
Author-X-Name-Last: Garagiola
Author-Name: Fernanda Strozzi
Author-X-Name-First: Fernanda
Author-X-Name-Last: Strozzi
Title: Length of stay reduction in the emergency department and its quantification using complex network theory
Abstract:
Overcrowding in emergency department (ED) has become an increasingly significant problem worldwide. Different crowding measures have been proposed in the literature and, between them, the length of stay (LOS) is one of the most recognised. In this paper the LOS in the ED of a hospital located in the southern central region of Italy is calculated; than the ED process is represented as a network and, due to the identification of the bottleneck node, possibilities to reduce the LOS through changes to the actual process can be identified. The present work demonstrates that the LOS reductions obtained by process changes and measured by the analytical LOS calculations can be assessed also through the changes in the topological properties of the activities network, that are measured using complex network measures.
Journal: Int. J. of Operational Research
Pages: 337-361
Issue: 3
Volume: 36
Year: 2019
Keywords: network; emergency department; length of stay; LOS; overcrowding.
File-URL: http://www.inderscience.com/link.php?id=103122
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:3:p:337-361

Template-Type: ReDIF-Article 1.0
Author-Name: Akshay Kumar
Author-X-Name-First: Akshay
Author-X-Name-Last: Kumar
Author-Name: S.B. Singh
Author-X-Name-First: S.B.
Author-X-Name-Last: Singh
Author-Name: Mangey Ram
Author-X-Name-First: Mangey
Author-X-Name-Last: Ram
Title: Reliability appraisal for consecutive-<i>k</i>-out-of-<i>n</i>:F system of non-identical components with intuitionistic fuzzy set
Abstract:
In this paper, the reliability of a linear (circular) consecutive &lt;i&gt;k&lt;/i&gt;-out-of-&lt;i&gt;n&lt;/i&gt;: F system of non-identical elements have been obtained with the help of intuitionistic fuzzy concept and Weibull lifetime distribution. The calculation of parameters of the Weibull distribution is presented by intuitionistic triangular fuzzy numbers. The Markov chain technique is employed to compute the reliability of the transition state of the system. A numerical example is also illustrated for demonstrating the reliability of the system.
Journal: Int. J. of Operational Research
Pages: 362-374
Issue: 3
Volume: 36
Year: 2019
Keywords: linear (circular) (<i>k</i>&#44; <i>n</i>:F) system; reliability; Weibull distribution; intuitionistic fuzzy numbers.
File-URL: http://www.inderscience.com/link.php?id=103123
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:3:p:362-374

Template-Type: ReDIF-Article 1.0
Author-Name: Chompoonoot Kasemset
Author-X-Name-First: Chompoonoot
Author-X-Name-Last: Kasemset
Author-Name: Takashi Irohara
Author-X-Name-First: Takashi
Author-X-Name-Last: Irohara
Title: University course timetabling problem considering day and time pattern
Abstract:
This study aimed to propose a new formulation for the university course timetabling problem (UCTTP) when a day and time pattern is introduced. The day and time pattern would be set by the university and all assigned courses should follow this pattern. The different points of the proposed formulation would structure the model using starting and ending timeslots instead of a single timeslot to deal with courses with consecutiveness, periodic repeat, and multi-period sessions. To present the effectiveness of the proposed model, three test cases were solved and the results showed that the number of variables and constraints reduced with less computational time. Then, the case study was solved with multiple objectives based on goal programming (GP). The results of the case study show that the number of assignments during the undesirable time was minimised and that the total satisfaction score of all the lecturers was improved.
Journal: Int. J. of Operational Research
Pages: 375-398
Issue: 3
Volume: 36
Year: 2019
Keywords: university course timetabling; integer programming; goal programming; case study; day and time pattern.
File-URL: http://www.inderscience.com/link.php?id=103124
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:3:p:375-398

Template-Type: ReDIF-Article 1.0
Author-Name: Sahand Ashtab
Author-X-Name-First: Sahand
Author-X-Name-Last: Ashtab
Author-Name: Richard J. Caron
Author-X-Name-First: Richard J.
Author-X-Name-Last: Caron
Author-Name: Esaignani Selvarajah
Author-X-Name-First: Esaignani
Author-X-Name-Last: Selvarajah
Title: Increased flexibility in multi echelon multi capacitated supply chain network design
Abstract:
The multi echelon, multi capacitated supply chain network design challenge is to determine the numbers, locations and capacity levels of plants and warehouses; as well as the product flow from plants to warehouses and then from warehouses to customer zones in order to meet demand at minimum cost. Mathematical models for multi capacitated supply chain network design provide a finite set of capacity levels from which to choose; and include variables and constraints to ensure the selection of a single capacity level for each facility to be built. By eliminating the constraints that enforce a single capacity selection, we allow for the selection of several capacity levels for a single plant or warehouse. If such a selection occurs, the plant or warehouse is built with size equal to the sum of the selected capacity levels. This gives an exponential increase in the number of available capacity levels. The increased flexibility allows for less costly supply chain network designs. We present numerical results that demonstrate improved solutions, that is, lower cost supply chain network designs, with lower computational effort.
Journal: Int. J. of Operational Research
Pages: 399-412
Issue: 3
Volume: 36
Year: 2019
Keywords: facility planning and design; supply chain network design; facility location; mixed integer linear program; multi echelon; multi capacitated.
File-URL: http://www.inderscience.com/link.php?id=103125
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:3:p:399-412

Template-Type: ReDIF-Article 1.0
Author-Name: Carolyn-Dung Thi Thanh Tran
Author-X-Name-First: Carolyn-Dung Thi Thanh
Author-X-Name-Last: Tran
Author-Name: Renato A. Villano
Author-X-Name-First: Renato A.
Author-X-Name-Last: Villano
Title: Environmentally-adjusted efficiencies of Vietnamese higher education institutions: a multi-stage bootstrap DEA method
Abstract:
This paper analyses the operational efficiencies of Vietnamese higher education institutions (HEIs) after three decades of transition to the market-orientated economy. Using data from 112 universities and 141 colleges in the period 2011-2013, a new stage is proposed to integrate the bootstrap procedure into the environmentally-adjusted multi-stage DEA approach to measure the efficiencies of HEIs. The findings indicate that the efficiencies of HEIs are relatively low and are strongly affected by environmental variables, namely, ownership, location, age and financial capacity. Some managerial implications are discussed in improving the performance of HEIs.
Journal: Int. J. of Operational Research
Pages: 413-439
Issue: 3
Volume: 36
Year: 2019
Keywords: efficiency; data envelopment analysis; DEA; bootstrap; universities; colleges; Vietnam.
File-URL: http://www.inderscience.com/link.php?id=103126
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:3:p:413-439

Template-Type: ReDIF-Article 1.0
Author-Name: Mark Lewis
Author-X-Name-First: Mark
Author-X-Name-Last: Lewis
Author-Name: John Metcalfe
Author-X-Name-First: John
Author-X-Name-Last: Metcalfe
Author-Name: Gary Kochenberger
Author-X-Name-First: Gary
Author-X-Name-Last: Kochenberger
Title: Robust optimisation of unconstrained binary quadratic problems
Abstract:
In this paper we focus on the unconstrained binary quadratic optimisation model, maximise &lt;i&gt;x&lt;SUP align="right"&gt;&lt;SMALL&gt;t&lt;/SMALL&gt;&lt;/SUP&gt;Qx&lt;/i&gt;, x binary, and consider the problem of identifying optimal solutions that are robust with respect to perturbations in the Q matrix. We are motivated to find robust, or stable, solutions because of the uncertainty inherent in the big data origins of Q and limitations in computer numerical precision, particularly in a new class of quantum annealing computers. Experimental design techniques are used to generate a diverse subset of possible scenarios, from which robust solutions are identified. An illustrative example with practical application to business decision making is examined. The approach presented also generates a surface response equation which is used to estimate upper bounds in constant time for Q instantiations within the scenario extremes. In addition, a theoretical framework for the robustness of individual &lt;i&gt;x&lt;SUB align="right"&gt;&lt;SMALL&gt;i&lt;/SMALL&gt;&lt;/SUB&gt;&lt;/i&gt; variables is considered by examining the range of Q values over which the &lt;i&gt;x&lt;SUB align="right"&gt;&lt;SMALL&gt;i&lt;/SMALL&gt;&lt;/SUB&gt;&lt;/i&gt; are predetermined.
Journal: Int. J. of Operational Research
Pages: 441-454
Issue: 4
Volume: 36
Year: 2019
Keywords: robust optimisation; unconstrained binary quadratic problems; upper bounds; business decision making; scenario generation; experimental design; surface response equation; sensitivity analysis.
File-URL: http://www.inderscience.com/link.php?id=104050
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:4:p:441-454

Template-Type: ReDIF-Article 1.0
Author-Name: Sapan Kumar Das
Author-X-Name-First: Sapan Kumar
Author-X-Name-Last: Das
Author-Name: S.A. Edalatpanah
Author-X-Name-First: S.A.
Author-X-Name-Last: Edalatpanah
Author-Name: Tarni Mandal
Author-X-Name-First: Tarni
Author-X-Name-Last: Mandal
Title: A new method for solving linear fractional programming problem with absolute value functions
Abstract:
In this paper, we propose a new model for linear fractional programming problem with absolute value functions. The major contribution of this paper is that transformation of linear fractional programming problem into separate linear programming problems with some theorems and then solution of these problems by popular algorithm. This work also used to simplex type algorithms to arrive at an optimal solution for a linear programming problem with absolute value. Moreover, we compare this method with an existing method. Numerical experiments are also given to illustrate the assertions.
Journal: Int. J. of Operational Research
Pages: 455-466
Issue: 4
Volume: 36
Year: 2019
Keywords: fractional programming; computing science; absolute value; simplex method.
File-URL: http://www.inderscience.com/link.php?id=104051
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:4:p:455-466

Template-Type: ReDIF-Article 1.0
Author-Name: Paul K. Sugrue
Author-X-Name-First: Paul K.
Author-X-Name-Last: Sugrue
Title: A comprehensive merit aid allocation model
Abstract:
This paper highlights the development of a merit-based financial aid allocation model for a large private university incorporating both yield rate prediction and optimal fund distributions. The objective used in the optimal allocation is the average SAT score of the incoming class. In the application, the allocation decision is bound only by the financial aid budget and the number of accepted applicants in homogeneous SAT score groupings. Required yield rates are estimated utilising logistic regression with SAT score and merit aid award levels as the exogenous variables. The parameter estimates are based upon data from the previous year. Comparing the actual result with the model result shows a 17.3 point increase in the mean SAT score, which is shown as equivalent to a 20% increase in the merit aid budget.
Journal: Int. J. of Operational Research
Pages: 467-476
Issue: 4
Volume: 36
Year: 2019
Keywords: financial aid; yield rates; binary logistic regression; merit-based aid; linear programming.
File-URL: http://www.inderscience.com/link.php?id=104052
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:4:p:467-476

Template-Type: ReDIF-Article 1.0
Author-Name: Ram Kumar Dhurkari
Author-X-Name-First: Ram Kumar
Author-X-Name-Last: Dhurkari
Title: MCGL: a new reference dependent MCDM method
Abstract:
This paper proposes a method for discrete alternative multi-criteria decision making (MCDM) under certainty. The proposed method (multi-criteria gain loss: MCGL) is based upon the tenets of prospect theory and norm theory. The two major objectives for the development of the MCGL method are: 1) to reduce the complexity of the MCDM in order to improve the performance of the decision maker (DM) in the process of judgement; 2) to use some of the latest descriptive theories of decision making in order to improve the effectiveness of the MCDM method in terms of its resemblance with actual decisions. Two studies conducted to test the effectiveness of the proposed method in resembling actual or real decisions. In comparison to the analytic hierarchy process (AHP), the MCGL method is able to capture individual's decision-making process more accurately. Applicability measures like the number of decisions required, time and the cognitive burden strongly favours the MCGL method.
Journal: Int. J. of Operational Research
Pages: 477-495
Issue: 4
Volume: 36
Year: 2019
Keywords: multi-criteria decision making; MCDM; prospect theory; analytic hierarchy process; AHP.
File-URL: http://www.inderscience.com/link.php?id=104053
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:4:p:477-495

Template-Type: ReDIF-Article 1.0
Author-Name: Nitin Kumar Sakhala
Author-X-Name-First: Nitin Kumar
Author-X-Name-Last: Sakhala
Author-Name: Ajinkya Tanksale
Author-X-Name-First: Ajinkya
Author-X-Name-Last: Tanksale
Author-Name: J.K. Jha
Author-X-Name-First: J.K.
Author-X-Name-Last: Jha
Title: Path anticipation and prioritised conflict-free train rescheduling on a linear network
Abstract:
Rail schedule may get disturbed due to unforeseen set of events, which requires a quick response to plan a new feasible schedule under the given set of complicating constraints, and resolving the potential conflicts among trains. This gives rise to the classical train timetable rescheduling (TTR) problem, which is combinatorial in nature and computationally challenging. In this work, we present the macroscopic train orientation of TTR problem with explicit consideration of safety characteristics. In case of disturbances, path anticipation criteria are used to generate a feasible and conflict-free schedule. A novel algorithm based on inhibitor net to prioritising trains and conflict-resolution is presented. We demonstrate the application of a decision support system with the controller's intervention for the considered problem. Finally, the proposed solution approach is tested for its efficiency on several test instances generated for a real-life case of a single-track corridor in the Indian rail network.
Journal: Int. J. of Operational Research
Pages: 496-517
Issue: 4
Volume: 36
Year: 2019
Keywords: train rescheduling; disturbance handling; conflict-resolution; Petri net.
File-URL: http://www.inderscience.com/link.php?id=104054
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:4:p:496-517

Template-Type: ReDIF-Article 1.0
Author-Name: Renaud Chicoisne
Author-X-Name-First: Renaud
Author-X-Name-Last: Chicoisne
Author-Name: Fernando Ordóñez
Author-X-Name-First: Fernando
Author-X-Name-Last: Ordóñez
Author-Name: Daniel Espinoza
Author-X-Name-First: Daniel
Author-X-Name-Last: Espinoza
Title: Efficient algorithms to match GPS data on a map
Abstract:
Estimating the distribution of travel times on a transportation network from vehicle GPS data requires finding the closest path on the network to a trajectory of GPS points. In this work, we develop: 1) an efficient algorithm (MOE) to find such a path and able to detect the presence of cycles; 2) a faster but less accurate heuristic (MMH) unable to detect cycles. We present computational results that compare these algorithms, for different sampling rates and GPS sensitivities, using GPS trajectories of three networks: a grid graph and street networks of Santiago and Seattle. We show that MOE (MMH) returns in seconds (hundredths of second) paths where on average 93% (91%) of the edges are within a corridor of one metre from the real path.
Journal: Int. J. of Operational Research
Pages: 518-537
Issue: 4
Volume: 36
Year: 2019
Keywords: map matching; travel time estimation.
File-URL: http://www.inderscience.com/link.php?id=104055
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:4:p:518-537

Template-Type: ReDIF-Article 1.0
Author-Name: Claudia Paciarotti
Author-X-Name-First: Claudia
Author-X-Name-Last: Paciarotti
Author-Name: Maurizio Bevilacqua
Author-X-Name-First: Maurizio
Author-X-Name-Last: Bevilacqua
Author-Name: Filippo Emanuele Ciarapica
Author-X-Name-First: Filippo Emanuele
Author-X-Name-Last: Ciarapica
Author-Name: Giovanni Mazzuto
Author-X-Name-First: Giovanni
Author-X-Name-Last: Mazzuto
Author-Name: Leonardo Postacchini
Author-X-Name-First: Leonardo
Author-X-Name-Last: Postacchini
Title: An efficiency analysis of food distribution system through data envelopment analysis
Abstract:
The specific quality and safety requirements, typical of the food supply chain, force to strong action on implementing distribution networks, reducing transport and delivery costs, improving distribution efficiency and performance, increasing carriers control and flexibility. In this context, the selection and evaluation of third-party logistics has become a crucial aspect in order to realise an efficient food products distribution, with both a high level of service and competitive costs. This paper implements data envelopment analysis theory to analyse the case of an Italian food producer, which distributes its products on the national territory, through several third-party logistic carriers. This study made possible to define the most efficient carrier among those responsible for the distribution process, analysing the retail trade and large-scale retail trade. This paper represents a reference guideline to all the food companies involved in the process of evaluation and improvement of the distribution process.
Journal: Int. J. of Operational Research
Pages: 538-554
Issue: 4
Volume: 36
Year: 2019
Keywords: data envelopment analysis; DEA; efficiency measurement; food supply chain; supply chain performance; third-party logistics; food deliveries evaluation; transport logistics; logistics performance; decision-making units; DMUs; carriers ranking; carriers selection; transport of perishable products.
File-URL: http://www.inderscience.com/link.php?id=104056
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:4:p:538-554

Template-Type: ReDIF-Article 1.0
Author-Name: Michael T. Todinov
Author-X-Name-First: Michael T.
Author-X-Name-Last: Todinov
Title: Closed parasitic flow loops and dominated loops in networks
Abstract:
The paper raises awareness of the presence of highly undesirable closed parasitic flow loops in the solutions of published algorithms for maximising the throughput flow in networks. Parasitic flow loops increase the cost of transportation of the flow unnecessarily, consume residual capacity from the edges of the network, increase the likelihood of deterioration of perishable products, increase congestion and energy wastage. By using the presented theoretical framework, it is demonstrated that the probability of existence of closed and dominated flow loops in networks is surprisingly high. The paper also demonstrates that the successive shortest path strategy fails to minimise the total length of transportation routes from multiple interchangeable origins to destinations. By using the developed theoretical framework, it is shown that a minimum total length of the transportation routes in a network with multiple interchangeable origins is attained if and only if no closed parasitic flow loops and dominated flow loops exist in the network.
Journal: Int. J. of Operational Research
Pages: 555-590
Issue: 4
Volume: 36
Year: 2019
Keywords: parasitic flow loops; routing loops; dominated flow loops; maximum throughput flow; successive shortest paths; interchangeable origins; multiple destinations.
File-URL: http://www.inderscience.com/link.php?id=104057
File-Format: text/html
File-Restriction: Access to full text is restricted to subscribers.
Handle: RePEc:ids:ijores:v:36:y:2019:i:4:p:555-590