The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This study aims to optimize the number of nodes and arcs in a constructed network employing a given criteria. For this, we subject the constructed network using the methods like Shortest Path (SP), Critical Path (CP) and Max-Flow (MF) between any pair of nodes. A set of iterative algorithms have been generated using matrix operations to meet the above requirement, which is named as Pandit’s algorithm...
We consider a few types of heuristics, namely, add-drop-interchange, Lagrangean relaxation-based and random rounding heuristics for the capacitated facility location problem. Some instances of the problem are constructed and performance, with respect to such instances, of the heuristics is studied. It is observed that, performance of the heuristics is often not satisfactory. The instances presented...
The goal of this article is to develop an optimization technique based on the splitting criterion of search region into several equal and disjoint subregions for solving the constrained optimization problems by finite interval arithmetic and interval order relations in the context of a decision maker’s point of view. This method has been applied for solving some benchmark test problems taken from...
Aggregation of constraints in a mathematical programming model is the process of replacing a set of constraints in the model by a single new constraint obtained from a combination of constraints in the set. It is generally believed that if such an aggregation step can be carried out without changing the set of feasible solutions of the problem, then it is highly desirable as it reduces the number...
This paper presents two approaches for solving both the minimax and minisum location problems and as well as a bi-objective location problem. The bi-objective location problem is a combination of both minimax and minisum location problems with recti-linear distances and randomly distributed destinations. Wesolowsky. G.O. [Journal of Regional Science 18: 53–60, 1977] has considered the stochastic extension...
In this paper, we consider a single server Markovian queueing system with a finite buffer. In addition to a Poisson stream of positive arrivals we assume that there is a also a Poisson stream of negative arrivals into the system. These negative arrivals which may be called as catastrophes may occur at any instant of time, whether the server is idle or busy. The time dependent performance measures...
The paper deals with the uncapacitated minimum cost flow problems subject to additional flow constraints whether or not the sum of node capacities is zero. This is a generalization and extension of transportation problems with restrictions on total flow value. The relationship between the desired flow value and the sum of node capacities of source(s) and sink(s) gives rise to the different set of...
This paper develops multi-item Economic Order Quantity (EOQ) inventory models for breakable units with stock and selling price dependent demand under imprecise space and budget constraints with two storage facilities. There are one rented warehouse called own warehouse (OW) at the market place and another rented warehouse (RW) at a little distance away from the market place. The sale is conducted...
The present paper discusses a multiobjective integer nonlinear fractional programming problem based on cutting plane technique. The methodology discussed is such that it finds all the nondominated t-tuples of the multiobjective nonlinear fractional programming problem by exploiting the quasimonotone character of the nonlinear fractional functions involved. The cut discussed in the present paper scans...
Canonical correlation analysis seeks to identify and quantify the associations between two sets of variables. Harold Hotelling, who initially developed the technique, provided the example of relating arithmetic speed and arithmetic power to reading speed and reading power. Relating governmental policy variables with economic goal variables and relating college performance variables with precollege...
This paper proposes a new approach to allow the voters to express their preferences on a set of candidates in ranked voting systems. This approach assumes that the votes of all voters have not equal importance and there is a priority among voters. Here, voters are classified into several groups in terms of their priorities that the vote of a higher category has a greater important than that of lower...
Increasing global usage of containerised cargo in maritime trade imposes heavy traffic on both of the quayside and landside marine container terminals. Untangling this problem, terminal operators have to choose the most efficient operating system in their terminals. This study analyses the concept of Multiple Attribute Decision Making (MADM) for selecting the most efficient yard gantry crane in marine...
In this paper we study a deterministic inventory model with shortages, where only a fraction of the unmet demand is backlogged, and the inventory manager offers a discount on it. Conditions of permissible delay in payments are also taken into account. Numerical examples are cited to illustrate the model.
The exploration–exploitation dilemma has been an unresolved issue within the framework of multi-agent reinforcement learning. The agents have to explore in order to improve the state which potentially yields higher rewards in the future or exploit the state that yields the highest reward based on the existing knowledge. Pure exploration degrades the agent’s learning but increases the flexibility of...
In this paper, we propose a two-stage stochastic linear programming problem considering some of the left hand side and right hand side of linear constraints parameters as interval discrete random variables with known probability distribution and rest of the parameters are precisely known. Both the randomness and discrete intervals are simultaneously considered for the model parameters. Further, the...
In this paper the “Generalized Time-dependent Travelling Salesman Problem” is a three dimensional travelling salesman problem where the cost matrix C (i, j, k) is the cost of the salesman visiting from city i to city j at time (facility) k. The cost matrix C(i,j,k) [i,j = 1,2,3,…..,n;k = 1,2,3,…..,m] is given. There are n cities and N = {1, 2, 3,…, n}. We are given a partition of cities into groups...
Conventional genetic algorithms suffer from a dependence on the initial generation used by the algorithm. In case the generation consists of solutions which are not close enough to a global optimum but some of which are close to a relatively good local optimum, the algorithm is often guided to converge to the local optimum. In this paper, we provide a method which allows a genetic algorithm to search...
In this paper, a multi-period optimal production control problem with variable preparation time is formulated and solved. Here, the rate of production is assumed to be a function of time and considered as a control variable. Also the demand is linearly stock dependent. Defective rate is taken in four forms namely constant, fuzzy, random and fuzzy-random. The presented preparation time is assumed to...
A product life cycle is the life span of a product which the period begins with initial product specification and ends with the withdrawal from the market of both the product and its support. A product life cycle can be divided into several stages characterized by the revenue generated by the product. The purpose of this paper is to investigate the optimal production lot size and total cost during...
A product life cycle is the life span of a product which the period begins with initial product specification and ends with the withdrawal from the market of both the product and its support. A product life cycle can be divided into several stages characterized by the revenue generated by the product. This paper deals with an inventory model for Product Life Cycle with defective items for single manufacturing...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.