A WinQSB szoftver alkalmazásai -...
Transcript of A WinQSB szoftver alkalmazásai -...
A WinQSB szoftver alkalmazasai
Losonczi Laszlo
Debreceni Egyetem, Kozgazdasag- es Gazdasagtudomanyi Kar
Debrecen, 2011/12 tanev, I. felev
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 1 / 54
Szoftver
Szoftver: WinQSB (Quantitative System for Business)http://www.econ.unideb.hu/sites/download/WinQSB.zipA WinQSB-nel 19 alkalmazasi modulja van. A szoftver hasznalataszinte magatol ertetodo.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 2 / 54
1. Linearis (LP) es egesz (erteku) linearisprogramozas (ILP)
A linearis es egesz (erteku) linearis programozasi modul arrahasznalhato, hogy linearis celfuggveny maximumat ill. minimumatszamolja ki linearis korlatozo feltetelek mellett. A dontesi valtozoklehetnek folytonosak, egesz ertekuek vagy binarisak (0 vagy 1). Ketvaltozonal grafikus megoldas is lehetseges, meghıvhatjuk a vegsomegoldast vagy a lepesenkenti szimplex tablat, es erzekenysegivizsgalatot is vegezhetunk.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 3 / 54
2. Linearis (GP) es egesz (erteku) lineariscelprogramozas (IGP)
Ez a program linearis es egesz (erteku) linearis celprogramozasifeladatokat old meg, ahol egy vagy tobb linearis celfuggvenyt kelloptimizalni (maximalizalni vagy minimalizalni) linearis feltetelek mellett.A celok vagy prioritizalva vannak, vagy pedig (fontossagi sorrenbe)vannak rendezve. A dontesi valtozok lehetnek folytonosak, egeszertekuek vagy binarisak (0 vagy 1). Ket valtozonal grafikus megoldasis lehetseges, meghıvhatjuk a vegso megoldast vagy a lepesenkentimegoldast, es erzekenysegi vizsgalatot is vegezhetunk.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 4 / 54
3. Kvadratikus (QP) es egesz (erteku) kvadratikusprogramozas (IQP)
Ez a modul kvadratikus celfuggveny optimalizalasat hajtja vegrelinearis korlatozo feltetelek mellett. A dontesi valtozokat korlatozhatjuk.Ket valtozonal grafikus megoldas is lehetseges, meghıvhatjuk a vegsomegoldast vagy a lepesenkenti megoldast, es erzekenysegivizsgalatot is vegezhetunk.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 5 / 54
4. Halozat modellezes
Az alabbi halozat modelezesi problemak megoldasara alkalmazhato:transz-shipment, szallıtasi problema, assignment, maximalis folyam,minimalis feszıtofa, legrovidebb ut, utazo ugynok problema.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 6 / 54
5. Nemlinearis programozas (NLP)
Nemlinearis celfuggveny maximumat (minimumat) keressuk linarisvagy nemlinearis feltetelek mellett.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 7 / 54
6. Dinamikus programozas (DP)
A dinamikus programozasban egymashoz kapcsolodo donteseksorozatan kersztul kapunk megoldast. A modul harom tipikusproblema megoldasara alkalmas: hatizsak problema (knapsack),legrovidebb ut (stagecoach), tovabba termeles es leltarozas utemezes.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 8 / 54
7. PERT/CPM
Ez egy projekt management program ami vagy a PERT (ProgramEvaluation and Review Technique) modszert vagy a CAM (Critical PathMethod) modszert vagy mindkettot hasznalja. Egy projekt kulonbozotevekenysegekbol (activities) es megelozesi (precedence) relaciokbolall. Megadja a kritikus tevekenysegeket, a mas tevekenysegeklehetseges keseset es a projekt teljesıtesenek idejet. Ugyancsakmeadja a a tevekenysegek oszlpdiagrammjat (Gantt charts) a vizualisellenorzeshez.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 9 / 54
8. Sorbaallasi analızis (queuing)
Ez a program egyetlen sorbaallasi/ varakozasi rendszert ertekel. Afelhasznalo 15 kulonbozo valoszınusegi eloszlasbol valaszthat,beleertve a Monte Carlo szimulaciot, a kozbenso erkezesek szervizidejere es az erkezesek meretere. A megoldas a sorbaallasi rendszerhatekonysagat es a koltseg/elony analızist adja meg.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 10 / 54
9. Sorbaallasi rendszer szimulalas (QSS)
Ez a modul egy vagy tobb sorbaallasi rendszer diszkret esemenyeinekszimulaciojat adja meg. A beviteli kovetelmenyek: az ugyfelekerkezese, a szerverek (intezok) szama, a sorok szama, az ugyfelekakik a szerviz befejezese nelkul mennek el. A megoldas a sorbaallasirendszer hatekonysagat adja meg tablazatosan es grafikus formabanis.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 11 / 54
10. Leltar/keszlet elmelet es leltar rendszerek ((ITS)Inventory theory and systems)
A leltar olyan objektumokbol all amelyekbe toket fektettunk be. Ezellehetnek nyersanyagok, alkaltreszek, felkesz aruk, vagy egyebtermekek. Minden leltarproblema eseten abban kell donteni, hogymennyit, mibol es mikor vasaroljunk. Ez a program leltar ellenorzesirendszereket ertekel es old meg, beleertve a az EOQ (economic orderquantity) modellt, a mennyisegi diszkont modellt, a sztochasztikusleltar modellt, leltar ellenorzesi rendszerek Monte Carlo szimulaciojat,es a periodikus modellt.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 12 / 54
11. Elorejelzesi modellek (Forecasting (FC))
Ez a modul idosor elorejelzest (11 kulonbozo modellt) es linearisregressziot vegez. A kimenet elorejelzest es hibaertekeket ad meg. Azadatok es az elorejelzes grafikusan is megadhato.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 13 / 54
12. Dontesanalızis ( DA Decision analysis)
Ez a modul negyfele dontesi feladat megoldasara alkalmazhato: Bayesanalızis, dontesi fa (varhato ertekek kiszamıtasara), kifizetesi tablazat(kulonbozo feltetelek alapjan), es ketszemelyes zerusosszegu jatek.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 14 / 54
13. Markov process (MKP Markov folyamat
Egy rendszer kulonbozo allapotokban van. Az ido mulasaval arendszer az egyik allapotbol atmegy egy masikba. A Markov folyamatmegadja ezen atmenetek valoszınuseget. Egy tipikus kozgazdasagipelda egy markavaltas (brand switching) a vasarlo reszerol. A modulkiszamolja a tartos allapotok valoszınusegeit es analizalja akoltsegeket es beveteleket.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 15 / 54
14. Minosegellenorzesi diagrammok (QCC qualitycontrol charts)
Ez a modul statisztikai analızist vegez es (21 fele) minosegellenorzesigrafikont keszıt. A kimenet tablazatosan es grafikusan is megadhato.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 16 / 54
15. Elfogadasi mintavetel analızis (ASA acceptancesampling analysis)
Az elfogadasi mintavetel analızis azt vizsgalja, hogy egytermekmennyiseg (minosede) vagy egy termelesi folyamatelfogadhato-e? Mintat veszunk es vizsgaljuk, hogy a hibas termekekaranya meghaladja-e az elfogadhato szintet. Ha igen, akkor a teljesmennyiseget elutasıtjuk (egyszeru mintavetel), vagy ismetelten mintatveszunk (dupla mintavetel). A modul hetfele mintaveteli eljarasalkalmazasat tamogatja.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 17 / 54
16. Munka es folyamat tervezes (JOB job scheduling)
A munka tervezesnel n-fele munka van melyeket m db. gepen kellelvegezni. Mindegyik munka eseten ismerjuk, hogy az egyes gepekmilyen sorrrendben es mennyi ideig kellenek az elvegzesere. A feladata munkak kiosztasa az egyes gepek kozott ugy, hogy a sorrendetbetartsuk es a gepkapacitast ne lepjuk tul.
A folyamat tervezesnel szinten n-fele munka van melyeket m db.gepen kell elvegezni. Itt minden munka eseten a gepek sorrendjeugyanaz. A feladat a munkak kiosztasa az egyes gepek kozott ugy,hogy a gepkapacitast ne lepjuk tul.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 18 / 54
17. Osszesıtett (aggregalt) tervezes (AP aggregateplanning)
Aggregate planning rendszerint eves vagy annal kisebb periodus fedle, foglalkozik a munkaero es anyagszukseglettel tovabba az elojelzetttermeles kapacitasigenyevel. A kimenet a termeles utemezese,munkaero es anyagszukseglet, tulora, alvallalkozoi igeny.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 19 / 54
18. Letesıtmeny helyenek es elrendezesenekoptimalizalasa (FLL facility location and layout)
Ez a modul ertekeli letesıtmenyek helyenek kivalasztasat ket vagyharom dimenzioban (uzem vagy raktar), berendezesek elhelyezeset,futoszalag tervezeset. A letesıtmenyek helyenek kivalasztasanal aprogram a sulyozott tavolsagokat minimalizalja.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 20 / 54
19. Anyagszukseglet tervezes (MRP materialrequirement planning)
Ez a modul termeleshez szukseges anyagszuksegletet vizsgalja.Meghatarozza az anyagszuksegletet, segıt az anyagrendelesektervezeseben, es elorevetıti az anyagok es reszegysegek leltarat.Elvegzi a kapacitas, koltseg es leltar analıziset.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 21 / 54
USING WINQSB
This section describes the common features of all 19 modules ofWinQSB.
After starting WinQSB, select the application you want to execute.You will see the screen with a tool bar consisting of file and help . Inthe file pull down menu, you will see the following options:
New problem
Load problem (previously saved problems),
Exit
Once the problem is entered, the tools bar will appear.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 22 / 54
file menu
The commands of the file menu:
New Problem: to start a new problem
Load Problem: to open and load a previously saved problem
Close Problem: to close the current problem
Save Problem: to save the current problem with the current file name
Save Problem As: to save the current problem under a new name
Print Problem: to print the problem
Print Font: to select the print font
Print Setup: to setup the print page
Exit: to exit the program
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 23 / 54
Edit menu
The commands of the Edit menu:
Cut: to copy the selected areas in the spreadsheet to the clipboard andclear the selected area
Copy: to copy the selected areas in the spreadsheet to the clipboard
Paste: to past the content of the clipboard to selected areas in thespreadsheet
Clear: to clear the selected areas in the spreadsheet
Undo: to undo the above action
Problem Name: to change the problem name
Other commands, which appear here, are applicable to the particularapplication you are using.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 24 / 54
Format menu
The commands of the Format menu:
Number: to change the number format for the current spreadsheet orgrid
Font: to change the font for the current spreadsheet or grid
Alignment: to change the alignment for selected columns or rows ofthe current spreadsheet or grid
Row Height: to change the height for the selected rows of the currentspreadsheet or grid
Column Width: to change the width for the selected columns of thecurrent spreadsheet or grid.
Other commands, which appear here, are applicable to the particularapplication you are using (more later on).
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 25 / 54
Solve and analyze menu
The commands of the Solve and analyze menu:
Solve the Problem: to solve the problem and display the results
Solve and Display Steps: to solve and display the solution iterationsstep by step
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 26 / 54
Result and Utility menu
The Result menu: this includes the options to display the solutionresults and analyses.
The commands of the Utility menu:
Calculator: pops open the Windows system calculator
Clock: display the Windows system clock
Graph/Chart: to call a general graph and chart designer
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 27 / 54
Window menu
The commands of the Window menu:
Cascade: to cascade windows for the current problem
Tile: to tile all windows for the current problem
Arrange Icons: to arrange all windows if they are minimized to icons
WinQSB menu: includes the option to switch to another applicationmodule without shutting down the WinQSB program .
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 28 / 54
Help menu
The commands of the Help menu:
Contents: to display the main help categories in the help file
Search for Help on: to start the search for a keyword in the help file
How to Use Help: to start the standard Windows help instruction
Help on Current window: to display the help for the current window.You can click any area of the window to display more information
About the Program: to display the short information about the program
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 29 / 54
Example: a two variable ILP problem
z = 20x1+ 30x2 → maximum, if
4x1 + 8x2 ≤ 100x2 ≤ 10 x1 ≥ 0, x2 ≥ 0.
6x1 + 4x2 ≤ 120x1, x2 are nonnegative integers.
(1)
Graphical solution: sketch on the plane the (x1, x2) domain satisfyingthe constraints. The objective function with constant value of z areparallel lines which have to have common points with the abovedomain. Hence we shift these lines parallel until we get the maximumon z. In our case this is x1 = 17.5, x2 = 3.75, zmax = 462.5. The nextfigure shows the domain satisfying the constraints colored by green.The parallel lines z = 20x1 + 30x2 or x2 = − x1
3 + z30 are shown by red
color for z = 0 and z = zmax = 462.5.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 30 / 54
Graphical solution
In this case however x1 = 17.5, x2 = 3.75 is not possible as thedecision variables are integers. We would have to find the point(s) inthe green area which have integer coordinates and for which the valueof z = 20x1 + 30x2 is the largest. In our case this is the pointx1 = 17, x2 = 4, zmax = 460.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 31 / 54
Example: a five variable LP problem
A five variables problem, solution by WinQSB
x1, x2, x3, x4, x5 ≥ 0,
x1 + 2x3 − 2x4 + 3x5 ≤ 60x1 + 3x2 + x3 + x5 ≤ 12
x2 + x3 + x4 ≤ 102x1 + 2x3 ≤ 20
3x1 + 4x2 + 5x3 + 3x4 − 2x5 = z → max or min
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 32 / 54
Data entry into WinQSB in matrix form
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 33 / 54
The table of solutions
Combined Report for eload1b Page 1 of 1
13:07:30 Sunday February 28 2010DecisionVariable
SolutionValue
Unit Cost orProfit c(j)
TotalContribution
ReducedCost
BasisStatus
AllowableMin. c(j)
AllowableMax. c(j)
1 X1 10,00 3,00 30,00 0 basic 2,00 M2 X2 0,67 4,00 2,67 0 basic 3,00 12,003 X3 0 5,00 0 -1,00 at bound -M 6,004 X4 9,33 3,00 28,00 0 basic 2,00 4,005 X5 0 -2,00 0 -2,33 at bound -M 0,33
Objective Function (Max.) = 60,67
Constraint
Left HandSide
Direction
Right HandSide
Slackor Surplus
ShadowPrice
AllowableMin. RHS
AllowableMax. RHS
1 C1 -8,67 <= 60,00 68,67 0 -8,67 M2 C2 12,00 <= 12,00 0 0,33 10,00 40,003 C3 10,00 <= 10,00 0 3,00 0,67 M4 C4 20,00 <= 20,00 0 1,33 0 24,00
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 34 / 54
Sensitivity analysis
The reduced cost appears at decision variables which have (theoptimal value) zero, and it shows the change of the objective functionwhen we require positive value for that decision variable (insteadrequiring it to be nonnegative only). For example at x3 = 0 thereduced cost is −1, which means that requiring x3 ≥ a3(> 0)instead of x3 ≥ 0 the objective function will (approximately)change by (−1) · a3.The shadow price appearing at a constraint shows that the change ofthe constant at the right hand side of the constraint how influences thevalue of the objective function. For example at the constraint C3 theshadow price is 3, this means that increasing the right hand sideof C3 by b3 (in our case to 10 + b3) the value of the objectivefunction will (approximately) change by 3b3 (positive sign meansincrease, negative decrease).The slack or surplus appearing at a constraint is the differencebetween the two sides of that constraint (at the optimal values of thedecision variables).
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 35 / 54
Solution table
The upper 1-5 lines of the last two columns show the lower and upperbounds of the coefficients in that decision variable in the objectivefunction by which there is still optimal solution of the problem.The last 4 lines of the last two columns show the maximum andminimum values of the right hand sides of the constraints by whichthere is still optimal solution.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 36 / 54
Network Modeling: transportation problem
The transportation problem deals with the distribution of goods fromseveral supply sources to several demand locations. Here theobjective is to ship the goods from supply sources to demand locationsat the lowest total cost. The transportation problem could be balanced(the supplies and demands are equal) or could be unbalanced(supplies and demand do not match).
Let’s look at the CMP furniture manufacturer’s dilemma. It hasproduction facilities in Nashville and Atlanta and its markets arc in NewYork, Miami, and Dallas. Production capacities and demands andtransport costs are given at the table below (supply demand in someunits, cost in $). CMP needs to decide how many of these unit need tobe shipped from Nashville and Atlanta to New York, Miami, and Dallasat the lowest total cost. This is a typical transportation problem.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 37 / 54
Example: a transportation problem
From/to New York Miami Dallas SupplyNashville 10 12 8 300Atlanta 7 10 14 500Demand 150 300 350
Total supply is 800 units, total demand is 800 units hence the supplycovers the demand.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 38 / 54
A transportation problem, as LP
Denote the number of units shipped from Nashville to the 3destinations by x11, x12, x13 respectively,and the number of units shipped from Atlanta to the 3 destinations byx21, x22, x23 respectively.Then we have to minimize the total cost being
z = 10x11 + 12x12 + 8x13 + 7x21 + 10x22 + 14x23
subject to the constraints:
x11 + x12 + x13 ≤ 300 supply constraint in Nashvillex21 + x22 + x23 ≤ 500 supply constraint in Atlanta
x11 + x21 = 150 demand satisfaction constraint in New Yorkx12 + x22 = 300 demand satisfaction constraint in Miamix13 + x23 = 350 demand satisfaction constraint in Dallas
To solve this problem, in Windows click on Start, Program, WinQSB,Network Modeling.(TRANSPORT.NET)
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 39 / 54
Network Modeling: an assignment problem
Assignment problem is a special type of network or linearprogramming problem where objects or assignees are being allocatedto assignments on a one-to-one basis. The object or assignee can bea resource, employee, machine, parking space, time slot, plant, orplayer, and the assignment can be an activity, task, site, event, asset,demand, or team.Our terminology: we assign agents to do tasks.The problem is ”linear” because the cost function to be optimized aswell as all the constraints contain only linear terms.The assignment problem is also considered as a special type oftransportation problem with unity supplies and demands and issolved by the network simplex method.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 40 / 54
Example an assignment problem
.A factory unit has 4 agents (workers) A1 (Tim), A2 (Peter), A3 (John),A4 (Rudy) and they have to make 4 different type of tasks (jobs):J1, J2, J3, J4. The next table shows how many hours each of themneeds to do the same jobs.
From/to J1 J2 J3 J4A1 (Tim) 3 6 7 10A2 (Peter) 5 6 3 8A3 (John) 2 8 4 16A4 (Rudy) 8 6 5 9
Which worker should be given the task (job) J1, J2, J3, J4 if all the 4jobs should be done in minimal time and each worker can be givenonly one type of job.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 41 / 54
An assignment problem
Let xij represent the assignment of agent Ai to the job Jj taking value1if the assignment is done and 0 otherwise.The objective function (cost)
z =3x11 + 6x12 + 7x13 + 10x14 + 5x21 + 5x22 + 3x23 + 8x24+2x31 + 8x32 + 4x33 + 16x34 + 8x41 + 6x42 + 5x43 + 9x44 = min.
(2)subject to the constraints:
x11 + x12 + x13 + x14 = 1 agent A1 performs one of the 4 jobsx21 + x22 + x23 + x24 = 1 agent A2 performs one of the 4 jobsx31 + x32 + x33 + x34 = 1 agent A3 performs one of the 4 jobsx41 + x42 + x43 + x44 = 1 agent A4 performs one of the 4 jobsx11 + x21 + x31 + x41 = 1 the job J1 is done by one of the 4 agentsx12 + x22 + x32 + x42 = 1 the job J2 is done by one of the 4 agentsx13 + x23 + x33 + x43 = 1 the job J3 is done by one of the 4 agentsx14 + x24 + x34 + x44 = 1 the job J4 is done by one of the 4 agents
(3)From the WinQSB menus, select the Network Modeling option(ASSIGN.NET)
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 42 / 54
Network Modeling: shortest path problem
The shortest path problem includes a set of connected nodes whereonly one node is considered as origin node and only one node isconsidered as destination node. The objective is to determine a pathof connections that minimizes the total distance from the origin to thedestination. The shortest path problem is solved by a LabelingAlgorithm. Let say CMP’s trucks can only travel between CMPheadquarters and its manufacturing plants in Nashville and Atlanta andits markets in Dallas, Miami and New York as shown in the next figure.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 43 / 54
A shortest path problem
The owner wants to know the shortest distance from headquartersto Miami. Select Network Modeling from the WinQSB menu, and thenselect Shortest Path Problem from the Problem Type option. ObjectiveCriterion is Minimization. Numbering the nodes are Dallas (1),Nashville (2), CMP (3), NYC (4), Atlanta (5), Miami (6).(SHORTEST.NET)
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 44 / 54
Network Modeling: maximal flow problem
You are in charge of civilian defense of a city. You need to evacuate thecity as quickly as possible. The road map for removing the citizens isshown in the next figure.
Capacities of roads in terms of the number of vehicles per minute. InWinQSB, select Network Modeling. In Problem Type, select MaximalFlow Problem. The Objective Criterion is by default Maximization.(EVACUATE.NET) Graphic solution.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 45 / 54
Network Modeling: a minimal spanning tree problem
CMP needs to install a sprinkler system in their office. The layout ofthe office shown in the next figure.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 46 / 54
a minimal spanning tree problem
CMP wants to minimize the total length of pipes to be installed. Theminimal spanning tree procedure is to be used here. From theWinQSB menu se Network Modeling. In NET Problem Specificationselect Minimal Spanning Tree. The Objective Criterion by default isMinimization. Select Spreadsheet Matrix Form. Problem name is CMPSafety. There are a total of nine nodes: Entrance, Lobby, Office,Control Room, Computer Room, Shop 1, Shop 2, Restroom, andStorage. Click OK. Now you will see the spreadsheet matrix input form.The node names are edited from default to actual names. Enter theappropriate distances in the from/to cells. After entering all data, clickon the Solve and Analyze button on the toolbar. The next screen willdisplay the solution in terms of sprinkler piping connection between thelocations. The total length of pipe is 507 feet. The graphical solutionoption gives you the graphical layout of different nodes and the pipingconnections between them.(SPRINKLER.NET) (symmetric arcs)
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 47 / 54
Network Modeling: traveling salesman problem
CMP has sales representatives visiting between headquarters, themanufacturing facilities, and their customers. A sales representativestarts the sales call from headquarters and must visit all the locationswithout revisiting them and then return to headquarters. This is theclassical traveling salesman problem. The next figure displays thelocation of all the facilities and their distances.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 48 / 54
The traveling salesman problem
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 49 / 54
The traveling salesman problem
In WinQSB select Network Modeling, then click on Traveling SalesmanProblem. The Objective Criterion is to minimize the total distance asales representative has to travel in visiting all of the places. We willuse Spreadsheet Matrix form for data input. Enter the name of theproblem in the Problem Title space. There are all together six places,hence enter Number of Nodes equal to six. Click OK. In input form editthe node variables from the Edit menu in the Toolbar and enter thenames of nodes. Enter the distance data in appropriate cells. Click onSolve and Analyze. From popup menu, select appropriate solutionmethod (here we have selected Branch and Bound Method) and clickSolve. The computer will display the solution on the screen. The salesperson should travel from CMP headquarters to New York and fromNew York to Atlanta, from Atlanta to to Miami, from Miami to Dallas,from Dallas to Nashville, from Nashville to CMP, with a total of 5330miles traveled. There is also a graphical solution option output.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 50 / 54
Network Modeling: transshipment problem
The next figure shows a network flow (transshipment) problem. Thereare two supply points S1,S2, three transshipment points T1,T2,T3 andtwo demand points D1,D2. Supply capacities and demandrequirements are shown in the circle and respective shipping costs areshown along the arrows in squares. The decision makers want to shipthe goods through transshipment points to demand points at the leastpossible cost. The total supply is 1200 units and the total demand isthe same.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 51 / 54
A transshipment problem
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 52 / 54
A transshipment problem
The mathematical formulation of this problem: let x11, x12, x13 denotethe number of units shipped from S1 to T1, T2, T3 respectively and letx21, x22, x23 be the number of units shipped from S2 to T1, T2, T3respectively. Further denote by y11, y12 the number of units shippedfrom T1 to D1, D2 respectively, y21, y22 the units shipped from T2 toD1, D2 respectively, and y31, y32 the number of units shipped from T3to D1, D2 respectively. The cost function
z = 4x11 + 5x12 + 3x22 + 6x23 + 3y11 + 4y21 + 2y22 + 3y32 (4)
should be minimized subject to the constraints
x11 + x12 + x13 ≤ 500 supply constraint at S1x21 + x22 + x23 ≤ 700 supply constraint at S2y11 + y21 + y31 = 800 demand at D1 must be satisfiedy12 + y22 + y32 = 400 demand at D2 must be satisfied
(5)
and all variables xij , yki should be nonnegative.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 53 / 54
Solution of the transshipment problem
Click on WinQSB, and in the popup menu select Network Modeling.From there select Problem Type: Network Flow. The ObjectiveCriterion is Minimization. Select Spreadsheet Matrix Form for dataentries. Enter Problem Title: Transshipment Problem. In our problemwe have seven nodes, hence enter Number of Nodes equals seven.Click OK. The screen will display a spreadsheet form for inputs withdefault node names. Click on EDIT on toolbar, select Node names andinput appropriate node names, one to be replaced by S1 and so onand click OK. Input the data, note that blank cells represent noconnections.Save it as TRSSHIPM.NET Now click on the Solve andAnalyze button on the toolbar and select Solve Problem. Minimal costis 7600 and in the solution the amount of units shipped (in variousways) will be displayed. If you want to see another form of the solution,click on result and then select graphical solution. The computer willdisplay the graphical representation of the solution.
Losonczi Laszlo (DE) Operacio kutatas: a WinQSB szoftver alkalmazasai 2011/12 tanev, I. felev 54 / 54