Improving Strong Branching by Domain Propagation
|
|
- Morgan Sharp
- 6 years ago
- Views:
Transcription
1 Improving Strong Branching by Domain Propagation Gerald Gamrath Zuse Institute Berlin Berlin Mathematical School 18 th Combinatorial Optimization Workshop, Aussois, 7 January 2014
2 Branching on Variables for MIPs Goals Tools increase child nodes dual bounds prove optimality fast LP solution value history information strong branching Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 2 / 19
3 Branching on Variables for MIPs Goals Tools increase child nodes dual bounds prove optimality fast LP solution value history information strong branching Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 2 / 19
4 Quality of Strong Branching Results strong branching dual bounds vs. LP value during node processing 1158 objective value instance: aflow30a (MIPLIB 2003), full strong branching, optimum value provided, solved after 87 nodes Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 3 / 19
5 Domain Propagation (Node Preprocessing) Idea: analyze local constraints and domains tighten local variable domains first step in node processing better dual bounds x 1 x 2 x 3 x 4 x 1 x 2 x 3 x 4 Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 4 / 19
6 Domain Propagation (Node Preprocessing) Idea: analyze local constraints and domains tighten local variable domains first step in node processing better dual bounds x 1 x 2 x 3 x 4 x 1 x 2 x 3 x 4 Idea of this talk Strong branching should consider the effects of domain propagation! Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 4 / 19
7 Strong Branching with Domain Propagation Strong Branching with Domain Propagation (SBDP): add branching bound perform default domain propagation solve LP SBDP Add Bound Change Domain Propagation Infeasible? return Solve LP Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 5 / 19
8 Strong Branching with Domain Propagation Strong Branching with Domain Propagation (SBDP): add branching bound perform default domain propagation solve LP Open Questions: better predictions? change in strong branching effort? overall impact? SBDP Add Bound Change Domain Propagation Infeasible? return Solve LP Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 5 / 19
9 Implementation into SCIP SCIP: Solving Constraint Integer Programs standalone solver / branch-cut-and-price-framework modular structure via plugins free for academic use: available in source code very fast non-commercial MIP solver GLPK x 3.94x non-commercial commercial lpsolve CBC SCIP CLP x SCIP SoPlex SCIP Cplex x 1.00x 0.77x Xpress x 0.19x Cplex x 0 Gurobi solved (of 87 instances) results by H. Mittelmann on MIPLIB2010 (January 2013) time in seconds Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 6 / 19
10 Computational Experiment: Single Calls 168 instances (MIPLIB 3, 2003, 2010 benchmark) excluded infeasible instances + instances without branching 147 instances left time limit: 2 hours full strong branching optimal solution value provided heuristics, separation turned off SBDP in addition to standard strong branching only standard strong branching results used for branching Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 7 / 19
11 First Computational Insights Compare single strong branching (SB) calls SB children detected infeasible: 14% 17% 15% during propagation SB children with better dual bound: 5.6% gap closed by 20% on average LP iterations: infeasible children: 18% better dual bounds: + 30% all other SB children: 4% Domain propagation time: about 5% SB time increased by about 1% Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 8 / 19
12 Update: Quality of Strong Branching Results SBDP dual bounds vs. LP value during node processing 1158 objective value instance: aflow30a (MIPLIB 2003), full strong branching, optimum value provided, solved after 81 nodes Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 9 / 19
13 Further Improvements Let s add some more things: additional statistics: implications, cutoffs, conflicts Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 10 / 19
14 Further Improvements Let s add some more things: additional statistics: implications, cutoffs, conflicts stop when infeasible up-child first use locking numbers x 1 x 2 Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 10 / 19
15 Further Improvements Let s add some more things: additional statistics: implications, cutoffs, conflicts stop when infeasible up-child first use locking numbers x 1 x 2 Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 10 / 19
16 Further Improvements Let s add some more things: additional statistics: implications, cutoffs, conflicts stop when infeasible up-child first use locking numbers x 2 x 1 x 2 Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 10 / 19
17 Further Improvements Let s add some more things: additional statistics: implications, cutoffs, conflicts stop when infeasible up-child first use locking numbers check SB solutions for integrality simple rounding heuristic x 1 x 2 Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 10 / 19
18 Further Improvements Let s add some more things: additional statistics: implications, cutoffs, conflicts stop when infeasible up-child first use locking numbers check SB solutions for integrality simple rounding heuristic x 1 x 2 Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 10 / 19
19 Further Improvements Let s add some more things: additional statistics: implications, cutoffs, conflicts stop when infeasible x 2 up-child first use locking numbers check SB solutions for integrality simple rounding heuristic x 1 x 2 Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 10 / 19
20 Further Improvements Let s add some more things: additional statistics: implications, cutoffs, conflicts stop when infeasible up-child first use locking numbers check SB solutions for integrality simple rounding heuristic probing-like bound tightening x 1 x 2 Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 10 / 19
21 Further Improvements Let s add some more things: additional statistics: implications, cutoffs, conflicts stop when infeasible up-child first use locking numbers check SB solutions for integrality simple rounding heuristic probing-like bound tightening x 1 x 2 y 5 y 4 Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 10 / 19
22 Further Improvements Let s add some more things: additional statistics: implications, cutoffs, conflicts stop when infeasible up-child first use locking numbers check SB solutions for integrality simple rounding heuristic probing-like bound tightening y 5 x 1 x 2 y 5 y 4 Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 10 / 19
23 Computational Experiment: Proving Optimality all 168 instances (MIPLIB 3, 2003, 2010 benchmark) time limit: 2 hours original + 3 random permutations to reduce performance variability arithmetic mean of solving time and node number per instance instances solved iff all four permutations were solved full strong branching optimal solution value provided heuristics, separation turned off two individual runs compare B&B tree and solving time Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 11 / 19
24 Number of Nodes: Proving Optimality relative change of number of nodes when using SBDP only instances solved to optimality by both variants % change in #nodes instance shifted geometric mean reduced by 25% Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 12 / 19
25 Performance Diagram: Proving Optimality number of solved instances (of 168) w/o propagation with propagation time result: 7 more instances solved, shifted geom. time reduced by 13% Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 13 / 19
26 Hybrid Branching extension of reliability pseudo-cost branching + other history information inferences, conflicts, cutoffs strong branching LP iteration limit lookahead strategy What does this mean for SDBP? smaller strong branching impact but: first branchings most important initializes other history information as well SBDP reaches LP iteration limit twice as often: 10% instead of 5% less stable Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 14 / 19
27 Computational Experiment: Hybrid Branching all 168 instances (MIPLIB 3, 2003, 2010 benchmark) time limit: 2 hours original + 3 random permutations to reduce performance variability arithmetic mean of solving time and node number per instance instances solved iff all four permutations were solved hybrid branching SCIP default settings two individual runs compare B&B tree and solving time Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 15 / 19
28 Number of Nodes: Hybrid Branching relative change of number of nodes when using SBDP only instances solved to optimality by both variants % change in #nodes % 643% instance shifted geometric mean reduced by 7% Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 16 / 19
29 Performance Diagram: Hybrid Branching number of solved instances (of 168) w/o propagation with propagation time result: shifted geom. time reduced by 4% Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 17 / 19
30 Conclusions Domain propagation in strong branching... increases strong branching time marginally improves dual bound predictions decreases tree size significantly improves performance of two common branching rules default in SCIP 3.1 Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 18 / 19
31 Conclusions Domain propagation in strong branching... increases strong branching time marginally improves dual bound predictions decreases tree size significantly improves performance of two common branching rules default in SCIP 3.1 Next Steps test on other problem types dynamic (de)activation of domain propagation nonchimerical + cloud + propagation =? Gerald Gamrath (Zuse Institute Berlin): Improving Strong Branching by Domain Propagation 18 / 19
32 Improving Strong Branching by Domain Propagation Gerald Gamrath Zuse Institute Berlin Berlin Mathematical School 18 th Combinatorial Optimization Workshop, Aussois, 7 January 2014
Tackling Industrial-Scale Supply Chain Problems by Mixed-Integer Programming
Zuse Institute Berlin Takustr. 7 14195 Berlin Germany GERALD GAMRATH, AMBROS GLEIXNER, THORSTEN KOCH, MATTHIAS MILTENBERGER, DIMITRI KNIASEW, DOMINIK SCHLÖGEL, ALEXANDER MARTIN, AND DIETER WENINGER Tackling
More informationBusiness and Mathematics: A Saga of 25 Years of Progress in Optimization. Robert E. Bixby
Business and Mathematics: A Saga of 25 Years of Progress in Optimization Robert E. Bixby A Short Bio 1972: Ph.D. Operations Research, Cornell 1972-1985: Very theoretical research in OR 1980: IBM PCs introduced,
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 informationReoptimization Gaps versus Model Errors in Online-Dispatching of Service Units for ADAC
Konrad-Zuse-Zentrum fu r Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany BENJAMIN HILLER SVEN O. KRUMKE JO RG RAMBAU Reoptimization Gaps versus Model Errors in Online-Dispatching
More informationOn Refining Ill-Defined Constraint Problems: A Case Study in Iterative Prototyping
On Refining Ill-Defined Constraint Problems: A Case Study in Iterative Prototyping Carmen Gervet Yves Caseau Denis Montaut IC-Parc, Imperial College Bouygues, D.T.N. Euro-Decision London SW7 2AZ 1 av.
More informationStrengths & Drawbacks of MILP, CP and Discrete-Event Simulation based Approaches for Large-Scale Scheduling
Strengths & Drawbacks of MILP, CP and Discrete-Event Simulation based Approaches for Large-Scale Scheduling Pedro M. Castro Assistant Researcher Laboratório Nacional de Energia e Geologia Lisboa, Portugal
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 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 informationA Branch-and-Price Algorithm for the Vehicle Routing Problem with Roaming Delivery Locations
A Branch-and-Price Algorithm for the Vehicle Routing Problem with Roaming Delivery Locations Gizem Ozbaygin 1,2, Oya Karasan 2, Martin Savelsbergh 1, and Hande Yaman 2 1 H. Milton Stewart School of Industrial
More informationNext generation energy modelling Benefits of applying parallel optimization and high performance computing
Next generation energy modelling Benefits of applying parallel optimization and high performance computing Frieder Borggrefe System Analysis and Technology Assessment DLR - German Aerospace Center Stuttgart
More informationOptimization under Uncertainty. with Applications
with Applications Professor Alexei A. Gaivoronski Department of Industrial Economics and Technology Management Norwegian University of Science and Technology Alexei.Gaivoronski@iot.ntnu.no 1 Lecture 2
More informationDeterministic Global Optimization
Joseph-Sommer-Straße 34, 41812 Erkelenz, Tel.: 02431 9026710, Fax: 02431 9026711 91 st Meeting of the GOR Working Group Praxis der Mathematischen Optimierung ( Real World Mathematical Optimization ) Deterministic
More informationSolving an integrated Job-Shop problem with human resource constraints
Solving an integrated Job-Shop problem with human resource constraints PMS 10 - Tours (France) O. Guyon 1.2, P. Lemaire 3, É. Pinson 2 and D. Rivreau 2 1 École des Mines de Saint-Étienne 2 LISA - Institut
More informationA decomposition approach to dual shuttle automated storage and retrieval systems
A decomposition approach to dual shuttle automated storage and retrieval systems Tony Wauters a, Fulgencia Villa b, Jan Christiaens a, Ramon Alvarez Valdes c, Greet Vanden Berghe a a KU Leuven, Department
More informationCOMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO
COMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO Bathrinath S. 1, Saravanasankar S. 1 and Ponnambalam SG. 2 1 Department of Mechanical Engineering, Kalasalingam
More informationProduction Scheduling of an Emulsion Polymerization Process
A publication of 1177 CHEMICAL ENGINEERING TRANSACTIONS VOL. 32, 2013 Chief Editors: Sauro Pierucci, Jiří J. Klemeš Copyright 2013, AIDIC Servizi S.r.l., ISBN 978-88-95608-23-5; ISSN 1974-9791 The Italian
More informationISE480 Sequencing and Scheduling
ISE480 Sequencing and Scheduling INTRODUCTION ISE480 Sequencing and Scheduling 2012 2013 Spring term What is Scheduling About? Planning (deciding what to do) and scheduling (setting an order and time for
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 informationWhat is Evolutionary Computation? Genetic Algorithms. Components of Evolutionary Computing. The Argument. When changes occur...
What is Evolutionary Computation? Genetic Algorithms Russell & Norvig, Cha. 4.3 An abstraction from the theory of biological evolution that is used to create optimization procedures or methodologies, usually
More informationarxiv: v2 [cs.ai] 15 Apr 2014
Auction optimization with models learned from data arxiv:1401.1061v2 [cs.ai] 15 Apr 2014 Sicco Verwer Yingqian Zhang Qing Chuan Ye Abstract In a sequential auction with multiple bidding agents, it is highly
More informationThe evolution of optimization technologies
The evolution of optimization technologies Dash Optimization, Alkis Vazacopoulos INFORMS New York Metro Club October 11, 2005, The Penn Club, New York Agenda Optimization Applications Companies that offer
More informationA Genetic Algorithm for a Bicriteria Supplier Selection Problem
A Genetic Algorithm for a Bicriteria Supplier Selection Problem Chuda Basnet Waikato Management School The University of Waikato Hamilton, New Zealand chuda@waikato.ac.nz Andres Weintraub Department of
More informationSingle Machine Scheduling with Interfering Job Sets
Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 009) 0- August 009, Dublin, Ireland MISTA 009 Single Machine Scheduling with Interfering Job Sets Ketan Khowala,
More informationReport on Demand Response Algorithms
FLEXMETER 646568 D4.4 Report on Demand Response Algorithms H2020-LCE-2014-3 Public H2020-LCE-2014-3 FLEXMETER Flexible smart metering for multiple energy vectors with active prosumers Project Duration
More informationTIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS. Liviu Lalescu, Costin Badica
TIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS Liviu Lalescu, Costin Badica University of Craiova, Faculty of Control, Computers and Electronics Software Engineering Department, str.tehnicii, 5, Craiova,
More informationLogistics. Final exam date. Project Presentation. Plan for this week. Evolutionary Algorithms. Crossover and Mutation
Logistics Crossover and Mutation Assignments Checkpoint -- Problem Graded -- comments on mycourses Checkpoint --Framework Mostly all graded -- comments on mycourses Checkpoint -- Genotype / Phenotype Due
More informationMachine Learning. Genetic Algorithms
Machine Learning Genetic Algorithms Genetic Algorithms Developed: USA in the 1970 s Early names: J. Holland, K. DeJong, D. Goldberg Typically applied to: discrete parameter optimization Attributed features:
More informationMachine Learning. Genetic Algorithms
Machine Learning Genetic Algorithms Genetic Algorithms Developed: USA in the 1970 s Early names: J. Holland, K. DeJong, D. Goldberg Typically applied to: discrete parameter optimization Attributed features:
More informationScheduling of Maintenance Tasks and Routing of a Joint Vessel Fleet for Multiple Offshore Wind Farms
Journal of Marine Science and Engineering Article Scheduling of Maintenance Tasks and Routing of a Joint Vessel Fleet for Multiple Offshore Wind Farms Nora Tangen Raknes 1, Katrine Ødeskaug 1, Magnus Stålhane
More informationJob Selection and Sequencing with Identical Tardiness Penalties
Job Selection and Sequencing with Identical Tardiness Penalties In the classical sequencing problem a set of available jobs exists, and the problem is to schedule those jobs in the presence of a limited
More informationHow the European day-ahead electricity market works
How the European day-ahead electricity market works ELEC0018-1 - Marché de l'énergie - Pr. D. Ernst Bertrand Cornélusse, Ph.D. bertrand.cornelusse@ulg.ac.be March 2017 1 Starting question How is electrical
More informationOptimizing capital investments under technological change and deterioration: A case study on MRI machine replacement
The Engineering Economist A Journal Devoted to the Problems of Capital Investment ISSN: 0013-791X (Print) 1547-2701 (Online) Journal homepage: http://www.tandfonline.com/loi/utee20 Optimizing capital investments
More informationA Mixed Integer Programming Solution for Market Clearing and Reliability Analysis
1 A Mixed Integer Programming Solution for Market Clearing and Reliability Analysis Dan Streiffert, Russ Philbrick, and Andrew Ott Abstract This paper presents a description of a Mixed Integer Programming
More informationModeling and Solving Scheduling Problems with CP Optimizer
Modeling and Solving Scheduling Problems with CP Optimizer Philippe Laborie CPLEX Optimization Studio Team May 28, 2014 IBM Decision Optimization Virtual User Group Meeting Agenda IBM ILOG CP Optimizer
More informationDynamic Scheduling of Trains in Densely Populated Congested Areas
Dynamic Scheduling of Trains in Densely Populated Congested Areas Final Report METRANS Project February 4, 2011 Principal Investigator: Maged M. Dessouky, Ph.D. Graduate Student: Shi Mu Daniel J. Epstein
More informationCapacity Planning with Rational Markets and Demand Uncertainty. By: A. Kandiraju, P. Garcia-Herreros, E. Arslan, P. Misra, S. Mehta & I.E.
Capacity Planning with Rational Markets and Demand Uncertainty By: A. Kandiraju, P. Garcia-Herreros, E. Arslan, P. Misra, S. Mehta & I.E. Grossmann 1 Motivation Capacity planning : Anticipate demands and
More informationDynamic Cloud Resource Reservation via Cloud Brokerage
Dynamic Cloud Resource Reservation via Cloud Brokerage Wei Wang*, Di Niu +, Baochun Li*, Ben Liang* * Department of Electrical and Computer Engineering, University of Toronto + Department of Electrical
More informationMulti-stage linear programming optimization for pump scheduling
Available online at www.sciencedirect.com Procedia Engineering 00 (2013) 000 000 www.elsevier.com/locate/procedia 12th International Conference on Computing and Control for the Water Industry, CCWI2013
More informationExact solutions to binary equilibrium problems with compensation and the power market uplift problem
Exact solutions to binary equilibrium problems with compensation and the power market uplift problem Daniel Huppmann, Sauleh Siddiqui Presentation at the Institut Henri Poincaré at the invitation of EDF
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 informationJournal of Global Research in Computer Science PREMATURE CONVERGENCE AND GENETIC ALGORITHM UNDER OPERATING SYSTEM PROCESS SCHEDULING PROBLEM
Volume, No. 5, December 00 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info PREMATURE CONVERGENCE AND GENETIC ALGORITHM UNDER OPERATING SYSTEM PROCESS SCHEDULING
More informationWinner Determination in Combinatorial Auction Generalizations Λ
Winner Determination in Combinatorial Auction Generalizations Λ Tuomas Sandholm sandholm@cs.cmu.edu Computer Science Department Carnegie Mellon University Pittsburgh, PA 523 Subhash Suri Andrew Gilpin
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 informationModeling and optimization of ATM cash replenishment
Modeling and optimization of ATM cash replenishment PETER KURDEL, JOLANA SEBESTYÉNOVÁ Institute of Informatics Slovak Academy of Sciences Bratislava SLOVAKIA peter.kurdel@savba.sk, sebestyenova@savba.sk
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 informationWelcome to the Webinar. Beyond an Optimal Answer How Optimization Adds Unexpected Value to an Organization
Welcome to the Webinar Beyond an Optimal Answer How Optimization Adds Unexpected Value to an Organization Speaker Introduction Tracy Pesanelli Over 30 years of sales management experience in the hightech
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 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 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 informationPost Doctoral Fellow, (Dec 2004 March 2006) INRIA Lorraine, France.
Kameshwaran S Contact Information Centre for Global Logistics & Mfg. Strategies Phone: (91) 40-23187193 Indian School of Business Mobile: (91) 99851 24818 Hyderabad 500032 Fax: (91) 40-23007099 India e-mail:
More informationAn Exact Solution for a Class of Green Vehicle Routing Problem
Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 2014 An Exact Solution for a Class of Green Vehicle Routing Problem Mandy
More informationEUPHEMIA Public Description PCR Market Coupling Algorithm
EUPHEMIA Public Description PCR Market Coupling Algorithm Version 1.5 Date December 5, 2016 Status Draft Final Document creation and distribution Document Owner Distribution EPEX SPOT GME Nord Pool OMIE
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 informationLarge-scale maintenance in industrial plants requires the entire shutdown of production units for disassembly,
INFORMS Journal on Computing Vol. 23, No. 2, Spring 2011, pp. 189 204 issn 1091-9856 eissn 1526-5528 11 2302 0189 informs doi 10.1287/ijoc.1100.0393 2011 INFORMS Decision Support and Optimization in Shutdown
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 informationMultiple Gap-Filling of Flux-Balance Models
Multiple Gap-Filling of Flux-Balance Models Mario Latendresse and Peter D. Karp Bioinformatics Research Group SRI International, Menlo Park, USA COBRA 2011, Reykjavik, Iceland, June 25 Outline 1 The Problem
More informationApplication Of Heuristics, Genetic Algorithms & Integer Programming At A Public Enterprise Water Pump Scheduling System
Application Of Heuristics, Genetic Algorithms & Integer Programming At A Public Enterprise Water Pump Scheduling System Christos Gogos¹, ³, Panayiotis Alefragis¹, ² and Efthymios Housos¹ ¹ Computer Systems
More informationThe Pennsylvania State University. The Graduate School. Department of Industrial and Manufacturing Engineering
The Pennsylvania State University The Graduate School Department of Industrial and Manufacturing Engineering MULTI-ECHELON SUPPLY CHAIN NETWORK DESIGN FOR INNOVATIVE PRODUCTS IN AGILE MANUFACTURING A Thesis
More informationRolling Horizon Approach for Aircraft Scheduling in the Terminal Control Area of Busy Airports
Available online at www.sciencedirect.com Procedia - Social and Behavioral Scienc es 80 ( 2013 ) 531 552 20th International Symposium on Transportation and Traffic Theory (ISTTT 2013) Rolling Horizon Approach
More informationPublished online: 05 Jul 2013.
This article was downloaded by: [217.170.245.234] On: 27 June 2014, At: 04:58 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: Mortimer
More informationCombining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification
Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification Jakob Puchinger and Günther R. Raidl Institute of Computer Graphics and Algorithms, Vienna University
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 informationseveral approaches have been introduced with different algorithms, mostly focusing on large retail stores [1]
Shelf Space Allocation Problem Using LNS Solver Dina Hamad Alghurair 1, Hedaya Ghanim Alshammar 2 1, 2 Higher Institute of Telecommunication and Navigation, HITN, PAAET, Ardia Block4, Street 602, Kuwait
More informationWEB SERVICES COMPOSING BY MULTIAGENT NEGOTIATION
Jrl Syst Sci & Complexity (2008) 21: 597 608 WEB SERVICES COMPOSING BY MULTIAGENT NEGOTIATION Jian TANG Liwei ZHENG Zhi JIN Received: 25 January 2008 / Revised: 10 September 2008 c 2008 Springer Science
More informationDelivery Strategies for Blood Products Supplies
Delivery Strategies for Blood Products Supplies Vera Hemmelmayr (1), Karl F. Doerner (1), Richard F. Hartl (1), Martin W. P. Savelsbergh (2) (1) Department of Business Administration, University of Vienna,
More informationWe recommend you cite the published version. The publisher s URL is:
Araujo, S. A. d., Arenales, M. N. and Clar, A. (2008) Lot-sizing and furnace scheduling in small foundries. Computers and Operations Research, 35 (3). pp. 916-932. ISSN 0305-0548 Available from: http://eprints.uwe.ac.u/7378
More informationAccurate Prediction for Atomic-Level Protein Design and its Application in Diversifying the Near-Optimal Sequence Space
Page 1 of 51 Research Article Proteins: Structure, Function and Bioinformatics DOI 1.12/prot.2228 Accurate Prediction for Atomic-Level Protein Design and its Application in Diversifying the Near-Optimal
More informationNaval Set-Based Design
Naval Set-Based Design March 1, 2017 Dr. Norbert Doerry SEA 05TD norbert.doerry@navy.mil (202) 781-2520 See http://doerry.org/norbert/papers/papers.htm for more papers and presentations 1 Point Based vs
More informationA Viral Systems Algorithm for the Traveling Salesman Problem
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 A Viral Systems Algorithm for the Traveling Salesman Problem Dedy Suryadi,
More informationOn double cycling for container port productivity improvement
DOI 10.1007/s10479-014-1645-z On double cycling for container port productivity improvement Dusan Ku Tiru S. Arthanari Springer Science+Business Media New York 2014 Abstract How quay cranes (QC) are scheduled
More informationAn Algorithm for Multi-Unit Combinatorial Auctions
From: AAAI-00 Proceedings Copyright 2000, AAAI (wwwaaaiorg) All rights reserved An Algorithm for Multi-Unit Combinatorial Auctions Kevin Leyton-Brown and Yoav Shoham and Moshe Tennenholtz Computer Science
More informationSOVN - NEW MARKET MODEL EXPERIENCE AND RESULTS
SOVN - NEW MARKET MODEL EXPERIENCE AND RESULTS Arild Lote Henden, Brukermøte 2017 Agenda Introduction Base method Results Challenges Conclusion 2 Introduction SOVN Stochastic Optimization with individual
More informationApplying Robust Optimization to MISO Look- Ahead Commitment
Applying Robust Optimization to MISO Look- Ahead Commitment Yonghong Chen, Qianfan Wang, Xing Wang, and Yongpei Guan Abstract Managing uncertainty has been a challenging task for market operations. This
More informationThe Two-Echelon Capacitated Vehicle Routing. Problem
The Two-Echelon Capacitated Vehicle Routing Problem Jesus Gonzalez Feliu 1, Guido Perboli 1, Roberto Tadei 1 and Daniele Vigo 2 1 Control and Computer Engineering Department Politecnico di Torino, Italy
More informationA Stochastic Formulation of the Disassembly Line Balancing Problem
A Stochastic Formulation of the Disassembly Line Balancing Problem Mohand Lounes Bentaha, Olga Battaïa, Alexandre Dolgui To cite this version: Mohand Lounes Bentaha, Olga Battaïa, Alexandre Dolgui. A Stochastic
More informationIncentive-Compatible, Budget-Balanced, yet Highly Efficient Auctions for Supply Chain Formation
Incentive-Compatible, Budget-Balanced, yet Highly Efficient Auctions for Supply Chain Formation Moshe Babaioff School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem
More informationAn Iterative Algorithm for Profit Maximization by Market Equilibrium Constraints
An Iterative Algorithm for Profit Maximization by Market Equilibrium Constraints Andrés Ramos Mariano Ventosa Michel Rivier Abel Santamaría 14 th PSCC Seville, 25 June 2002 Outline 1. Introduction 2. Model
More informationA reliable budget-constrained facility location/network design problem with unreliable facilities
1 1 1 1 1 1 0 1 0 1 0 1 0 1 A reliable budget-constrained facility location/network design problem with unreliable facilities Davood Shishebori 1, Lawrence V. Snyder, Mohammad Saeed Jabalameli 1 1 Department
More informationAPPLIED A NEW METHOD FOR MULTI-MODE PROJECT SCHEDULING
project, project scheduling, resource-constrained project scheduling, project-driven manufacturing, multi-mode, heuristic, branch and bound scheme, make-to-order Iwona PISZ Zbigniew BANASZAK APPLIED A
More informationDecision Support and Optimization in Shutdown and Turnaround Scheduling
Decision Support and Optimization in Shutdown and Turnaround Scheduling Nicole Megow, Rolf H. Möhring Jens Schulz March 13, 2009 Abstract Large-scale maintenance in industrial plants requires the entire
More informationFunctional requirements and acceptance testing
Functional requirements and acceptance testing Lecture 3 Software Engineering TDDC88/TDDC93 autumn 2007 Department of Computer and Information Science Linköping University, Sweden Message from the course
More informationStorage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach
Storage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach Z.X. Wang, Felix T.S. Chan, and S.H. Chung Abstract Storage allocation and yard trucks scheduling
More informationBalanced Billing Cycles and Vehicle Routing of Meter Readers
Balanced Billing Cycles and Vehicle Routing of Meter Readers by Chris Groër, Bruce Golden, Edward Wasil University of Maryland, College Park University of Maryland, College Park American University, Washington
More informationDNA Circuits for Analog Computing
DNA Circuits for Analog Computing Tianqi Song Department of Computer Science Duke University 1 Outline Motivation What is DNA computing? Why are we interested in DNA computing? What has been done? Why
More informationTest Optimization Utilizing Design Of Experiments
Test Optimization Utilizing Design Of Experiments Tonja Rogers Peter Kraus John L Sims March 13, 2012 Copyright 2012 Raytheon Company. All rights reserved. Customer Success Is Our Mission is a registered
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 informationDynamic vs. Static Optimization of Crossdocking Operations 1
Dynamic vs. Static Optimization of Crossdocking Operations 1 Monique Guignard a, 2, Peter Hahn b and Heng Zhang b a University of Pennsylvania, the Wharton School, OPIM Dept, 3730 Walnut St.., Philadelphia,
More informationComputing the Non-Stationary Replenishment Cycle Inventory Policy under Stochastic Supplier Lead-Times
Computing the Non-Stationary Replenishment Cycle Inventory Policy under Stochastic Supplier Lead-Times Roberto Rossi a, S. Armagan Tarim b Brahim Hnich c Steven Prestwich d a Logistics, Decision and Information
More informationThe Nottingham eprints service makes this work by researchers of the University of Nottingham available open access under the following conditions.
Burke, Edmund and Eckersley, Adam and McCollum, Barry and Sanja, Petrovic and Qu, Rong (2003) Using Simulated Annealing to Study Behaviour of Various Exam Timetabling Data Sets. In: The Fifth Metaheuristics
More informationPCR Stakeholder Forum Brussels, January 11 th 2016
PCR Stakeholder Forum Brussels, January 11 th 2016 PCR Stakeholder Forum January 11, 2016 Agenda Complexity of the problem Size of the problem; Non-convexities and optimality gap; Heuristics in Euphemia;
More informationStochastic Passenger Train Timetabling using a Branch and Bound Approach
Stochastic Passenger Train Timetabling using a Branch and Bound Approach Liang Liu and Maged Dessouky Daniel J.Epstein Department of Industrial and Systems Engineering University of Southern California,
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 informationOptimising selection in tree breeding with constraints on relatedness and operational flexibility
Optimising selection in tree breeding with constraints on relatedness and operational flexibility T.J. Tim Mullin 1,2, Makoto Yamashita 3, and Pietro Belotti 4 1 Skogforsk (The Forestry Research Institute
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 informationJOB SHOP SCHEDULING USING ARTIFICIAL IMMUNE SYSTEM
JOB SHOP SCHEDULING USING ARTIFICIAL IMMUNE SYSTEM A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENT FOR DEGREE IN BACHELOR OF TECHNOLOGY IN MECHANICAL ENGINEERING BY DEEPAK KUMAR MAHAPATRA
More informationA heuristic approach for solving real world nurse rostering problems
A heuristic approach for solving real world nurse rostering problems H. Frøyseth, M. Stølevik and A. Riise Received: date / Accepted: date Keywords Nurse rostering Personnel scheduling Iterated local search
More informationOutline. Reference : Aho Ullman, Sethi
Outline Code Generation Issues Basic Blocks and Flow Graphs Optimizations of Basic Blocks A Simple Code Generator Peephole optimization Register allocation and assignment Instruction selection by tree
More informationIterative train scheduling in networks with tree topologies: a case study for the Hunter Valley Coal Chain
22nd International Congress on Modelling and Simulation, Hobart, Tasmania, Australia, 3 to 8 December 2017 mssanz.org.au/modsim2017 Iterative train scheduling in networks with tree topologies: a case study
More informationLOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS
Advances in Production Engineering & Management 4 (2009) 3, 127-138 ISSN 1854-6250 Scientific paper LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS Ahmad, I. * & Al-aney, K.I.M. ** *Department
More informationIdentifying Signaling Pathways. BMI/CS 776 Spring 2016 Anthony Gitter
Identifying Signaling Pathways BMI/CS 776 www.biostat.wisc.edu/bmi776/ Spring 2016 Anthony Gitter gitter@biostat.wisc.edu Goals for lecture Challenges of integrating high-throughput assays Connecting relevant
More information