3. Transportation Problem (Part 1)
|
|
- Allan Chandler
- 6 years ago
- Views:
Transcription
1 3 Transportation Problem (Part 1) 31 Introduction to Transportation Problem 32 Mathematical Formulation and Tabular Representation 33 Some Basic Definitions 34 Transportation Algorithm 35 Methods for Initial Basic Feasible Solution 1 North-West Corner Rule 2 Lowest Cost Method 3 Vogel s Approximation Method 31 Introduction to Transportation Problem The transportation problem deals with the distribution of goods from several points of supply (sources) to a number of points of demand (destinations) Usually we are given the capacity (availability) of goods at each source and the requirements (demands) at each destination Typically the objective is to minimize total transportation and production costs The availability as well as the requirements is finite It is assumed that the cost of transportation is linear 32 Mathematical Formulation and Tabular Representation Let m denote number of supply centre (S1, S2 Sm) Let n denote number of demand centre (D1, D2 Dn) D S D1 D2 Dn Capacities (Availability) S1 c11 x11 c12 x12 c1n x1n a1 S2 c21 x21 c22 x22 c2n x2n a2 Sm Requirement (Demand) cm1 xm1 cm2 xm2 cmn xmn am b1 b2 bn Σai = Σbj wwwbeinggouravcom
2 The product cij xij gives the net cost of transporting units from the supply centre Si to demand centre Dj, where i = 1,2,m and j = 1,2,n Let ai = number of units available at i th source (supply centre) of a certain product Let bj = number of units demanded at j th destination (demand centre) of a certain product Let cij be the cost of transporting one unit from i th source to j th destination Let xij be the amount to be transported from i th source to j th destination The problem now, is to determine non-negative allocation xij satisfying both the availability constraints and minimize cost of transportation Min Z = c11x11 + c12x12 + +c1nx1n subject to + c21x21 + c22x22 + +c2nx2n + +cm1xm1 + cm2xm2 + +cmnxmn x11 + x12 + +x1n = a1 x21 + x22 + +x2n = a2 supply constraints xm1 + xm2 + +xmn = am x11 + x21 + +xm1 = b1 x12 + x22 + +xm2 = b2 demand constraints x1n + x2n + +xmn = bn We assumed that the total availabilities Σai satisfy the total requirements Σbj ie Σai = Σbj (i = 1, 2, 3 m and j = 1, 2, 3 n) Transportation Problem is special type of LPP wwwbeinggouravcom
3 33 Some Basic Definitions Balanced Transportation Problem If Total supply equals to total demand, the problem is said to be a balanced transportation problem ie Σai = Σbj (i = 1, 2, 3 m and j = 1, 2, 3 n) Unbalanced Transportation Problem If Total supply not equals to total demand, the problem is said to be an unbalanced transportation problem ie Σai Σbj (i = 1, 2, 3 m and j = 1, 2, 3 n) Occupied and Unoccupied Cell The positive allocated cell in the transportation table is called occupied cells, otherwise empty or unoccupied cell Feasible Solution A set of non-negative allocations xij 0 which satisfies the supply and demand limitations is called feasible solution to a transportation problem Basic Feasible Solution A feasible solution called basic if the number of positive allocations xij = m+n-1, where m = number of supply centre and n = number of demand centre If the number of positive allocations is less than m+n-1 then it is called as Degenerate Basic Feasible Solution If the number of positive allocations xij = m+n-1 and in independent position then it is called as Non - Degenerate Basic Feasible Solution Optimum Solution A feasible solution which minimizes the total transportation cost is called optimal solution 34 Transportation Algorithm 1 Check the problem is balanced or not If not balanced then make it balanced by adding either dummy row or dummy column as required wwwbeinggouravcom
4 2 Find Initial basic Feasible Solution (IBFS) by North-West Corner Rule (NWCR), Lowest Cost Method (LCM), Vogel s Approximation Method (VAM) 3 The initial solution obtained by any of the three methods must be feasible and non- degenerate(see definition above) 4 Test initial solution for optimality (here we discuss Modified Distribution method (MODI) to test optimality) 35 Methods for finding Initial Basic Feasible Solution(IBFS) IMPORTANT NOTE: For finding IBFS, first check Transportation Problem is balanced or not Here we shall discuss only three different methods to obtain the initial basic feasible solution They are 1 North-West Corner Rule (NWCR) This method advocates that allocation should be made on the basis of geographical location of the cells in the table In particular, the method attaches greater importance to the cell situated at the upper left hand corner of the table and makes as much as possible an allocation to the cell with both the supply restriction and demand constraint taking into consideration The algorithm for North-West Corner Rule is: Start allocation from upper left hand corner of the table (Adjust supply and demand accordingly) Exhaust the supply (source) capacity at each row before moving down to the next row Exhaust the demand (destination) requirements of each column before moving to the right of the next column Continue in the same manner until all supply has been exhausted and demand requirements have been met Find the initial basic feasible solution by NWCR Warehouse Factory W 1 W 2 W 3 W 4 Capacity F F F Requirement wwwbeinggouravcom
5 Initial basic feasible solution by using NWCR wwwbeinggouravcom
6 2 Least cost Method (LCM) This method advocates that allocation should be based on minimum cost of transportation It says that the First allocation must be made to the cell with the most minimum (least) cost of transportation per unit In other words, we look at the scheduled of the transport cell and identify the most minimum After identifying the cell with the least transportation cost, we next make maximum allocation to the cell without violating both supply and demand restriction Repeat above steps until all supply and demand are satisfied In case of tie among minimum cost, select the cell for allocation where maximum unit can be allocated Find the initial basic feasible solution by LCM (Least Cost Method) Warehouse Factory F F F Requirement W1 W2 W3 W4 Capacity wwwbeinggouravcom
7 Initial basic feasible solution by using Least Cost Method wwwbeinggouravcom
8 3 Vogel s Approximation Method (VAM) The Vogel s Approximation Method takes into account not only the least cost cij but also the cost that just exceeds cij The IBFS obtained by Vogel s method is either optimal or very close to the optimal solutions The steps of the method are given below Compute difference between the smallest and second smallest costs in each row and column These differences are called penalties or opportunity cost Identify the row or column with the largest difference among all the rows and columns Check the row or column with the largest difference and select minimum cost cell and allocate as much as possible to these cell Adjust the supply and demand constraints Again compute difference between the smallest and second smallest costs in each row and column of reduced transportation table and do the same as above until all the supply and demand constraints are satisfied If there is a tie among maximum difference then select row or column for allocation in which total cost is minimum And if there is tie among minimum total cost then select any row or column arbitrary Find the initial basic feasible solution by VAM (Vogel s method) Warehouse Factory F F F Requirement W1 W2 W3 W4 Capacity wwwbeinggouravcom
9 Initial basic feasible solution by using Vogel s Approximation Method wwwbeinggouravcom
Transportation Problems
C H A P T E R 11 Transportation Problems Learning Objectives: Understanding the feature of Assignment Problems. Formulate an Assignment problem. Hungarian Method Unbalanced Assignment Problems Profit Maximization
More informationStatistical Investigation of Various Methods to Find the Initial Basic Feasible Solution of a Transportation Problem
Statistical Investigation of Various Methods to Find the Initial Basic Feasible Solution of a Transportation Problem Ravi Kumar R 1, Radha Gupta 2, Karthiyayini.O 3 1,2,3 PESIT-Bangalore South Campus,
More informationTRANSPORTATION PROBLEM AND VARIANTS
TRANSPORTATION PROBLEM AND VARIANTS Introduction to Lecture T: Welcome to the next exercise. I hope you enjoyed the previous exercise. S: Sure I did. It is good to learn new concepts. I am beginning to
More informationDEA Model: A Key Technology for the Future
International Journal of Engineering Science Invention ISSN (Online): 2319 6734, ISSN (Print): 2319 6726 Volume 5 Issue 12 December 2016 PP. 30-33 DEA Model: A Key Technology for the Future Seema Shokeen
More informationTransportation problem
Transportation problem Operations research (OR) are concerned with scientifically deciding how to best design and operate people machine systems, usually under conditions requiring the allocation of scarce
More informationThe Study of Using LP to Solve Flower Transport Problem
The Study of Using LP to Solve Flower Transport Problem 1 Chung-Hsin Liu, 2 Le Le Trung 1 Department of Computer Science & Information Engineering, Chinese Culture University, Taiwan, R.O.C. liu3.gold@msa.hinet.net
More informationOptimal Solution of Transportation Problem Based on Revised Distribution Method
Optimal Solution of Transportation Problem Based on Revised Distribution Method Bindu Choudhary Department of Mathematics & Statistics, Christian Eminent College, Indore, India ABSTRACT: Transportation
More informationISE 204 OR II. Chapter 8 The Transportation and Assignment Problems. Asst. Prof. Dr. Deniz TÜRSEL ELİİYİ
ISE 204 OR II Chapter 8 The Transportation and Assignment Problems Asst. Prof. Dr. Deniz TÜRSEL ELİİYİ 1 The Transportation and Assignment Problems Transportation Problems: A special class of Linear Programming
More informationCHAPTER 4 A NEW ALTERNATE METHOD OF TRANS-SHIPMENT PROBLEM
56 CHAPTER 4 A NEW ALTERNATE METHOD OF TRANS-SHIPMENT PROBLEM 4.1 Introduction In a transportation problem shipment of commodity takes place among sources and destinations. But instead of direct shipments
More informationInternational Journal of Mathematics Trends and Technology (IJMTT) Volume 44 Number 4 April 2017
Solving Transportation Problem by Various Methods and Their Comaprison Dr. Shraddha Mishra Professor and Head Lakhmi Naraian College of Technology, Indore, RGPV BHOPAL Abstract: The most important and
More informationA comparative study of ASM and NWCR method in transportation problem
Malaya J. Mat. 5(2)(2017) 321 327 A comparative study of ASM and NWCR method in transportation problem B. Satheesh Kumar a, *, R. Nandhini b and T. Nanthini c a,b,c Department of Mathematics, Dr. N. G.
More informationModel Question Paper with Solution
Annexure P Model Question Paper with Solution Section A (Very Short Answer Questions) Q.1. Write down three differences between PERT and CPM in brief? Ans.1. The Program Evaluation and Review Technique
More informationA Study on North East Corner Method in Transportation Problem of Operations Research and using of Object Oriented Programming Model
Intern. J. Fuzzy Mathematical Archive Vol. 14, No. 1, 2017, 35-40 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 11 December 2017 www.researchmathsci.org DOI: http://dx.doi.org/10.22457/ijfma.v14n1a5
More informationThe Transportation and Assignment Problems. Hillier &Lieberman Chapter 8
The Transportation and Assignment Problems Hillier &Lieberman Chapter 8 The Transportation and Assignment Problems Two important special types of linear programming problems The transportation problem
More informationTRANSPORTATION MODEL IN DELIVERY GOODS USING RAILWAY SYSTEMS
TRANSPORTATION MODEL IN DELIVERY GOODS USING RAILWAY SYSTEMS Fauziah Ab Rahman Malaysian Institute of Marine Engineering Technology Universiti Kuala Lumpur Lumut, Perak, Malaysia fauziahabra@unikl.edu.my
More informationWEIGHTED COST OPPORTUNITY BASED ALGORITHM FOR INITIAL BASIC FEASIBLE SOLUTION: A NEW APPROACH IN TRANSPORTATION PROBLEM
Journal of Engineering Science 08(1), 2017, 63-70 JES an international Journal WEIGHTED COST OPPORTUNITY BASED ALGORITHM FOR INITIAL BASIC FEASIBLE SOLUTION: A NEW APPROACH IN TRANSPORTATION PROBLEM A.R.M.
More informationOperation and supply chain management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras
Operation and supply chain management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Lecture - 37 Transportation and Distribution Models In this lecture, we
More informationAn Alternative Method to Find Initial Basic Feasible Solution of a Transportation Problem
Annals of Pure and Applied Mathematics Vol., No. 2, 2, 3-9 ISSN: 2279-087X (P), 2279-0888(online) Published on 6 November 2 www.researchmathsci.org Annals of An Alternative Method to Find Initial Basic
More informationEffect of Transportation Model on Organizational Performance: A Case Study of MTN Nigeria, Asaba, Delta State, Nigeria
International Journal of Innovative Social Sciences & Humanities Research 6(2):76-82, April-June, 2018 SEAHI PUBLICATIONS, 2018 www.seahipaj.org ISSN: 2354-2926 Effect of Transportation Model on Organizational
More informationUniversity Question Paper Two Marks
University Question Paper Two Marks 1. List the application of Operations Research in functional areas of management. Answer: Finance, Budgeting and Investment Marketing Physical distribution Purchasing,
More informationApplication of Transportation Linear Programming Algorithms to Cost Reduction in Nigeria Soft Drinks Industry
Application of Transportation Linear Programming Algorithms to Cost Reduction in Nigeria Soft Drinks Industry A. O. Salami Abstract The transportation problems are primarily concerned with the optimal
More informationKeywords: Transportation problem; initial solution; distribution; algorithm; VAM, LC, NWC
American International Journal of Research in Science, Technology, Engineering & Mathematics Available online at http://www.iasir.net ISSN (Print): 2328-3491, ISSN (Online): 2328-3580, ISSN (CD-ROM): 2328-3629
More informationVAM - MODI Mathematical Modelling Method for Minimizing Cost of Transporting Perishables from Markets to Cafeterias in Covenant University
Washington C, USA, Septe IEOM Society Internationalmber 7-9, 18 VAM - MOI Mathematical Modelling Method for Minimizing Cost of Transporting Perishables from Markets to Cafeterias in Covenant University
More informationThe Transportation and Assignment Problems. Chapter 9: Hillier and Lieberman Chapter 7: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course
The Transportation and Assignment Problems Chapter 9: Hillier and Lieberman Chapter 7: Decision Tools for Agribusiness Dr. Hurley s AGB 328 Course Terms to Know Sources Destinations Supply Demand The Requirements
More informationAn Alternate Method to Matrix Minima Method of Solving Transportation Problem
Volume 117 No. 1 017, 489-495 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu An Alternate Method to Matrix Minima Method of Solving Transportation
More informationTransportation Theory and Applications
Fall 2017 - MTAT.08.043 Transportation Theory and Applications Lecture I: Introduction A. Hadachi Course Syllabus Lecturer: Amnir Hadachi Course website: https://courses.cs.ut.ee/2017/transport/fall Office
More informationSOMANI S Approximation Method(SAM) Innovative Method for finding optimal Transportation Cost. Abstract
SOMANI S Approximation Method(SAM) Innovative Method for finding optimal Transportation Cost CHIRAG SOMANI* Asst. Prof. in Mathematics Department of Applied Science & Humanities, Engineering College, Tuwa,
More informationOn the Optimization of Transportation Problem
British Journal of Mathematics & Computer Science 13(4): 1-11, 2016, Article no.bjmcs.17279 ISSN: 2231-0851 SCIENCEDOMAIN international www.sciencedomain.org On the Optimization of Transportation Problem
More informationA New Technique for Solving Transportation Problems by Using Decomposition-Based Pricing and its Implementation in Real Life
Dhaka Univ. J. Sci. 64(1): 45-50, 2016 (January) A New Technique for Solving Transportation Problems by Using Decomposition-Based Pricing and its Implementation in Real Life Sajal Chakroborty and M. Babul
More informationInternational Journal of Advance Engineering and Research Development
Scientific Journal of Impact Factor (SJIF): 4.72 International Journal of Advance Engineering and Research Development Volume 4, Issue 4, April -2017 Cost Saving in Transportation of Various Construction
More informationMixed Constraint Fuzzy Transshipment Problem
Applied Mathematical Sciences, Vol. 6, 2012, no. 48, 2385-2394 Mixed Constraint Fuzzy Transshipment Problem A. Nagoor Gani PG & Research Department of Mathematics Jamal Mohamed College (Autonomous) Tiruchirappalli-620020,
More informationAssignment Technique for solving Transportation Problem A Case Study
Assignment Technique for solving Transportation Problem A Case Study N. Santosh Ranganath Faculty Member, Department of Commerce and Management Studies Dr. B. R. Ambedkar University, Srikakulam, Andhra
More informationTRANSPORTATION PROBLEM FOR OPTIMALITY
Asia Pacific Journal of Research Vol: I. Issue XXXIV, December 01 ISSN: 0-04, E-ISSN-4-49 TRANSPORTATION PROBLEM FOR OPTIMALITY Mrs. M.Vijaya Lakshmi 1 & Mr. V. Hareeswarudu 1& Assistant Professor, Department
More informationUNIT 7 TRANSPORTATION PROBLEM
UNIT 7 TRNSPORTTION PROLEM Structure 7.1 Introduction Objectives 2 asic Feasible Solution of a Transportation Problem 7. Modified Distribution (MODI) Method 7.4 Stepping Stone Method 7.5 Unbalanced Transportation
More informationSYLLABUS Class: - B.B.A. IV Semester. Subject: - Operations Research
SYLLABUS Class: - B.B.A. IV Semester Subject: - Operations Research UNIT I Definition of operations research, models of operations research, scientific methodology of operations research, scope of operations
More informationBalancing a transportation problem: Is it really that simple?
Original Article Balancing a transportation problem: Is it really that simple? Francis J. Vasko a, * and Nelya Storozhyshina b a Mathematics Department, Kutztown University, Kutztown, Pennsylvania 19530,
More informationISSN: Int. J. Adv. Res. 6(1), RESEARCH ARTICLE...
Journal Homepage: - www.journalijar.com Article DOI: 10.21474/IJAR01/6381 DOI URL: http://dx.doi.org/10.21474/ijar01/6381 RESEARCH ARTICLE APPROIMATION VOGELS EFFECTIVENESS METHOD (VAM) MINIMIZE COST OF
More informationTransshipment. Chapter 493. Introduction. Data Structure. Example Model
Chapter 493 Introduction The transshipment model is a special case of the minimum cost capacitated flow model in which there are no capacities or minimums on the arc flows. The transshipment model is similar
More informationThe Transportation Problem
The Transportation Problem Stages in solving transportation problems Steps for Stage 1 (IBFS) 1) If problem is not balanced, introduce dummy row/column to balance it. [Note: Balancing means ensuring that
More informationSCHOOL OF BUSINESS, ECONOMICS AND MANAGEMENT. BF360 Operations Research
SCHOOL OF BUSINESS, ECONOMICS AND MANAGEMENT Unit 4 Distribution and Network Models Moses Mwale e-mail: moses.mwale@ictar.ac.zm Contents Unit 4. Distribution and Network Models 3 4.1.0 The Transportation
More informationA Minimum Spanning Tree Approach of Solving a Transportation Problem
International Journal of Mathematics and Statistics Invention (IJMSI) E-ISSN: 2321 4767 P-ISSN: 2321-4759 Volume 5 Issue 3 March. 2017 PP-09-18 A Minimum Spanning Tree Approach of Solving a Transportation
More informationCIS QA LEVEL 2 WEEK 5 TOPIC: LINEAR PROGRAMMING OBJECTIVE AND SHORT ANSWER QUESTIONS
CIS QA LEVEL 2 WEEK 5 TOPIC: LINEAR PROGRAMMING OBJECTIVE AND SHORT ANSWER QUESTIONS 1. In the graphical method of solving a Linear Programming problem, the feasible region is the region containing A.
More informationOPERATIONS RESEARCH TWO MARKS QUESTIONS AND ANSWERS
OPERATIONS RESEARCH TWO MARKS QUESTIONS AND ANSWERS 1.when does degenaracy happen in transportation problem? In transportation problem with m orgins and n destinations, if a IBFS has less than m+n-1 allocations,
More informationUsing Transportation Model for Aggregate Planning: A Case Study in Soft Drinks Industry
Journal of Logistics Management 218, 7(1): 11-46 DI: 1.5923/j.logistics.21871.2 Using Transportation Model for Aggregate Planning: A Case Study in Soft Drinks Industry Suhada. Tayyeh *, Saffa J. Abdul-Hussien
More informationA Heuristic on Risk Management System in Goods Transportation Model Using Multi-Optimality by MODI Method
Open Journal of Applied Sciences, 16, 6, -1 Published Online August 16 in SciRes. http://www.scirp.org/journal/ojapps http://dx.doi.org/.26/ojapps.16.6 A Heuristic on Risk Management System in Goods Transportation
More informationA New Simple Method of Finding an Optimal Solution for the Transportation Problem
www.emr.net ISSN (ONLINE): 5-758, ISSN (PRINT): 9-9 Volume-, Issue-, November-December 1 International Journal of Engineering and Management Research Page Number: 19- A New Simple Method of Finding an
More informationTransportation Problem
Transportation Problem MIGUEL A. S. CASQUILHO Technical University of Lisbon, Ave. Rovisco Pais, 1049-001 Lisboa, Portugal The Transportation Problem is briefly presented, together with other problems
More information2. Solve the following LPP by Graphical method
DHANALAKSHMI SRINIVASAN ENGINEERING COLLEGE PERAMBALUR DEPARTMENT OF SCIENCE AND HUMANITIES QUESTION BANK BA6122 OPERATIONS RESEARCH UNIT-I LINEAR PROGRAMMING MODELS PART-A 1. What is operations research?
More informationTRANSPORTATION COST MINIMIZATION OF A MANUFACTURING FIRM USING GENETIC ALGORITHM APPROACH
Nigerian Journal of Technology (NIJOTECH) Vol. 35, No. 4, October 2016, pp. 866 873 Copyright Faculty of Engineering, University of Nigeria, Nsukka, Print ISSN: 0331-8443, Electronic ISSN: 2467-8821 www.nijotech.com
More informationOPERATIONS RESEARCH Code: MB0048. Section-A
Time: 2 hours OPERATIONS RESEARCH Code: MB0048 Max.Marks:140 Section-A Answer the following 1. Which of the following is an example of a mathematical model? a. Iconic model b. Replacement model c. Analogue
More informationTransportation Logistics Part I and II
Transportation Logistics Part I and II Exercise Let G = (V,E) denote a graph consisting of vertices V = {,2,3,4,5,6,,8} and arcs A = {(,2),(,3),(2,4),(3,2),(4,3),(4,5),(4,6),(5,3),(5,),(6,8),(,4),(,6),(,8)}.
More informationA Modified Transhipment Algorithm For Trucking
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Transactions of the Nebraska Academy of Sciences and Affiliated Societies Nebraska Academy of Sciences 1973 A Modified Transhipment
More informationDETERMINE THE OPTIMAL SOLUTION USING VOGEL S APPROXIMATION METHOD
VOL, NO, JUNE ISSN 9-66 6- Asian Research Publishing Network (ARPN) All rights reserved wwwarpnjournalscom DETERMINE THE OPTIMAL SOLUTION USING VOGEL S APPROXIMATION METHOD Sufian M S Al-Dulaymi College
More informationDigital Media Mix Optimization Model: A Case Study of a Digital Agency promoting its E-Training Services
Available online at: http://euroasiapub.org, pp. 127~137 Thomson Reuters Researcher ID: L-5236-2015 Digital Media Mix Optimization Model: A Case Study of a Digital Agency promoting its E-Training Services
More informationINDIAN INSTITUTE OF MATERIALS MANAGEMENT Post Graduate Diploma in Materials Management PAPER 18 C OPERATIONS RESEARCH.
INDIAN INSTITUTE OF MATERIALS MANAGEMENT Post Graduate Diploma in Materials Management PAPER 18 C OPERATIONS RESEARCH. Dec 2014 DATE: 20.12.2014 Max. Marks: 100 TIME: 2.00 p.m to 5.00 p.m. Duration: 03
More informationSequencing Problem. Dr.S.S.Kulkarni
Sequencing Problem The selection of an appropriate order for a series of jobs to be done on a finite number of service facilities, in some preassigned order, is called sequencing. The general sequencing
More informationOptimal Solution of OFSTF, MDMA Methods with Existing Methods Comparison
Volume 119 No. 10 2018, 989-1000 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Optimal Solution of OFSTF, MDMA Methods with Existing Methods Comparison
More informationQute: Quality-of-Monitoring Aware Sensing and Routing Strategy in Wireless Sensor Networks S H A O J I E T A N G T E M P L E U N I V E R S I T Y
Qute: Quality-of-Monitoring Aware Sensing and Routing Strategy in Wireless Sensor Networks S H A O J I E T A N G J I E WU T E M P L E U N I V E R S I T Y Examples of WSNs Wireless Sensor Networks (WSNs)
More informationCHAPTER 5 EMISSION AND ECONOMIC DISPATCH PROBLEMS
108 CHAPTER 5 EMISSION AND ECONOMIC DISPATCH PROBLEMS 5.1 INTRODUCTION The operation and planning of a power system is characterized by having to maintain a high degree of economy and reliability. Among
More informationComparison of Statistical Packages in Solving Transportation Problems
ISSN No. 976-5697 Volume 4, No. 1, Sep-Oct 213 International Journal of Advanced Research in Computer Science RESEARCH PAPER Available Online at www.ijarcs.info Comparison of Statistical Packages in Solving
More informationLinear Programming Applications. Structural & Water Resources Problems
Linear Programming Applications Structural & Water Resources Problems 1 Introduction LP has been applied to formulate and solve several types of problems in engineering field LP finds many applications
More informationDiscrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle
European Journal of Operational Research 174 (2006) 1329 1337 Short Communication Discrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle Yossi Bukchin a, *, Subhash
More informationSolving Transportation Logistics Problems Using Advanced Evolutionary Optimization
Solving Transportation Logistics Problems Using Advanced Evolutionary Optimization Transportation logistics problems and many analogous problems are usually too complicated and difficult for standard Linear
More informationCHAPTER II SEQUENCING MODELS
CHAPTER II SEQUENCING MODELS The basic models in scheduling due to Johnson (1957) and owing to Maggu & Das (1977) T.P. Singh (1985, 86, 2005, 2006) are explained one by one which form a basis of scheduling
More informationBasic Linear Programming Concepts. Lecture 2 (3/29/2017)
Basic Linear Programming Concepts Lecture 2 (3/29/2017) Definition Linear Programming (LP) is a mathematical method to allocate scarce resources to competing activities in an optimal manner when the problem
More informationApplied Data Analysis (Operations Research)
Applied Data Analysis (Operations Research) Pongsa Pornchaiwiseskul Pongsa.P@chula.ac.th http://j.mp/pongsa Faculty of Economics Chulalongkorn University Pongsa Pornchaiwiseskul, Faculty of Economics,
More informationSolving Transportation Problems With Mixed Constraints
We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with solving transportation
More informationMBF1413 Quantitative Methods
MBF1413 Quantitative Methods Prepared by Dr Khairul Anuar 9: Introduction to Linear Programming www.notes638.wordpress.com Content 1. Introduction 2. A Simple Maximization Problem 2 1. Introduction Linear
More informationSections 4.5 and 4.6 Notes
Sections 4.5 and 4.6 Notes Transportation Problem: Delivering Bread A supermarket chain gets bread deliveries from a bakery chain that does its baking in different places. Each supermarket store needs
More informationLogistic and production models (contd..)
g) Multiple plants Logistic and production models (contd..) In this section it is assumed that a manufacturing company has a network of M production plants, located in geographically distinct sites that
More informationMath 111 Group Activity: Change and Average Change. 1. Below is a graph of the value vs. time for one share of stock for a company named Banana Patch.
Name: Section: Math 111 Group Activity: Change and Average Change 1. Below is a graph of the value vs. time for one share of stock for a company named Banana Patch. 40 35 30 25 value 20 (in dollars) 15
More informationAn Optimal Solution to the Linear Programming Problem using Lingo Solver: A Case Study of an Apparel Production Plant of Sri Lanka
An Optimal Solution to the Linear Programming Problem using Lingo Solver: A Case Study of an Apparel Production Plant of Sri Lanka Z. A. M. S. Juman and W. B. Daundasekara Department of Mathematics, Faculty
More informationMANY METHODS of formulating transhipment
AGRILTRAL EOOMIS RESEARH VOL XIX, o, JAARY 967 Formulation of a Transhipment Problem Involving Time By Mack Leath and James E Martin MAY METHODS of formulating transhipment problems are available to the
More informationCHAPTER 12 LINEAR PROGRAMMING POINTS TO REMEMBER
For more important questions visit : www.4ono.com CHAPTER 12 LINEAR PROGRAMMING POINTS TO REMEMBER Linear programming is the process used to obtain minimum or maximum value of the linear objective function
More informationCHAPTER 5 SUPPLIER SELECTION BY LEXICOGRAPHIC METHOD USING INTEGER LINEAR PROGRAMMING
93 CHAPTER 5 SUPPLIER SELECTION BY LEXICOGRAPHIC METHOD USING INTEGER LINEAR PROGRAMMING 5.1 INTRODUCTION The SCMS model is solved using Lexicographic method by using LINGO software. Here the objectives
More informationTechniques of Operations Research
Techniques of Operations Research C HAPTER 2 2.1 INTRODUCTION The term, Operations Research was first coined in 1940 by McClosky and Trefthen in a small town called Bowdsey of the United Kingdom. This
More informationDIS 300. Quantitative Analysis in Operations Management. Instructions for DIS 300-Transportation
Instructions for -Transportation 1. Set up the column and row headings for the transportation table: Before we can use Excel Solver to find a solution to C&A s location decision problem, we need to set
More informationJahangirabad Institute of Technology Dr. ZIAUL HASSAN BAKHSHI Associate Professor Semester II, 2016 MASTER SCHEDULE: Operations Research (NMBA-025)
Jahangirabad Institute of Technology Dr. ZIAUL HASSAN BAKHSHI Associate Professor Semester II, 2016 MASTER SCHEDULE: Operations Research (NMBA-025) Week 1 Class 1 Wednesday, 27 January,2016 Introduction
More informationISyE 3133B Sample Final Tests
ISyE 3133B Sample Final Tests Time: 160 minutes, 100 Points Set A Problem 1 (20 pts). Head & Boulders (H&B) produces two different types of shampoos A and B by mixing 3 raw materials (R1, R2, and R3).
More informationB.1 Transportation Review Questions
Lesson Topics Network Models are nodes, arcs, and functions (costs, supplies, demands, etc.) associated with the arcs and nodes, as in transportation, assignment, transshipment, and shortest-route problems.
More informationMDMA Method- An Optimal Solution for Transportation Problem
Middle-East Journal of Scientific Research 24 (12): 3706-3710, 2016 ISSN 1990-9233 IDOSI Publications, 2016 DOI: 10.5829/idosi.mejsr.2016.3706.3710 MDMA Method- An Optimal Solution for Transportation Problem
More informationRehandling Strategies for Container Retrieval
Rehandling Strategies for Container Retrieval Tonguç Ünlüyurt and Cenk Aydin Sabanci University, Faculty of Engineering and Natural Sciences e-mail: tonguc@sabanciuniv.edu 1 Introduction In this work,
More informationLECTURE NOTES ON OPERATIONS RESEARCH
LECTURE NOTES ON OPERATIONS RESEARCH Emad Elbeltagi, Ph.D., P.Eng., Professor of Construction Management Structural Engineering Department, Faculty of Engineering, Mansoura University Operations Research
More informationLECTURE NOTES ON OPERATIONS RESEARCH
LECTURE NOTES ON OPERATIONS RESEARCH Emad Elbeltagi, Ph.D., P.Eng., Professor of Construction Management Structural Engineering Department, Faculty of Engineering, Mansoura University Operations Research
More informationChange in Overhead Cost Change in Production Units
Test Series: October, 2018 MOCK TEST PAPER 2 FINAL (OLD) COURSE: GROUP II PAPER 5: ADVANCED MANAGEMENT ACCOUNTING SUGGESTED ANSWERS/HINTS 1. (a) (*) P Q R I. Contribution per unit 4 3 5 II. Units (Lower
More informationTransshipment and Assignment Models
March 31, 2009 Goals of this class meeting 2/ 5 Learn how to formulate transportation models with intermediate points. Learn how to use the transportation model framework for finding optimal assignments.
More informationSupply Chain Location Decisions Chapter 11
Supply Chain Location Decisions Chapter 11 11-01 What is a Facility Location? Facility Location The process of determining geographic sites for a firm s operations. Distribution center (DC) A warehouse
More informationIntroduction to Artificial Intelligence. Prof. Inkyu Moon Dept. of Robotics Engineering, DGIST
Introduction to Artificial Intelligence Prof. Inkyu Moon Dept. of Robotics Engineering, DGIST Chapter 9 Evolutionary Computation Introduction Intelligence can be defined as the capability of a system to
More informationResearch into container reshuffling and stacking problems in container terminal yards
IIE Transactions (2015) 47, 751 766 Copyright C IIE ISSN: 0740-817X print / 1545-8830 online DOI: 10.1080/0740817X.2014.971201 Research into container reshuffling and stacking problems in container terminal
More informationSCHEDULING IN MANUFACTURING SYSTEMS
In process planning, the major issue is how to utilize the manufacturing system s resources to produce a part: how to operate the different manufacturing processes. In scheduling. The issue is when and
More informationINSTITUTE OF AERONAUTICAL ENGINEERING
INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 00 043 MECHANICAL ENGINEERING TUTORIAL QUESTION BANK Course Name : OPERATIONS RESEARCH Course Code : A7032-JNTUH R1 Class : IV B.TECH
More informationOperations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras
Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Lecture - 5 Aggregate Planning, Tabular Method, Linear Programming (Refer
More informationLECTURE 41: SCHEDULING
LECTURE 41: SCHEDULING Learning Objectives After completing the introductory discussion on Scheduling, the students would be able to understand what scheduling is and how important it is to high volume
More informationOptimization Prof. Debjani Chakraborty Department of Mathematics Indian Institute of Technology, Kharagpur
Optimization Prof. Debjani Chakraborty Department of Mathematics Indian Institute of Technology, Kharagpur Lecture - 39 Multi Objective Decision Making Decision making problem is a process of selection
More informationINSTITUTE OF AERONAUTICAL ENGINEERING
INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 MECHANICAL ENGINEERING TUTORIAL QUESTION BANK Course Name : OPERATIONS RESEARCH Course Code : A70352 Class : IV - I Branch
More informationMetaheuristics. Approximate. Metaheuristics used for. Math programming LP, IP, NLP, DP. Heuristics
Metaheuristics Meta Greek word for upper level methods Heuristics Greek word heuriskein art of discovering new strategies to solve problems. Exact and Approximate methods Exact Math programming LP, IP,
More informationA Solution Approach for the Joint Order Batching and Picker Routing Problem in Manual Order Picking Systems
A Solution Approach for the Joint Order Batching and Picker Routing Problem in Manual Order Picking Systems André Scholz Gerhard Wäscher Otto-von-Guericke University Magdeburg, Germany Faculty of Economics
More informationSPATIAL MODELING IN LOGISTICS DECISION-MAKING PROCESSES. IDENTIFYING THE OPTIMAL LOCATION FOR A SINGLE CENTRAL WAREHOUSE
SPATIAL MODELING IN LOGISTICS DECISION-MAKING PROCESSES. IDENTIFYING THE OPTIMAL LOCATION FOR A SINGLE CENTRAL WAREHOUSE Ţarţavulea Ramona Iulia Academy of Economic Studies, Faculty of International Business
More informationIntroduction to Management Science, 10e (Taylor) Chapter 4 Linear Programming: Modeling Examples
Introduction to Management Science, 10e (Taylor) Chapter 4 Linear Programming: Modeling Examples 1) When formulating a linear programming problem constraint, strict inequality signs (i.e., less than
More informationProtecting Sensitive Tabular Data by Complementary Cell Suppression - Myth & Reality
Protecting Sensitive Tabular Data by Complementary Cell Suppression - Myth & Reality Ramesh A. Dandekar U. S. Department of Energy Abstract Title 13, U.S.C., Section 9 and the newly adopted CIPSEA of 2002
More information