The Study of Using LP to Solve Flower Transport Problem
|
|
- Horatio Hampton
- 6 years ago
- Views:
Transcription
1 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 2 Department of Digital Mechatronic Technology, Chinese Culture University, Taiwan, R.O.C. leletrung88@gmail.com Abstract The main purpose of this paper is to solve Flower Transport Problem (FTP) by using Linear Programming (LP). There are five s can be used to solve Flower Transport Problem by Linear Programming is (1) Northwest Corner (2) Minimum cost (3) Vogel s approximation (4) Row Minimum Method (5) Column Minimum Method. After reviewing the main literature in this area, Mathematical Model of the FTP, this paper presents some examples are solved by five s. This paper introduces some s to improve the results from the s that gave suboptimal results. Those s are (1) Stepping Stone Method (2) Modified Distribution Method. Finally, the paper compare different situation of the examples and propose a comparison table to know which in different situation is the best. In five s, the table shows that most results of Vogel s approximation give an initial solution is optimality. At this time, it is accepted to be the best ; Minimum cost, Row Minima and Column Minima are second s and finally Northwest corner gives an initial solution very far from the optimal solutions. Keywords: Transport Problem, Linear Programming, Northwest Corner Method, Minimum Cost Method, Vogel S Approximation Method, Row Minimum Method, Column Minimum Method 1. Introduction Flower Transport Problem (FTP) is that truckloads of Flower are to be shipped from plants to customers during a particular period of time. Both the available supply at each plant and the required demand by each customer (measured in terms of truckloads) are known. The cost associated with moving one truck load from a plant to a customer is also provided. The objective is to make a least-cost plan for moving the flower such that the demand is met and shipments do not exceed the available supply from each depot [15]. Linear Programming (LP) is a mathematical for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships. LP is a specific case of mathematical programming (mathematical optimization) [14]. The data for the problem can be arranged as a matrix of costs of transferring a unit quantity from source i to destination j; a vector which lists the quantities available at each source; and a vector of the demands at each destination. This paper writes about using LP to solve FTP. The remainder of this article is structured as follows. Next sections provide a general overview of FTP formulation and a few words on previous work. An introduction to the FTP Mathematical Model and five s to solve FTP are presented in sections 3 and 4 respectively. Section 5 is devoted to Steps solving FTP. Section 6 presents some examples is solved by five s and AIMMS software. Section 7 is optimal test of the results and introduces some s to improve the suboptimal results. Next, computational results are presented and discussed. Finally, some conclusions, remarks and future research topics are outlined in the last section. Journal of Convergence Information Technology(JCIT) Volume8, Number8, April 2013 doi: /jcit.vol8.issue
2 2. Previous work on FTP Mathematical technique used in computer modeling (simulation) to find the best possible solution in allocating limited resources (energy, machines, materials, money, personnel, space, time, etc.) to achieve maximum profit or minimum cost. However, it is applicable only where all relationships are linear (see linear relationship), and can accommodate only a limited class of cost functions. For problems involving more complex cost functions, another technique called 'mixed integer modeling' is employed [14]. This paper introduces 6 steps to solve FTP is (1) Check for balance of supply and demand (2) Decide the nature of problem Minimization of Transportation-cost and Make an initial basic feasible solution (3) Count the number of filled (or allocated) routes (4) Check the optimality of the initial solution and revise solution if it s not an optimal solution [5]. There are 5 s to make an initial basic feasible solution is Northwest Corner Method, Minimum Cost Method, Vogel s approximation Method, Row Minima Method, Column Minima Method. They are written in section 5 [12] [7] [6]. Checking optimality of the initial solution and revise solution, this paper using two s is (1) Stepping Stone Method (2) Modified Distribution Method (MODI) or (u-v) Method. They are written in section 7 [6]. 3. Mathematical Model of the FTP Transportation model is a special type of networks problems that for shipping a commodity from sources (e.g., factories) to destinations (e.g., warehouse). We can define the Transportation Model as below: Given m sources and n destinations, the supply at i th source is a i and the demand at j th destination is b j. The cost of shipping one unit of goods from i th source to j th destination is c ij. The goal is to minimize the total transportation cost while satisfying all the supply and demand restrictions. Using linear programming to solve transportation problem, we determine the value of objective function which minimize the cost for transporting and also determine the number of unit can be transported from i th source to j th destination. The equivalent linear programming model will be: The objective function Minimize Z= Subject to n m i 1 j 1 cx ij ij (Where x ij is number of units shipped from source i to destination j) n xij ai for i=1, 2 n j 1 m xij bj for j=1, 2 m i 1 xij 0 for all i to j A transportation problem is said to be balanced if the total supply from all sources equals the total demand in all destinations. Otherwise it is called unbalanced. 1117
3 4. Methods solving FTP Most of these s are only to solve for balanced transportation problem. So if the problem is unbalanced then we can balance a transportation problem by adding a dummy supply center (row) or a dummy demand center (column) as the need arises [5]. The solutions obtained by any of the following s are called an initial basic feasible solution (BFS). In other words, these solutions can not be an optimal solution. The North West Corner Rule is a for computing a basic feasible of transportation where the basic variables are selected from the North-West corner (i.e., top left corner). The minimum-cost finds a better starting solution by concentrating on the cheapest routes. The starts by assigning as much as possible to the cell with the smallest unit cost. The Vogel approximation is an iterative procedure for computing a basic feasible solution of a transportation problem. This is preferred over the two s discussed in the previous sections, because the initial basic feasible solution obtained by this is either optimal or very close to the optimal solution. Row minimum start with first row and choose the lowest cost cell of first row so that either the capacity of the first supply is exhausted or the demand at jth distribution center is satisfied or both. Column minimum starts with first column and chooses the lowest cost cell of first column so that either the demand of the first distribution center is satisfied or the capacity of the ith supply is exhausted or both.three cases arise: 5. Steps solve transportation problem You can read on the paper [5], [12] to get the steps solving transportation problem. Step 1: Check for balance of supply and demand If Supply = Demand. This means that a feasible solution always exists. Go to step If Supply > Demand then add one or some dummy demand centers (column) with zero transportation cost that satisfies Supply = Demand. And then go to step If Supply < Demand then add one or some dummies supply centers (row) with zero transportation cost that satisfies Supply = Demand. And then go to step 2. Step 2: 2.1. Decide the nature of problem: Minimization of transportation-cost Make an initial basic feasible solution (BFS). BFS may be done by using any of the following s: (1) Northwest Corner, (2) Minimum cost, (3) Vogel s approximation, (4) Row minima, (5) Column minima. Step 3: Count the number of filled (or allocated) routes If filled route = (m + n -1) then go for optimality check (step 5) If filled route < (m+n-1) then the solution is degenerate. Hence remove degeneracy and go to step 4. Where m = the number of supplies, including dummy row; n = the number of demands, including dummy column. Step 4: In case of degeneracy, allocate a very-very small quality, (which is zero for all calculation purposes), in the least cost of unfilled cells. Step 5: Check the optimality of the initial solution and revise solution if it s not an optimal solution. We will use one of two s in section 6 in this paper to do that 6. Illustrative example 6.1. Problem description Truckloads of Flower are to be shipped from plants to customers during a particular period of time. Both the available supply at each plant and the required demand by each customer (measured in terms of truckloads) are known. The cost associated with moving one truck load from a plant to a customer is 1118
4 also provided. The objective is to make a least-cost plan for moving flowers such that the demand is met and shipments do not exceed the available supply from each depot. The following table (Table 1) is some examples for the data of the problem described in the previous paragraph. Figure 1. Taiwan Map Example 1... Example 30 Table 1(Summary). Input data of FTP Customers Unit Transport Cost Plants Hsinchu Chunan Changhua Chiai Tai-tung Supply Taipei Tainan Demand Taipei Tainan Demand Review results The example 1: After using one of above s, we easy to see minimum cost is (Vogel s approximation ) and then and final (Figure 2). Results of using the s NorthwestCorner MinimumCost Vogel'sapproximation RowMinima ColumnMinima Figure 2. The results of the example 1 Is an optimal solution? To answer that question, we will go to section 7. The example 2: 1119
5 After using one of above s, we easy to see minimum cost is 2560 (Minimum Cost ) and then 2600 and final 3290 (Figure 3). Results of the s Series Northwest Corner MinimumC ost Vogel'sapp roximation RowMinim a ColumnMi nima The s Figure 3.The results of the example 2 Is 2560 an optimal solution? To answer that question, we will go to section 7. The example 30: After using one of above s, we easy to see minimum cost is 2848 (Vogel s approximation) and then 2790 (Figure 4). Results of the s Series Northwe stcorner Minimu mcost Vogel'sa pproxim ation RowMini ma Column Minima The s Figure 4. The results of the example 30 Is 2487 an optimal solution? To answer that question, we will go to section Optimality test and optimize solution After using any of the above s to get an initial basic feasible solution, we must now proceed to determine whether the solution obtained is optimal or not. If the solution is optimal, ok. Otherwise we will optimize the solution until it is optimal solution. So this section introduces two s to be used for testing and optimize solution. They are: 1. Stepping Stone Method 2. Modified Distribution Method (MODI) 7.1. Stepping stone Step 1: Make sure that the number of occupied cell is exactly equal to m+n-1, where m is the number of rows and n is the number of columns. 1120
6 Step 2: Select an unoccupied cell. Beginning at this cell, trace a closed path, starting from the selected unoccupied until finally returning to that same unoccupied cell. The cells the turning points are called Stepping Stones on the path. Step 3: Assign plus (+) and minus (-) alternatively on each corner cell of the closed path just traced, beginning with the plus sign at unoccupied cell to be evaluated. Step 4: Add the unit transportation costs associated with each of the cell traced in the closed path. This will give net change in terms of cost. Step 5: Repeat step 3 to 5 until all unoccupied cells are evaluated. Step 6: Check the sign of each of the net change in the unit transportation costs If all the net changes computed are greater than or equal to zero, an optimal solution has been reached If not, it is possible to improve the current solution and decrease the total transportation cost, so move to step 7. Step 7: 7.1. Select the unoccupied cell having the most negative net cost change and determine the maximum number of units that can be assigned to this cell The smallest value with a negative position on the closed path indicates the number of units that can be shipped to the entering cell Add this number to the unoccupied cell and to all other cells on the path marked with a plus sign Subtract this number from cells on the closed path marked with a minus sign Modified Distribution Method (MODI) or (u-v) The modified distribution, also known as MODI or (u-v) provides a minimum cost solution to the transportation problem. In the stepping stone, we have to draw as many closed paths as equal to the unoccupied cells for the evaluation. To the contrary, in MODI, only closed path for the unoccupied cell with highest opportunity cost is drawn. MODI is an improvement over stepping stone : Step 1: Determine the values of dual variables, ui and vj, using ui + vj = cij Step 2: Compute the opportunity cost using cij (ui + vj). Step 3: Check the sign of each opportunity cost If the opportunity costs of all the unoccupied cells are either positive or zero, the given solution is the optimal solution If one or more unoccupied cell has negative opportunity cost, the given solution is not an optimal solution and further savings in transportation cost are possible. Step 4: Select the unoccupied cell with the smallest negative opportunity cost as the cell to be included in the next solution. Step 5: Draw a closed path or loop for the unoccupied cell selected in the previous step. Please note that the right angle turn in this path is permitted only at occupied cells and at the original unoccupied cell. Step 6: Assign alternate plus and minus signs at the unoccupied cells on the corner points of the closed path with a plus sign at the cell being evaluated. Step 7: 7.1. Determine the maximum number of units that should be shipped to this unoccupied cell. The smallest value with a negative position on the closed path indicates the number of units that can be shipped to the entering cell Now, add this quantity to all the cells on the corner points of the closed path marked with plus signs, and subtract it from those cells marked with minus signs. In this way, an unoccupied cell becomes an occupied cell. Step 8: Repeat the whole procedure until an optimal solution is obtained Optimality test of Flower Transportation problem We will use one of above the s to test if the above solutions are optimal or not. 1121
7 After using one of above the s, we will see: The example 1: is optimal solution and other solutions are not optimality. So we will continue to use one of two the s to edit the solutions that are not optimality into optimal solutions. The example 2: 2560 is not optimal solution. So we can continue to use one of two the s to edit the solutions that are not optimality into optimal solutions. And finally, we can get optimal result is The example 30: 2487 is optimal solution. So other solutions are not optimality. Hence we can continue to use one of two the s to edit the solutions that are not optimality into optimal solutions. 8. Solving FTP by using AIMMS AIMMS (Advanced Interactive Multidimensional Modeling System) is a software system designed for modeling and solving large-scale optimization and scheduling-type problems. We use AIMMS to solve FTP and we can get the results as follows: (Table 2) Example 1... Example 30 Table 2 (Summary). Distribution quality of goods of FTP Customers Unit Transport Cost Plants Hsinchu Chunan Changhua Chiai Tai-tung Supply Taipei Tainan Demand Taipei Tainan Demand And final, total transport cost of the example 1 is 27499; total transport cost of the example 2 is 2530 and total transport cost of the example 30 is Results Solution is called to be Near to optimal solution if it is less than optimal solution and greater than all the remaining solutions. A lot of papers have been written that: Northwest corner gives an initial solution very far from optimal solution; Minimum cost gives an initial solution or optimal solution or very near to optimal solution; Vogel s approximation also gives an initial solution or optimal solution or very near to optimal solution and it is preferred over the two previous s [7][13][15]. Look at results of the 30 examples. We can see (Table 10): Northwest corner often gives initial solutions very far from the optimal solutions; Minimum Cost, Row Minima, Column Minima often give initial solutions or optimal solutions (over 20%) or very near to optimal solutions (over 50%); and Vogel s approximation also often gives initial solutions or optimal solutions (90%) or very near to optimal solutions and it is preferred over the four previous s very much. 10. Conclusions and Future Work In five s, we can see that: Most results of Vogel s approximation give an initial solution is optimality. At this time, it is accepted to be the best ; and then Minimum cost, Row Minima, Column Minima and finally Northwest corner gives an initial solution very far from the optimal solutions. 1122
8 Time Optimal Advantage Table 3(Summary). Comparison between the five s Vogel s Northwest corner Minimum cost Row minimum approximation Computations take short time The solution is very far from optimal solution (about 80%) It is only convenient for programming. Not certain, sometimes shortest Give an initial solution or optimal solution (over 20%) or near to optimal solution (over 50%). It can choose the initial solution to save time. Computations take the longest time Give an initial solution or optimal solution (90%) or very near to optimal solution. It can choose the initial solution to save time. Computations take short time Give an initial solution or optimal solution (over 20%) or near to optimal solution (over 50%). Useful in small number of supply and when the cost of transportation on supply. Column minimum Computations take short time Give an initial solution or optimal solution (over 20%) or near to optimal solution (over 50%). Useful in small number of demand and when the cost of transportation on demand. After using any of the above s to get an initial basic feasible solution, we must now proceed to determine whether the solution so obtained is optimal or not. So we will use Stepping Stone Method or Modified Distribution Method (MODI) to test and find optimal solution (MODI is an improvement over stepping stone ). If Models have a lot of variables and constraints then we should use some software to get results faster and more accurate. E.g.: ABQM, QSB, LINGO, EXCEL, and AIMMS. Using AIMMS with optimization technology offers a complete versatile modeling environment, reduces development time, risk and cost, provides flexibility and scalability, offers the highest possible performance, is easy to learn, has proven its benefits in a wide range of applications. Future Work will be The study of Solving Capacity Routing Problem. The Capacity Routing Problem has been divided into subproblems, concerning customers allocation and routing optimization separately. The subproblems are (1) Capacity Problem and (2) Routing Problem. 11. References [1] [2] [3] Thomas S.Ferguson, ebook Linear Programming [4] AIMMS, ebook AIMMS Optimization Modeling [5] Transportation Models, [6] Transportation Problems, [7] Transportation Problem: A special case for Linear Programming Problem, [8] Thomas S. Ferguson, Linear Programming [9] Transportation Problems, [10] The Transportation Problem: LP Formulations, /documents/TP1-Formulation.pdf [11] Transportation Problems, [12] Transportation Problems, [13] How to solve Transportation problem? [14] An Introduction to Linear Programming df [15] The Transportation Problem [16] Shen Lin, Computer Solutions of the Traveling Salesman Problem, Journal of The Bell System Techical, December,
9 [17] Dr. Leena Jain, Mr. Amit Bhanot, Traveling Salesman Problem: A Case Study, International Journal of Computer & Technology, vol. 3, no. 1, AUG,
3. Transportation Problem (Part 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
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 informationTransportation 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 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 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 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 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 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 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 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 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 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 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 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 informationIMPROVED SOLUTIONS FOR THE TRAVELING PURCHASER PROBLEM
Computers Ops Res. Vol. 25, No. 11, pp. 879±885, 1998 # 1998 Elsevier Science Ltd. All rights reserved PII: S0305-0548(98)00032-X Printed in Great Britain 0305-0548/98 $19.00 + 0.00 IMPROVED SOLUTIONS
More informationThe Efficient Allocation of Individuals to Positions
The Efficient Allocation of Individuals to Positions by Aanund Hylland and Richard Zeckhauser Presented by Debreu Team: Justina Adamanti, Liz Malm, Yuqing Hu, Krish Ray Hylland and Zeckhauser consider
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 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 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 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 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 Particle Swarm Optimization Algorithm for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests
A Particle Swarm Optimization Algorithm for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests Pandhapon Sombuntham and Voratas Kachitvichayanukul Abstract A particle swarm optimization
More informationThe Time Window Assignment Vehicle Routing Problem
The Time Window Assignment Vehicle Routing Problem Remy Spliet, Adriana F. Gabor June 13, 2012 Problem Description Consider a distribution network of one depot and multiple customers: Problem Description
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 informationEnhancing Pendulum Nusantara Model in Indonesian Maritime Logistics Network
Enhancing Pendulum Nusantara Model in Indonesian Maritime Logistics Network Komarudin System Engineering, Modeling Simulation (SEMS) Laboratory, Department of Industrial Engineering, Universitas Indonesia,
More informationTAKING ADVANTAGE OF DEGENERACY IN MATHEMATICAL PROGRAMMING
TAKING ADVANTAGE OF DEGENERACY IN MATHEMATICAL PROGRAMMING F. Soumis, I. Elhallaoui, G. Desaulniers, J. Desrosiers, and many students and post-docs Column Generation 2012 GERAD 1 OVERVIEW THE TEAM PRESENS
More informationTask Assignment Problem of Robots in a Smart Warehouse Environment. Zhenping Li, Wenyu Li, Lulu Jiang. Beijing Wuzi University, Beijing, China
Management Studies, July-Aug. 2016, Vol. 4, No. 4, 167-175 doi: 10.17265/2328-2185/2016.04.004 D DAVID PUBLISHING Task Assignment Prolem of Roots in a Smart Warehouse Environment Zhenping Li, Wenyu Li,
More informationWe consider a distribution problem in which a set of products has to be shipped from
in an Inventory Routing Problem Luca Bertazzi Giuseppe Paletta M. Grazia Speranza Dip. di Metodi Quantitativi, Università di Brescia, Italy Dip. di Economia Politica, Università della Calabria, Italy Dip.
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 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 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 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 informationAFRREV STECH An International Journal of Science and Technology Bahir Dar, Ethiopia Vol.1 (3) August-December, 2012:54-65
AFRREV STECH An International Journal of Science and Technology Bahir Dar, Ethiopia Vol.1 (3) August-December, 2012:54-65 ISSN 2225-8612 (Print) ISSN 2227-5444 (Online) Optimization Modelling for Multi-Objective
More informationChapter 3 Formulation of LP Models
Chapter 3 Formulation of LP Models The problems we have considered in Chapters 1 and 2 have had limited scope and their formulations were very straightforward. However, as the complexity of the problem
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 informationModeling Using Linear Programming
Chapter Outline Developing Linear Optimization Models Decision Variables Objective Function Constraints Softwater Optimization Model OM Applications of Linear Optimization OM Spotlight: Land Management
More informationWAYNE STATE UNIVERSITY Department of Industrial and Manufacturing Engineering May, 2010
WAYNE STATE UNIVERSITY Department of Industrial and Manufacturing Engineering May, 2010 PhD Preliminary Examination Candidate Name: 1- Sensitivity Analysis (20 points) Answer ALL Questions Question 1-20
More informationHeuristic Techniques for Solving the Vehicle Routing Problem with Time Windows Manar Hosny
Heuristic Techniques for Solving the Vehicle Routing Problem with Time Windows Manar Hosny College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia mifawzi@ksu.edu.sa Keywords:
More informationScheduling and Coordination of Distributed Design Projects
Scheduling and Coordination of Distributed Design Projects F. Liu, P.B. Luh University of Connecticut, Storrs, CT 06269-2157, USA B. Moser United Technologies Research Center, E. Hartford, CT 06108, USA
More informationProcedia - Social and Behavioral Sciences 109 ( 2014 ) Selection and peer review under responsibility of Organizing Committee of BEM 2013.
Available online at www.sciencedirect.com ScienceDirect Procedia - Social and Behavioral Sciences 109 ( 2014 ) 779 783 2 nd World Conference On Business, Economics And Management-WCBEM 2013 A hybrid metaheuristic
More informationXXVI. OPTIMIZATION OF SKUS' LOCATIONS IN WAREHOUSE
XXVI. OPTIMIZATION OF SKUS' LOCATIONS IN WAREHOUSE David Sourek University of Pardubice, Jan Perner Transport Faculty Vaclav Cempirek University of Pardubice, Jan Perner Transport Faculty Abstract Many
More informationTwo cities use incinerators to. reduce waste before placing it in. landfills. Citie Incinerators Landfills. Cities Incinerators Landfills
It costs $3 per mile to transport a ton of material (either debris or waste). Distances (in miles) between locations are: Two cities use incinerators to reduce waste before placing it in landfills. City#
More informationGetting Started with OptQuest
Getting Started with OptQuest What OptQuest does Futura Apartments model example Portfolio Allocation model example Defining decision variables in Crystal Ball Running OptQuest Specifying decision variable
More informationMulti-depot Vehicle Routing Problem with Pickup and Delivery Requests
Multi-depot Vehicle Routing Problem with Pickup and Delivery Requests Pandhapon Sombuntham a and Voratas Kachitvichyanukul b ab Industrial and Manufacturing Engineering, Asian Institute of Technology,
More informationPrescriptive Analytics for Facility Location: an AIMMS-based perspective
Prescriptive Analytics for Facility Location: an AIMMS-based perspective Dr. Ovidiu Listes Senior Consultant AIMMS Analytics and Optimization Outline Analytics for Facility Location AIMMS Analytics Platform
More informationExcel Solver Tutorial: Wilmington Wood Products (Originally developed by Barry Wray)
Gebauer/Matthews: MIS 213 Hands-on Tutorials and Cases, Spring 2015 111 Excel Solver Tutorial: Wilmington Wood Products (Originally developed by Barry Wray) Purpose: Using Excel Solver as a Decision Support
More informationModeling of competition in revenue management Petr Fiala 1
Modeling of competition in revenue management Petr Fiala 1 Abstract. Revenue management (RM) is the art and science of predicting consumer behavior and optimizing price and product availability to maximize
More informationSkills management heuristics.
University of Louisville ThinkIR: The University of Louisville's Institutional Repository Electronic Theses and Dissertations 5-2009 Skills management heuristics. Erin Jackson University of Louisville
More informationINTEGRATING VEHICLE ROUTING WITH CROSS DOCK IN SUPPLY CHAIN
INTEGRATING VEHICLE ROUTING WITH CROSS DOCK IN SUPPLY CHAIN Farshad Farshchi Department of Industrial Engineering, Parand Branch, Islamic Azad University, Parand, Iran Davood Jafari Department of Industrial
More informationRouting and Scheduling in Tramp Shipping - Integrating Bunker Optimization Technical report
Downloaded from orbit.dtu.dk on: Jan 19, 2018 Routing and Scheduling in Tramp Shipping - Integrating Bunker Optimization Technical report Vilhelmsen, Charlotte; Lusby, Richard Martin ; Larsen, Jesper Publication
More informationCROSS-DOCKING: SCHEDULING OF INCOMING AND OUTGOING SEMI TRAILERS
CROSS-DOCKING: SCHEDULING OF INCOMING AND OUTGOING SEMI TRAILERS 1 th International Conference on Production Research P.Baptiste, M.Y.Maknoon Département de mathématiques et génie industriel, Ecole polytechnique
More informationEvolutionary Algorithms and Simulated Annealing in the Topological Configuration of the Spanning Tree
Evolutionary Algorithms and Simulated Annealing in the Topological Configuration of the Spanning Tree A. SADEGHEIH Department of Industrial Engineering University of Yazd, P.O.Box: 89195-741 IRAN, YAZD
More informationINTEGER PROGRAMMING BASED SEARCH
INTEGER PROGRAMMING BASED SEARCH A Thesis Presented to The Academic Faculty by Michael R Hewitt In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the School of Industrial
More informationModeling a Four-Layer Location-Routing Problem
Modeling a Four-Layer Location-Routing Problem Paper 018, ENG 105 Mohsen Hamidi, Kambiz Farahmand, S. Reza Sajjadi Department of Industrial and Manufacturing Engineering North Dakota State University Mohsen.Hamidi@my.ndsu.edu,
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 informationAN INTEGRATED MODEL OF CROSS DOCKING. A Thesis. presented to. the Faculty of the Graduate School. at the University of Missouri-Columbia
AN INTEGRATED MODEL OF CROSS DOCKING A Thesis presented to the Faculty of the Graduate School at the University of Missouri-Columbia In Partial Fulfillment of the Requirements for the Degree Master of
More information6 Managing freight transport
6 Managing freight transport 6.1 Introduction 6.2 Freight traffic assignment problems 6.3 Service network design problems 6.4 Vehicle allocation problems 6.5 A dynamic driver assignment problem 6.6 Fleet
More informationA Genetic Algorithm on Inventory Routing Problem
A Genetic Algorithm on Inventory Routing Problem Artvin Çoruh University e-mail: nevin.aydin@gmail.com Volume 3 No 3 (2014) ISSN 2158-8708 (online) DOI 10.5195/emaj.2014.31 http://emaj.pitt.edu Abstract
More informationChapter 11. Decision Making and Relevant Information Linear Programming as a Decision Facilitating Tool
Chapter 11 Decision Making and Relevant Information Linear Programming as a Decision Facilitating Tool 1 Introduction This chapter explores cost accounting for decision facilitating purposes It focuses
More informationAdvanced Analytics Meets Pulp and Paper Planning and optimizing your Supply Chain from A to Z. June 22, 2016
Advanced Analytics Meets Pulp and Paper Planning and optimizing your Supply Chain from A to Z June 22, 2016 Meet the Presenters Gertjan de Lange Connecting Business & Optimization SVP, AIMMS Gertjan has
More informationCHAPTER 1 INTRODUCTION
1 CHAPTER 1 INTRODUCTION 1.1 MANUFACTURING SYSTEM Manufacturing, a branch of industry, is the application of tools and processes for the transformation of raw materials into finished products. The manufacturing
More informationOPTIMIZATION OF DISTRIBUTION ROUTE SELECTION BASED ON PARTICLE SWARM ALGORITHM
ISSN 1726-4529 Int j simul model 13 (2014) 2, 230-242 Original scientific paper OPTIMIZATION OF DISTRIBUTION ROUTE SELECTION BASED ON PARTICLE SWARM ALGORITHM Wu, Z. Information College, Capital University
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 informationTopics in Supply Chain Management. Session 3. Fouad El Ouardighi BAR-ILAN UNIVERSITY. Department of Operations Management
BAR-ILAN UNIVERSITY Department of Operations Management Topics in Supply Chain Management Session Fouad El Ouardighi «Cette photocopie (d articles ou de livre), fournie dans le cadre d un accord avec le
More informationStated Preference (Conjoint) Market Research Data
Stated Preference (Conjoint) Market Research Data Data for Estimation of Choice Models Revealed Preferences (RP): observed or reported actual behavior Travel diaries Stated Preferences (SP): Response to
More informationVehicle Routing with Cross Docks, Split Deliveries, and Multiple Use of Vehicles. Arun Kumar Ranganathan Jagannathan
Vehicle Routing with Cross Docks, Split Deliveries, and Multiple Use of Vehicles by Arun Kumar Ranganathan Jagannathan A thesis submitted to the Graduate Faculty of Auburn University in partial fulfillment
More informationMileage savings from optimization of coordinated trucking 1
Mileage savings from optimization of coordinated trucking 1 T.P. McDonald Associate Professor Biosystems Engineering Auburn University, Auburn, AL K. Haridass Former Graduate Research Assistant Industrial
More informationAbstract Number: A Feasibility Study for Joint Services of Vehicle Routing and Patrol
Abstract Number: 011-0101 A Feasibility Study for Joint Services of Vehicle Routing and Patrol Chikong Huang *1 Stephen C. Shih 2 Poshun Wang 3 *1 Professor, Department of Industrial anagement, Institute
More information1.224J/ESD.204J TRANSPORTATION OPERATIONS, PLANNING AND CONTROL: CARRIER SYSTEMS
1.224J/ESD.204J TRANSPORTATION OPERATIONS, PLANNING AND CONTROL: CARRIER SYSTEMS Professor Cynthia Barnhart Professor Nigel H.M. Wilson Fall 2003 1.224J/ ESD.204J Outline Sign-up Sheet Introductions Carrier
More informationOptimizing Product Transportation At Frito Lay
Spring 11 Optimizing Product Transportation At Frito Lay Javier González Fernando G. Sada Marcelo G. Sada Southern Methodist University Table of Contents 2. Background and Description of the Problem...
More informationS Due March PM 10 percent of Final
MGMT 2012- Introduction to Quantitative Methods- Graded Assignment One Grade S2-2014-15- Due March 22 11.55 PM 10 percent of Final Question 1 A CWD Investments, is a brokerage firm that specializes in
More informationA Log-Truck Scheduling Model Applied to a Belgian Forest Company. Jean-Sébastien Tancrez 1
A Log-Truck Scheduling Model Applied to a Belgian Forest Company Jean-Sébastien Tancrez 1 Louvain School of Management, Université catholique de Louvain, Mons, Belgium {js.tancrez@uclouvain.be} Abstract.
More informationTransportation Cost Optimization
Transportation Cost Optimization Bashkim Çerkini Kellogg and Brown & Root, Ferizaj, Kosovë bashkimqerkini@gmail.com Roberta Bajrami University AAB, Ferizaj, Kosovë Roberta.Bajrami@universitetiaab.com Robert
More informationOptimal Two Stage Open Shop Specially Structured Scheduling To Minimize The Rental Cost
International Journal of Applied Science-Research and Review (IJAS) www.ijas.org.uk Original Article Optimal Two Stage Open Shop Specially Structured Scheduling To Minimize The Rental Cost Deepak Gupta
More informationa) Measures are unambiguous quantities, whereas indicators are devised from common sense understandings
Chapter-1: QUANTITATIVE TECHNIQUES Self Assessment Questions 1. An operational definition is: a) One that bears no relation to the underlying concept b) An abstract, theoretical definition of a concept
More informationAUTOMATIC TEST CASE GENERATION BASED ON GENETIC ALGORITHM
AUTOMATIC TEST CASE GEERATIO BASED O GEETIC ALGORITHM DA LIU, XUEJU WAG, JIAMI WAG School of Information Science and Technology,Shijiazhuang Tiedao University, Shijiazhuang050043, China E-mail: liudanld@126.com
More information56:171 Homework Exercises -- Fall 1993 Dennis Bricker Dept. of Industrial Engineering The University of Iowa
56:7 Homework Exercises -- Fall 99 Dennis Bricker Dept. of Industrial Engineering The University of Iowa Homework # Matrix Algebra Review: The following problems are to be found in Chapter 2 of the text,
More informationThe Preemptive Stocker Dispatching Rule of Automatic Material Handling System in 300 mm Semiconductor Manufacturing Factories
Journal of Physics: Conference Series PAPER OPEN ACCESS The Preemptive Stocker Dispatching Rule of Automatic Material Handling System in 300 mm Semiconductor Manufacturing Factories To cite this article:
More informationA Framework for Systematic Warehousing Design
A Framework for Systematic Warehousing Design Marc Goetschalckx, Leon McGinnis, Gunter Sharp, Doug Bodner, T. Govindaraj, and Kai Huang Introduction The goal is the development of a systematic methodology
More informationA Correction on Data Envelopment Analysis for Environmental Assessment Using Methodological Comparison between Three Efficiency Measurement Models
2013, TextRoad Publication ISSN: 2090-4274 Journal of Applied Environmental and Biological Sciences www.textroad.com A Correction on Data Envelopment Analysis for Environmental Assessment Using Methodological
More informationProcedia - Social and Behavioral Sciences 189 ( 2015 ) XVIII Annual International Conference of the Society of Operations Management (SOM-14)
Available online at www.sciencedirect.com ScienceDirect Procedia - Social and ehavioral Sciences 189 ( 2015 ) 184 192 XVIII Annual International Conference of the Society of Operations Management (SOM-14)
More informationA Hit-Rate Based Dispatching Rule For Semiconductor Manufacturing
International Journal of Industrial Engineering, 15(1), 73-82, 2008. A Hit-Rate Based Dispatching Rule For Semiconductor Manufacturing Muh-Cherng Wu and Ting-Uao Hung Department of Industrial Engineering
More informationApplication of a Capacitated Centered Clustering Problem for Design of Agri-food Supply Chain Network
www.ijcsi.org 300 Application of a Capacitated Centered Clustering Problem for Design of Agri-food Supply Chain Network Fethi Boudahri 1, Mohamed Bennekrouf 2, Fayçal Belkaid 1, and Zaki Sari 1 1 MELT
More informationDecision Support System (DSS) Advanced Remote Sensing. Advantages of DSS. Advantages/Disadvantages
Advanced Remote Sensing Lecture 4 Multi Criteria Decision Making Decision Support System (DSS) Broadly speaking, a decision-support systems (DSS) is simply a computer system that helps us to make decision.
More informationTHE VALUE OF DISCRETE-EVENT SIMULATION IN COMPUTER-AIDED PROCESS OPERATIONS
THE VALUE OF DISCRETE-EVENT SIMULATION IN COMPUTER-AIDED PROCESS OPERATIONS Foundations of Computer Aided Process Operations Conference Ricki G. Ingalls, PhD Texas State University Diamond Head Associates,
More informationDistributed Algorithms for Resource Allocation Problems. Mr. Samuel W. Brett Dr. Jeffrey P. Ridder Dr. David T. Signori Jr 20 June 2012
Distributed Algorithms for Resource Allocation Problems Mr. Samuel W. Brett Dr. Jeffrey P. Ridder Dr. David T. Signori Jr 20 June 2012 Outline Survey of Literature Nature of resource allocation problem
More informationPreemptive Scheduling of Multi-Criticality Systems with Varying Degrees of Execution Time Assurance
28th IEEE International Real-Time Systems Symposium Preemptive Scheduling of Multi-Criticality Systems with Varying Degrees of Execution Time Assurance Steve Vestal steve.vestal@honeywell.com Honeywell
More informationIntegrating New Cost Model into HMA-Based Grid Resource Scheduling
Integrating New Cost Model into HMA-Based Grid Resource Scheduling Jun-yan Zhang, Fan Min, and Guo-wei Yang College of Computer Science and Engineering, University of Electronic Science and Technology
More informationTHE CHINESE UNIVERSITY OF HONG KONG 2017 MIEG GRADUATES
THE CHINESE UNIVERSITY OF HONG KONG DEPARTMENT OF INFORMATION ENGINEERING EMPLOYMENT SURVEY OF 2017 MIEG GRADUATES MARCH, 2018 The Department of Information Engineering conducts annually an employment
More informationOptimizing the Selection of Cost Drivers in Activity-Based Costing Using Quasi-Knapsack Structure
International Journal of Business and Management; Vol. 10, No. 7; 2015 ISSN 1833-3850 E-ISSN 1833-8119 Published by Canadian Center of Science and Education Optimizing the Selection of Cost Drivers in
More informationStrategic planning. MBI Course Supply Chain Management: Tactical planning. Strategic planning
MBI Course Supply Chain Management: Chapter 8: Strategic and Tactical Supply Chain Planning Strategic planning Resource acquisition options Resource divestment options Competitive position Efficiency Time
More informationA Decision Support System for Performance Evaluation
A Decision Support System for Performance Evaluation Ramadan AbdelHamid ZeinEldin Associate Professor Operations Research Department Institute of Statistical Studies and Research Cairo University ABSTRACT
More informationAn Optimization Algorithm for the Inventory Routing Problem with Continuous Moves
An Optimization Algorithm for the Inventory Routing Problem with Continuous Moves Martin Savelsbergh Jin-Hwa Song The Logistics Institute School of Industrial and Systems Engineering Georgia Institute
More informationChapter 4. Models for Known Demand
Chapter 4 Models for Known Demand Introduction EOQ analysis is based on a number of assumptions. In the next two chapters we describe some models where these assumptions are removed. This chapter keeps
More informationPICK PATH OPTIMIZATION. An enhanced algorithmic approach
PICK PATH OPTIMIZATION An enhanced algorithmic approach Abstract Simulated annealing, enhanced with certain heuristic modifications, provides an optimized algorithm for picking parts from a warehouse or
More information(Assignment) Master of Business Administration (MBA) PGDPM Subject : Management Subject Code : PGDPM
(Assignment) 2017-2018 Master of Business Administration (MBA) PGDPM Subject : Management Subject Code : PGDPM Subject Title : Operation Research Course Code : PGDPM-01 Maximum Marks: 30 Note: Long Answer
More informationOptimization Model in Subcontractors Assignment in Jordan
Optimization Model in Subcontractors Assignment in Jordan 1 Shereen Yahya Abunada and 2 Ibrahim Abed Mohammed 1,2 Isra University- Jordan. 1 ORCID 0000-0003-2785-4914 Abstract Contracting companies carry
More informationAdvanced Supply Chain Management (POM 625) - Lecture 1 - Dr. Jinwook Lee
Advanced Supply Chain Management (POM 625) - Lecture 1 - Dr. Jinwook Lee Topics of Lecture 1 - Introduction - What is Supply Chain Management? - Issues of SCM - Goals, importance, and strategies of SCM
More informationContainer Sharing in Seaport Hinterland Transportation
Container Sharing in Seaport Hinterland Transportation Herbert Kopfer, Sebastian Sterzik University of Bremen E-Mail: kopfer@uni-bremen.de Abstract In this contribution we optimize the transportation of
More informationINDUSTRIAL ENGINEERING
1 P a g e AND OPERATION RESEARCH 1 BREAK EVEN ANALYSIS Introduction 5 Costs involved in production 5 Assumptions 5 Break- Even Point 6 Plotting Break even chart 7 Margin of safety 9 Effect of parameters
More information