SOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH
|
|
- Lora Booker
- 6 years ago
- Views:
Transcription
1 Proceedngs of IICMA 2013 Research Topc, pp. xx-xx. SOLVIG CAPACITATED VEHICLE ROUTIG PROBLEMS WITH TIME WIDOWS BY GOAL PROGRAMMIG APPROACH ATMII DHORURI 1, EMIUGROHO RATA SARI 2, AD DWI LESTARI 3 1Department of Mathematcs, Yogyakarta State Unversty, atmn_uny@yahoo.co.d 2Department of Mathematcs, Yogyakarta State Unversty, emnugrohosar@gmal.com 3Department of Mathematcs, Yogyakarta State Unversty, dwlestar@uny.ac.d Abstract. Ths paper presents how to buld multobectve lnear programmng model as soluton of Capactated Vehcle Routng Problem wth Tme Wndows (CVRPTW). We use a goal programmng approach to solve the model. We have dscussed an obectve functon for two man goals: the frst s to mnmze the total number of vehcles and the second s to mnmze the travellng tme of the used vehcles. The proposed model s appled to a problem dstrbuton of Lquefed Petroleum Gas (LPG). Computatonal results of the proposed model are dscussed. Key words and Phrases: CVRPTW, goal programmng, obectve functon. 1. Introducton Several thngs that related to the dstrbuton problems are how many goods are dstrbuted, how the cost of dstrbuton should be spent, the route of dstrbuton, the travellng tme and the number of vehcles are used. Along wth the success of the converson program from kerosene to Lquefed Petroleum Gas (LPG), the needs of LPG are ncreased. PT Pertamna Persero as the company has maxmzed dstrbuton of LPG throughout the terrtory. But LPG shortages stll occurs. Consequently, the dstrbuton problems are mportant to be consdered. They are known as Vehcle Routng Problem (VRP).
2 ATMII D., EMIUGROHO R.S, AD DWI L. Vehcle Routng Problem (VRP) s a class of problem n whch a set of routes for a fleet of delvery vehcles based at one or several depots must be determned for a number of customers. Man obectve of VRP for servng known customer demands by a mnmum-cost vehcle routng startng and endng at a depot. Vehcle Routng Problem (VRP) whch reducng the cost whle delverng on tme, namely VRP Tme Wndows (VRPTW), has become popular ssue n optmzaton research. On the other hand, f the dstrbuton depends on the capacty of vehcle, t s called Capactated VRP (CVRP) [7]. In ths paper, we dscuss the CVRP wth tme wndows (CVRPTW). It means that the vehcles must arrve to the customer n a restrcted tme nterval whch s gven. It can be stated as follows: fnd a feasble soluton of the vehcles, so that to mnmze both, the number of vehcles used and the total travel tme. To solve the problem, we develop a goal programmng model whch has more than one goal n the obectve functon, even ts goal contradct each other. A goal programmng approach s an mportant technque for modellng and helpng decson-makers to solve mult obectve problems n fndng a set of feasble solutons. The purpose of goal programmng s to mnmze the devatons between the achevement of goals and ther aspraton levels [8]. Based on Az et.al [1], Jola and Aghdagh [4], f VRP has a tme constrans on the perods of the day n whch each customer must be vsted, t s called Vehcle Routng Problem wth Tme Wndow (VRPTW). Belfore, et.al [2], Calvete, et.al [3] and Hashmoto, et al [5] have developed VRP wth tme wndows. Ombuk, et.al [6] have appled a mult obectve genetcs algorthm to solve VRPTW. Sousa,et al [7] have used a mult obectve approach to solve a goods dstrbuton by The Just n Tme Delvery S.A, a dstrbuton company usng Mxed Integer Lnear Programmng. In ths paper, we present a goal programmng model as soluton of Capactated Vehcle Routng Problem wth Tme Wndows (CVRPTW). The obectve functon are two man goals: the frst s to mnmze the total number of vehcles and the second s to mnmze the travellng tme of the used vehcles. Computatonal results of the proposed model wll be dscussed. The paper s organzed as follows, n Secton 2: the mathematcal models of Capactated Vehcle Routng Problem wth Tme Wndows (CVRPTW). In Secton 3, Computatonal results of the proposed model usng a set of data obtaned. Fnally n Secton 4, we descrbe conclusons. 2. Mathematcal Models We formulate CVRPTW model wth 5 nodes (customers locaton) and reasonng as follow: - A fleet of vehcles wth restrcted and known capacty whch s needed to mnmze the number of vehcles. - One depot wth non restrcted and known capacty. 2
3 - A set of 5 nodes wth demand of goods, servce tme wndow, travellng tme. We assume that the average velocty of vehcle s constant. Let V = { 1, 2,..., v} represents the fleet of vehcles, = { 0,1,2,..., n + 1} meanng the set of all nodes ncludng depot, each node representng a customer locaton. Every vehcle must depart from depot and termnate at node n+1. We formulate the problem as a graph G(, A ) where A s the set of drected arc (the network connectons between the customer and the depot) [7]. Each connecton s assosated wth a travel tme tme,,,. Tme wndow for customer,,. It means the vehcle must arrve between that nterval tme. paper: The followng of mathematcal symbols and decson varables used n ths - C : the set of n customers. - The connecton between node to usng vehcle k. 1, actve xk,,, k V,, n + 1, 0. 0, not - t k : tme when vehcle k come on node,,, k V. -, : tme wndow for customer, D : demand or quantty of goods for customer,. - - : vehcle capacty, - T : constant parameter to consder n the tme wndow constrant. - : negatve devatonal varable of frst goal - : postve devatonal varable of second goal Goal Programmng Model goals: Goal 1 Goal 2 To generate a goal programmng model for the problem, we set the followng : mnmze the total number of vehcles/ avod underutlzaton of vehcle capacty : mnmze the travellng tme of the used vehcles. So the mathematc formulaton of goal programmng model s 3
4 ATMII D., EMIUGROHO R.S, AD DWI L. V 1 1k ω k Mn Z = ω d + d (1) subect to V xk tme d + 2 = 0. (2) k V xk = 1, C (3) k x0 k = 1, k V (4) xak xak = 0, C, k V (5) x, n+ 1, k = 1, k V (6) C k 1 k k, D x + d = Q k V (7) ( ) t + tme T 1 x t,,, k V, T + (8) k k k t t t,, k V (9) a k b { } x 0,1,,, k V (10) k t 0, C, k V (11) k Based on the model, Eq.(3) s a constrant to ensure that one vehcle vsts each customer only. Constrans n Eq.(4), Eq.(5), and Eq(6) to guarantee that each vehcle depart from depot, a vehcle unload the goods after comes to a customer and then go to the next customer. Eq.(7) shows the vehcles only maxmum loaded n ts capacty. The constrant n Eq.(8) guarantee feasblty of the tme schedule of a servce tme. Eq.(9) s a constrant that represent the tme wndows for every customer. Decson varables are represented by Eq.(10) and Eq.(11). 3. Computatonal Results In ths secton, we apply the model to the data that obtaned from PT Pertamna. The followng data ncludes tme dstance, demand, and tme wndows for every customer, see Table.1 and Table.2. 4
5 Table 1. Tme dstance between the nodes (mnutes) Tme unts Depot A B C D E Depot A B C D E Table 2. Demand and tme wndows for each customer Customer A B C D E Demand (unts) t a (tme unts) t b (tme unts) The customers can be descrbed lke shown as follows: Fgure 1. Depot and Customers A computatonal process s done usng LIGO. The followng result obtaned routes as Fg. 2. 5
6 ATMII D., EMIUGROHO R.S, AD DWI L Fgure 2. Depot and Customers Route Usng Vehcle s Capacty 300 unts Fgure 3. Depot and Customers Route Usng Vehcle s Capacty 560 unts Fgure 2 Shows that we need three vehcles to satsfy the customer s demand. If we ncrease the capacty of the vehcles to 560 unts, the result can be showed n Fg,3 above. It means, only needs two vehcles to dstrbute the demands. 4. Concluson In ths paper we proposed a mult obectve lnear programmng approach to solve a Capactated Vehcle Routng Problem wth Tme Wndows (CVRPTW). Two goals are to mnmze both, the number of vehcles used and the total travel tme. The model s appled n the dstrbuton of LPG wth fve customers. Tme wndows are very mportant to be consdered. So the travel tme can be mnmzed. As future development we suggest to mprove the method to solve CVRPTW. 6
7 References [1] Az., Gendreau M., Potvn J An exact algorthm for a sngle-vehcle routng problem wth tme wndows and multple routes; European Journal of Operatonal Research. 178 pp [2] Belfore, P., Hugo Tsugunobu, Yoshda Yoshzak Scatter Search for Vehcle Routng Problem wth Tme Wndows and Splt Delveres. Journal Complaton. I-Tech Educaton and Publshng KG, Venna, Austra. [3] Calvete H.I., Gale C., Olveros M.J Valverde B.S., A goal programmng approach to vehcle routng problems wth soft tme wndows; European Journal of Operatonal Research 177; [4] Jola, F. and Aghdagh, M A Goal Programmng Model for Sngle Vehcle Routng Problem wth Multple Routes. Journal of Industral and Systems Engneerng Vol. 2, o. 2, pp , Summer [5] Hashmoto H., Ibarak T., Imahor S., Yagura M The vehcle routng problem wth flexble tme wndows and travelng tmes; Dscrete Appled Mathematcs 154; [6] Ombuk B., Ross B.J., Hanshar F Mult-Obectve Genetc Algorthms for Vehcle Routng Problem wth Tme Wndows; Appled Intellgence 24; [7] Sousa, J.C., Bswas, H.A., Brto, R., and Slvera, A., A Mult Obectve Approach to Solve Capactated Vehcle Routng Problems wth Tme Wndows Usng Mxed Integer Lnear Programmng. Internatonal Journal of Advanced Scence and Technology, Vol. 28, March, [8] Taha, Hamdy Operaton Research 8 th ed. An Introducton. USA: Pearson Prentce hall. 7
The Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationAmiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business
Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationHeuristic Algorithm for Finding Sensitivity Analysis in Interval Solid Transportation Problems
Internatonal Journal of Innovatve Research n Advanced Engneerng (IJIRAE) ISSN: 349-63 Volume Issue 6 (July 04) http://rae.com Heurstc Algorm for Fndng Senstvty Analyss n Interval Sold Transportaton Problems
More informationA Simple Inventory System
A Smple Inventory System Lawrence M. Leems and Stephen K. Park, Dscrete-Event Smulaton: A Frst Course, Prentce Hall, 2006 Hu Chen Computer Scence Vrgna State Unversty Petersburg, Vrgna February 8, 2017
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationCombining Constraint Programming and Integer Programming
Combnng Constrant Programmng and Integer Programmng GLOBAL CONSTRAINT OPTIMIZATION COMPONENT Specal Purpose Algorthm mn c T x +(x- 0 ) x( + ()) =1 x( - ()) =1 FILTERING ALGORITHM COST-BASED FILTERING ALGORITHM
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationAn Optimization Model for Routing in Low Earth Orbit Satellite Constellations
An Optmzaton Model for Routng n Low Earth Orbt Satellte Constellatons A. Ferrera J. Galter P. Mahey Inra Inra Inra Afonso.Ferrera@sopha.nra.fr Jerome.Galter@nra.fr Phlppe.Mahey@sma.fr G. Mateus A. Olvera
More informationA Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows and Split Deliveries
A Tabu Search Heurstc for the Vehcle Routng Problem wth Tme Wndows and Splt Delveres Sn C. Ho and Dag Haugland Department of Informatcs Unversty of Bergen N-5020 Bergen, Norway 4th September 2002 Abstract
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationJournal of Applied Science and Agriculture
AENSI Journals Journal of Appled Scence and Agrculture Journal home page: www.aensweb.com/asa/nde.html Developng a New Mult-Obectve Model for Locaton-Routng Problem along wth Travelng Tmes and Fuzzy Due
More informationSingle-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition
Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationApplication of Queuing Theory to Waiting Time of Out-Patients in Hospitals.
Applcaton of Queung Theory to Watng Tme of Out-Patents n Hosptals. R.A. Adeleke *, O.D. Ogunwale, and O.Y. Hald. Department of Mathematcal Scences, Unversty of Ado-Ekt, Ado-Ekt, Ekt State, Ngera. E-mal:
More informationChapter 9: Statistical Inference and the Relationship between Two Variables
Chapter 9: Statstcal Inference and the Relatonshp between Two Varables Key Words The Regresson Model The Sample Regresson Equaton The Pearson Correlaton Coeffcent Learnng Outcomes After studyng ths chapter,
More informationFuzzy approach to solve multi-objective capacitated transportation problem
Internatonal Journal of Bonformatcs Research, ISSN: 0975 087, Volume, Issue, 00, -0-4 Fuzzy aroach to solve mult-objectve caactated transortaton roblem Lohgaonkar M. H. and Bajaj V. H.* * Deartment of
More informationSuccess of Heuristics and the Solution Space Representation
Magyar Kutatók 7. Nemzetköz Szmpózuma 7 th Internatonal Symposum of Hungaran Researchers on Computatonal Intellgence Success of Heurstcs and the Soluton Space Representaton Sándor Csszár Department of
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationComplement of Type-2 Fuzzy Shortest Path Using Possibility Measure
Intern. J. Fuzzy Mathematcal rchve Vol. 5, No., 04, 9-7 ISSN: 30 34 (P, 30 350 (onlne Publshed on 5 November 04 www.researchmathsc.org Internatonal Journal of Complement of Type- Fuzzy Shortest Path Usng
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationCustomer Selection and Profit Maximization in Vehicle Routing Problems
Customer Selecton and Proft Maxmzaton n Vehcle Routng Problems Denz Aksen 1, Necat Aras 2 1 Koç Unversty, College of Admnstratve Scences and Economcs, Rumelfener Yolu, Sarıyer, 34450 İstanbul, Turkey 2
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationLecture 10 Support Vector Machines. Oct
Lecture 10 Support Vector Machnes Oct - 20-2008 Lnear Separators Whch of the lnear separators s optmal? Concept of Margn Recall that n Perceptron, we learned that the convergence rate of the Perceptron
More informationInternational Journal of Industrial Engineering Computations
Internatonal Journal of Industral Engneerng Computatons 3 (2012) 403 412 Contents lsts avalable at GrowngScence Internatonal Journal of Industral Engneerng Computatons homepage: www.growngscence.com/ec
More informationMaximizing Overlap of Large Primary Sampling Units in Repeated Sampling: A comparison of Ernst s Method with Ohlsson s Method
Maxmzng Overlap of Large Prmary Samplng Unts n Repeated Samplng: A comparson of Ernst s Method wth Ohlsson s Method Red Rottach and Padrac Murphy 1 U.S. Census Bureau 4600 Slver Hll Road, Washngton DC
More informationA HYBRID DIFFERENTIAL EVOLUTION -ITERATIVE GREEDY SEARCH ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM
IJCMA: Vol. 6, No. 1, January-June 2012, pp. 1-19 Global Research Publcatons A HYBRID DIFFERENTIAL EVOLUTION -ITERATIVE GREEDY SEARCH ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM S. Kavtha and Nrmala
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationPickup and Delivery with Time Windows : Algorithms and Test Case Generation
Pckup and Delvery wth Tme Wndows : Algorthms and Test ase Generaton oong hun LAU Zhe LIANG School of omputng, Natonal Unversty of Sngapore lauhc@comp.nus.edu.sg langzhe@comp.nus.edu.sg Abstract In the
More informationIntegrated approach in solving parallel machine scheduling and location (ScheLoc) problem
Internatonal Journal of Industral Engneerng Computatons 7 (2016) 573 584 Contents lsts avalable at GrowngScence Internatonal Journal of Industral Engneerng Computatons homepage: www.growngscence.com/ec
More informationChapter - 2. Distribution System Power Flow Analysis
Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationAn Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
An Upper Bound on SINR Threshold for Call Admsson Control n Multple-Class CDMA Systems wth Imperfect ower-control Mahmoud El-Sayes MacDonald, Dettwler and Assocates td. (MDA) Toronto, Canada melsayes@hotmal.com
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationSOLVING MULTI-OBJECTIVE INTERVAL TRANSPORTATION PROBLEM USING GREY SITUATION DECISION-MAKING THEORY BASED ON GREY NUMBERS
Internatonal Journal of Pure and Appled Mathematcs Volume 113 No. 2 2017, 219-233 ISSN: 1311-8080 (prnted verson; ISSN: 1314-3395 (on-lne verson url: http://www.pam.eu do: 10.12732/pam.v1132.3 PApam.eu
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationOPTIMISATION. Introduction Single Variable Unconstrained Optimisation Multivariable Unconstrained Optimisation Linear Programming
OPTIMIATION Introducton ngle Varable Unconstraned Optmsaton Multvarable Unconstraned Optmsaton Lnear Programmng Chapter Optmsaton /. Introducton In an engneerng analss, sometmes etremtes, ether mnmum or
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationUncertain Models for Bed Allocation
www.ccsenet.org/ghs Global Journal of Health Scence Vol., No. ; October 00 Uncertan Models for Bed Allocaton Lng Gao (Correspondng author) College of Scence, Guln Unversty of Technology Box 733, Guln 54004,
More informationBALANCING OF U-SHAPED ASSEMBLY LINE
BALANCING OF U-SHAPED ASSEMBLY LINE Nuchsara Krengkorakot, Naln Panthong and Rapeepan Ptakaso Industral Engneerng Department, Faculty of Engneerng, Ubon Rajathanee Unversty, Thaland Emal: ennuchkr@ubu.ac.th
More informationTRAPEZOIDAL FUZZY NUMBERS FOR THE TRANSPORTATION PROBLEM. Abstract
TRAPEZOIDAL FUZZY NUMBERS FOR THE TRANSPORTATION PROBLEM ARINDAM CHAUDHURI* Lecturer (Mathematcs & Computer Scence) Meghnad Saha Insttute of Technology, Kolkata, Inda arndam_chau@yahoo.co.n *correspondng
More informationStatistics for Managers Using Microsoft Excel/SPSS Chapter 13 The Simple Linear Regression Model and Correlation
Statstcs for Managers Usng Mcrosoft Excel/SPSS Chapter 13 The Smple Lnear Regresson Model and Correlaton 1999 Prentce-Hall, Inc. Chap. 13-1 Chapter Topcs Types of Regresson Models Determnng the Smple Lnear
More informationResearch on Route guidance of logistic scheduling problem under fuzzy time window
Advanced Scence and Technology Letters, pp.21-30 http://dx.do.org/10.14257/astl.2014.78.05 Research on Route gudance of logstc schedulng problem under fuzzy tme wndow Yuqang Chen 1, Janlan Guo 2 * Department
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationOptimal Solution to the Problem of Balanced Academic Curriculum Problem Using Tabu Search
Optmal Soluton to the Problem of Balanced Academc Currculum Problem Usng Tabu Search Lorna V. Rosas-Téllez 1, José L. Martínez-Flores 2, and Vttoro Zanella-Palacos 1 1 Engneerng Department,Unversdad Popular
More informationClassification, Models and Exact Algorithms for Multi-Compartment Delivery Problems
Classfcaton, Models and Exact Algorthms for Mult-Compartment Delvery Problems Leandro C. Coelho Glbert Laporte June 2013 CIRRELT-2013-39 Bureaux de Montréal : Bureaux de Québec : Unversté de Montréal Unversté
More informationCS : Algorithms and Uncertainty Lecture 17 Date: October 26, 2016
CS 29-128: Algorthms and Uncertanty Lecture 17 Date: October 26, 2016 Instructor: Nkhl Bansal Scrbe: Mchael Denns 1 Introducton In ths lecture we wll be lookng nto the secretary problem, and an nterestng
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationIJRSS Volume 2, Issue 2 ISSN:
IJRSS Volume, Issue ISSN: 49-496 An Algorthm To Fnd Optmum Cost Tme Trade Off Pars In A Fractonal Capactated Transportaton Problem Wth Restrcted Flow KAVITA GUPTA* S.R. ARORA** _ Abstract: Ths paper presents
More informationSolving a bi-objective vehicle routing problem under uncertainty by a revised multichoice goal programming approach
Internatonal Journal of Industral Engneerng Computatons 8 (2017) 283 302 Contents lsts avalable at GrowngScence Internatonal Journal of Industral Engneerng Computatons homepage: www.growngscence.com/jec
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationA LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS. Dr. Derald E. Wentzien, Wesley College, (302) ,
A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS Dr. Derald E. Wentzen, Wesley College, (302) 736-2574, wentzde@wesley.edu ABSTRACT A lnear programmng model s developed and used to compare
More informationChapter 2 A Class of Robust Solution for Linear Bilevel Programming
Chapter 2 A Class of Robust Soluton for Lnear Blevel Programmng Bo Lu, Bo L and Yan L Abstract Under the way of the centralzed decson-makng, the lnear b-level programmng (BLP) whose coeffcents are supposed
More informationIrene Hepzibah.R 1 and Vidhya.R 2
Internatonal Journal of Scentfc & Engneerng Research, Volume 5, Issue 3, March-204 374 ISSN 2229-558 INTUITIONISTIC FUZZY MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM (IFMOLPP) USING TAYLOR SERIES APPROACH
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationHongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)
ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of
More informationOptimal Scheduling Algorithms to Minimize Total Flowtime on a Two-Machine Permutation Flowshop with Limited Waiting Times and Ready Times of Jobs
Optmal Schedulng Algorthms to Mnmze Total Flowtme on a Two-Machne Permutaton Flowshop wth Lmted Watng Tmes and Ready Tmes of Jobs Seong-Woo Cho Dept. Of Busness Admnstraton, Kyongg Unversty, Suwon-s, 443-760,
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationOn an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1
On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool
More informationPortfolios with Trading Constraints and Payout Restrictions
Portfolos wth Tradng Constrants and Payout Restrctons John R. Brge Northwestern Unversty (ont wor wth Chrs Donohue Xaodong Xu and Gongyun Zhao) 1 General Problem (Very) long-term nvestor (eample: unversty
More informationA New Evolutionary Computation Based Approach for Learning Bayesian Network
Avalable onlne at www.scencedrect.com Proceda Engneerng 15 (2011) 4026 4030 Advanced n Control Engneerng and Informaton Scence A New Evolutonary Computaton Based Approach for Learnng Bayesan Network Yungang
More informationA New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems
Appled Mathematcal Scences, Vol. 4, 200, no. 2, 79-90 A New Algorthm for Fndng a Fuzzy Optmal Soluton for Fuzzy Transportaton Problems P. Pandan and G. Nataraan Department of Mathematcs, School of Scence
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationAn Admission Control Algorithm in Cloud Computing Systems
An Admsson Control Algorthm n Cloud Computng Systems Authors: Frank Yeong-Sung Ln Department of Informaton Management Natonal Tawan Unversty Tape, Tawan, R.O.C. ysln@m.ntu.edu.tw Yngje Lan Management Scence
More informationEn Route Traffic Optimization to Reduce Environmental Impact
En Route Traffc Optmzaton to Reduce Envronmental Impact John-Paul Clarke Assocate Professor of Aerospace Engneerng Drector of the Ar Transportaton Laboratory Georga Insttute of Technology Outlne 1. Introducton
More informationStatistics for Economics & Business
Statstcs for Economcs & Busness Smple Lnear Regresson Learnng Objectves In ths chapter, you learn: How to use regresson analyss to predct the value of a dependent varable based on an ndependent varable
More informationFlexible Allocation of Capacity in Multi-Cell CDMA Networks
Flexble Allocaton of Capacty n Mult-Cell CDMA Networs Robert Al, Manu Hegde, Mort Naragh-Pour*, Paul Mn Washngton Unversty, St. Lous, MO *Lousana State Unversty, Baton Rouge, LA Outlne Capacty and Probablty
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationGlobal Optimization of Bilinear Generalized Disjunctive Programs
Global Optmzaton o Blnear Generalzed Dsunctve Programs Juan Pablo Ruz Ignaco E. Grossmann Department o Chemcal Engneerng Center or Advanced Process Decson-mang Unversty Pttsburgh, PA 15213 1 Non-Convex
More informationEffective Power Optimization combining Placement, Sizing, and Multi-Vt techniques
Effectve Power Optmzaton combnng Placement, Szng, and Mult-Vt technques Tao Luo, Davd Newmark*, and Davd Z Pan Department of Electrcal and Computer Engneerng, Unversty of Texas at Austn *Advanced Mcro
More informationRao IIT Academy/ SSC - Board Exam 2018 / Mathematics Code-A / QP + Solutions JEE MEDICAL-UG BOARDS KVPY NTSE OLYMPIADS SSC - BOARD
Rao IIT Academy/ SSC - Board Exam 08 / Mathematcs Code-A / QP + Solutons JEE MEDICAL-UG BOARDS KVPY NTSE OLYMPIADS SSC - BOARD - 08 Date: 0.03.08 MATHEMATICS - PAPER- - SOLUTIONS Q. Attempt any FIVE of
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationA Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function
A Local Varatonal Problem of Second Order for a Class of Optmal Control Problems wth Nonsmooth Objectve Functon Alexander P. Afanasev Insttute for Informaton Transmsson Problems, Russan Academy of Scences,
More informationA Multi-restart Deterministic Annealing Metaheuristic for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
A Mult-restart Determnstc Annealng Metaheurstc for the Fleet Sze and M Vehcle Routng Problem wth Tme Wndows Oll Bräysy Agora Innoroad Laboratory, P.O.Bo 35, FI-40014 Unversty of Jyväsylä, Fnland Wout Dullaert
More informationCorrelation and Regression. Correlation 9.1. Correlation. Chapter 9
Chapter 9 Correlaton and Regresson 9. Correlaton Correlaton A correlaton s a relatonshp between two varables. The data can be represented b the ordered pars (, ) where s the ndependent (or eplanator) varable,
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationOn the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros
Appled Mathematcal Scences, Vol. 5, 2011, no. 75, 3693-3706 On the Interval Zoro Symmetrc Sngle-step Procedure for Smultaneous Fndng of Polynomal Zeros S. F. M. Rusl, M. Mons, M. A. Hassan and W. J. Leong
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More informatione - c o m p a n i o n
OPERATIONS RESEARCH http://dxdoorg/0287/opre007ec e - c o m p a n o n ONLY AVAILABLE IN ELECTRONIC FORM 202 INFORMS Electronc Companon Generalzed Quantty Competton for Multple Products and Loss of Effcency
More informationDetermine the Optimal Order Quantity in Multi-items&s EOQ Model with Backorder
Australan Journal of Basc and Appled Scences, 5(7): 863-873, 0 ISSN 99-878 Determne the Optmal Order Quantty n Mult-tems&s EOQ Model wth Backorder Babak Khabr, Had Nasser, 3 Ehsan Ehsan and Nma Kazem Department
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationNon-linear Canonical Correlation Analysis Using a RBF Network
ESANN' proceedngs - European Smposum on Artfcal Neural Networks Bruges (Belgum), 4-6 Aprl, d-sde publ., ISBN -97--, pp. 57-5 Non-lnear Canoncal Correlaton Analss Usng a RBF Network Sukhbnder Kumar, Elane
More information