Hybrid Constraint Programming and Metaheuristic methods for Large Scale Optimization Problems
|
|
- Phebe Tucker
- 5 years ago
- Views:
Transcription
1 Hybrid Constraint Programming and Metaheuristic methods for Large Scale Optimization Problems Fabio Parisini Tutor: Paola Mello Co-tutor: Michela Milano Final seminars of the XXIII cycle of the doctorate course in Electronics, Computer Science and Telecommunications Parisini (UniBo) Hybrid methods Final seminars 1 / 27
2 Combinatorial optimization problems Combinatorial optimization (CO) is a topic in theoretical computer science and applied mathematics that consists of finding the least-cost solution to a mathematical problem in which each solution is associated with a numerical cost 1. Combinatorial optimization problems arise in many application areas: Vehicle routing; Logistics; Packing and cutting stock application; Resource allocation; Scheduling;... 1 Wikipedia Parisini (UniBo) Hybrid methods Final seminars 2 / 27
3 Combinatorial optimization problems Combinatorial optimization (CO) is a topic in theoretical computer science and applied mathematics that consists of finding the least-cost solution to a mathematical problem in which each solution is associated with a numerical cost 1. Combinatorial optimization problems arise in many application areas: Vehicle routing; Logistics; Packing and cutting stock application; Resource allocation; Scheduling;... 1 Wikipedia Parisini (UniBo) Hybrid methods Final seminars 2 / 27
4 Complete and heuristic methods Two categories of solution approaches to CO problems: Complete methods: find the optimal solution and prove optimality at the cost of a high computational effort; Heuristic methods: find good solutions without any optimality guarantee. Complete methods are impracticable when dealing with large scale optimization problems. Parisini (UniBo) Hybrid methods Final seminars 3 / 27
5 Complete and heuristic methods Two categories of solution approaches to CO problems: Complete methods: find the optimal solution and prove optimality at the cost of a high computational effort; Heuristic methods: find good solutions without any optimality guarantee. Complete methods are impracticable when dealing with large scale optimization problems. Parisini (UniBo) Hybrid methods Final seminars 3 / 27
6 Feasibility and optimality components Two aspects coexist within CO problems: Feasibility component: the constraints and the size of the problem are such that it is computationally expensive to find any feasible solution; Optimality component: it is computationally easy in practice to find a feasible solution, whilst it is very difficult to find the optimal one. Parisini (UniBo) Hybrid methods Final seminars 4 / 27
7 Solution techniques Constraint Programming (CP) is particularly effective when dealing with the feasibility component of a CO problem. On the other hand, CP may present some limitations when dealing with a strong optimality component; Metaheuristic methods instead are used in the literature to solve large scale optimization problems in an incomplete way, i.e. by finding feasible sub-optimal solutions. Metaheuristic techniques can thus effectively deal with CO problems where the optimality component is dominant. Parisini (UniBo) Hybrid methods Final seminars 5 / 27
8 Constraint programming General technique based on tree search; Exploiting variable and value selection heuristics to guide the search; Filtering and constraint propagation considerably reduce the size of the search space; Suitable for complete approaches to the solution of CO problems; Impracticable for large scale optimization problems. Parisini (UniBo) Hybrid methods Final seminars 6 / 27
9 Metaheuristic methods Many existing techniques, having common concepts: Intensification and diversification techniques; Neighborhood exploration methods; Definition of local search moves specific for the problem; Usage of a set of elite solutions; Adaptation of the search strategy to the evolution of the search process itself;... Parisini (UniBo) Hybrid methods Final seminars 7 / 27
10 Motivation Thesis aim Constraint programming and metaheuristics methods show complementary strenghts and weaknesses. Hybrid search techniques can be designed to exploit the advantages of both approaches. The aim of my thesis is to integrate metaheuristic concepts, such as neighborhood exploration, intensification, diversification, restarting, within a CP-based tree search. Parisini (UniBo) Hybrid methods Final seminars 8 / 27
11 CP modeling of a CO problem An optimization problem P; A model for P defined on a set of finite domain integer variables x = [x 1, x 2,...,x n ]; A set of constraints posted on the problem variables; An incumbent solution x = [ x 1, x 2,..., x n ] which is a feasible assignment of values to the problem variables; The discrepancy between x and x, which can be computed as: (x, x) = n d i where d i = i=1 { 1 if xi x i ; 0 otherwise. (1) Parisini (UniBo) Hybrid methods Final seminars 9 / 27
12 A known technique: limited discrepancy search (LDS) Wrong turn: when the heuristics guides the search to a failure state, backtracking is performed up to an open decision point, where the choice performed by the heuristics is reversed. This alternate choice is called a wrong turn ; Limited Discrepancy Search (LDS) limits the number of wrong turns (i.e. discrepancies) along the way; it explores regions at increasing discrepancy value k, the k-distance neighborhoods of the solution proposed by the heuristics. Parisini (UniBo) Hybrid methods Final seminars 10 / 27
13 LDS in optimization problems LDS tries to reduce the cost of the incumbent solution x by exploring the k-distance neighborhood of x via tree search. n Incumbent Solution Parisini (UniBo) Hybrid methods Final seminars 11 / 27
14 LDS in optimization problems LDS tries to reduce the cost of the incumbent solution x by exploring the k-distance neighborhood of x via tree search. n Parisini (UniBo) Hybrid methods Final seminars 11 / 27
15 LDS in optimization problems LDS tries to reduce the cost of the incumbent solution x by exploring the k-distance neighborhood of x via tree search. n Parisini (UniBo) Hybrid methods Final seminars 11 / 27
16 LDS in optimization problems LDS tries to reduce the cost of the incumbent solution x by exploring the k-distance neighborhood of x via tree search. n Parisini (UniBo) Hybrid methods Final seminars 11 / 27
17 LDS in optimization problems LDS tries to reduce the cost of the incumbent solution x by exploring the k-distance neighborhood of x via tree search. n 5 Impossible to reach high discrepancy values Parisini (UniBo) Hybrid methods Final seminars 11 / 27
18 Large neighborhood search (LNS) Large neighborhood search is a technique which is commonly used for improving the quality of a given solution by exploring its neighborhood: It iteratively relaxes a fragment of the current solution x and then re-optimizes it using CP aided tree search; At a high level it can be read as a hill climber which is executed until some time limit is exhausted; It is a problem-dependent strategy; Key components of LNS are the methods used to choose the fragments to relax and the methods to re-optimize them. Parisini (UniBo) Hybrid methods Final seminars 12 / 27
19 Hybrid methods for neighborhood exploration Complete neighborhood exploration is impracticable for large scale optimization problems: We introduce methods to explore slices of large discrepancy neighborhoods efficiently using restarts and randomization. n Parisini (UniBo) Hybrid methods Final seminars 13 / 27
20 Hybrid methods for neighborhood exploration Complete neighborhood exploration is impracticable for large scale optimization problems: We introduce methods to explore slices of large discrepancy neighborhoods efficiently using restarts and randomization. n Parisini (UniBo) Hybrid methods Final seminars 13 / 27
21 Hybrid methods for neighborhood exploration Complete neighborhood exploration is impracticable for large scale optimization problems: We introduce methods to explore slices of large discrepancy neighborhoods efficiently using restarts and randomization. n Parisini (UniBo) Hybrid methods Final seminars 13 / 27
22 Sliced neighborhood search (SNS) SNS iteratively explores neighborhoods of an incumbent solution x by triggering a sequence of restarts; At each restart a randomly chosen transversal slice of a k distance neighborhood is chosen and explored; Transversal slices are identified by randomly selecting which variables have to change and which variables have to keep the same value; SNS works by posting extra constraints, equality and difference constraints, on subsets of variables, thus setting at-least and at-most discrepancy bounds. Parisini (UniBo) Hybrid methods Final seminars 14 / 27
23 Sliced neighborhood search (SNS) Definition (Neighborhood slice) A slice of a k-distance neighborhood of a given reference solution x is defined on three parameters: the incumbent solution x, a set E of indices corresponding to variables that keep the same value and a set D of indices corresponding to variables that have to change. The cardinality of E is n k: N S ( x, E, D) = {x P {x i = x i i E} {x i x i i D}} SNS randomly choses indices in sets E and D and iteratively explores the corresponding neighborhood slice. Parisini (UniBo) Hybrid methods Final seminars 15 / 27
24 A SNS example Let s take the incumbent solution x = [2, 4, 9, 5, 2, 8]: LDS first explores exhaustively the search space at discrepancy value 1, where just 1 of the 6 variables can change at a time, then at discrepancy 2, 3 and so on; SNS first fixes a certain number of variables to the incumbent solution value, then starts the real search: For example, SNS could set x 2 = 4, x 3 = 9 and x 6 = 8 and perform a standard tree search just on x 1, x 4 and x 5 ; SNS performs many randomized iterations choosing each time a different set of variables and using small time limits for each iteration. Parisini (UniBo) Hybrid methods Final seminars 16 / 27
25 Application of SNS Usage of SNS as a stand alone search strategy: SNS is given an initial solution x. If x is distant from the optimal solution SNS can quickly improve over it by performing large neighborhood search. SNS within a heuristic framework: SNS allows the partial exploration of very large neighborhoods, it includes randomization elements and both intensification and diversification behaviors; By conveniently setting at-most k and at-least k bounds it is possible to constrain the solution x to be found to have the desired minimum and maximum discrepancy with respect to x, performing either intensification or diversification. Parisini (UniBo) Hybrid methods Final seminars 17 / 27
26 Experimental results Problem of choice: Asymmetric Travelling Salesman Problem with Time Windows (ATSPTW) Finding a minimum cost path visiting a set of cities exactly once, where each city must be visited within a specific time window. Two main components coexist, a Travelling Salesman Problem (TSP) and a scheduling problem: In TSPs, optimization usually results to be the most difficult issue; Scheduling problems with release dates and due dates usually set serious feasibility issues. Parisini (UniBo) Hybrid methods Final seminars 18 / 27
27 Experimental results Problem of choice: Asymmetric Travelling Salesman Problem with Time Windows (ATSPTW) Finding a minimum cost path visiting a set of cities exactly once, where each city must be visited within a specific time window. Two main components coexist, a Travelling Salesman Problem (TSP) and a scheduling problem: In TSPs, optimization usually results to be the most difficult issue; Scheduling problems with release dates and due dates usually set serious feasibility issues. Parisini (UniBo) Hybrid methods Final seminars 18 / 27
28 SNS performance elements 1/3 Search effectiveness in the sub-trees After discrepancy bounds are enforced by posting equality and difference constraints, search in the sub-trees takes place. Search effectiveness in the sub-trees strongly depends on the propagation performed by such constraints. While equality constraints enable strong propagation, we expect difference constraints to be less effective. Parisini (UniBo) Hybrid methods Final seminars 19 / 27
29 SNS performance elements 2/3 Solution Density in the selected discrepancy range Regardless of how efficiently the selected discrepancy range is explored, the success of SNS depends on the actual presence of improving solutions in such range and their number. This in turn depends on the problem structure, and on the selected at-least and at-most discrepancy bounds. Parisini (UniBo) Hybrid methods Final seminars 20 / 27
30 SNS performance elements 3/3 Effectiveness of the Sample Space exploration SNS is basically sampling the LDS search space; the sampling effectiveness is measured by the number of collected samples (i.e. SNS iterations) over the size of the Sample Space. Let least be the at-least discrepancy bound, most the at-most discrepancy bound; then the size of the Sample Space (i.e. the overall number of third level sub-trees) is given by: ( )( ) n most n most least Parisini (UniBo) Hybrid methods Final seminars 21 / 27
31 SNS stand alone 1/2 Table: Big instances, more than 50 cities, 300 CPU seconds time limit Instance basic LDS max =40% Cost Sol Disc % Impr Cost Sol Disc % Impr rbg050a rbg050b rbg050c rbg055a rbg067a rbg092a rbg125a rbg rbg rbg rbg rbg172a rbg rbg rbg201a rbg Parisini (UniBo) Hybrid methods Final seminars 22 / 27
32 SNS stand alone 2/2 Table: Big instances, more than 50 cities, 300 CPU seconds time limit Instance (0%, 40%) (10%, 50%) (10%, 40%) (25%, 55%) Cost % Impr Cost % Impr Cost % Impr Cost % Impr rbg050a rbg050b rbg050c rbg055a rbg067a rbg092a rbg125a rbg rbg rbg rbg rbg172a rbg rbg rbg201a rbg Parisini (UniBo) Hybrid methods Final seminars 23 / 27
33 SNS within CP-based local branching Table: Big instances, 7,200 CPU seconds time limit, SNS used for neighborhood exploration and diversification. Instance Ref value LB Conf SNS Conf Value % Impr Value % Impr rbg125a rbg rbg rbg rbg rbg172a rbg rbg rbg201a rbg Parisini (UniBo) Hybrid methods Final seminars 24 / 27
34 Conclusions and future work SNS is a general and effective search technique to heuristically explore the neighborhood of an incumbent solution x up to high discrepancy values, incorporating elements coming from LDS and LNS; Experimental results support the idea that the best SNS configurations obtain consistently better results than LDS; SNS can be used both as a stand alone search strategy and as intensification and diversification method in a heuristic framework. Further development: Use of sampling techniques to derive promising slices to explore; Introduction of learning processes, to automatically tune the SNS parameters during the search process. Adoption of SNS as general neighborhood exploration tool within metaheuristics frameworks. Parisini (UniBo) Hybrid methods Final seminars 25 / 27
35 List of publications I Z. Kiziltan, A. Lodi, M. Milano, and F. Parisini. Cp-based local branching. Proc. of CP-07, LNCS, 4741: , Z. Kiziltan, A. Lodi, M. Milano, and F. Parisini. Bounding, filtering and diversification in cp-based local branching. Technical Report: OR/10/20, DEIS - Università di Bologna, F. Parisini. Bi-dimensional domains for the non-overlapping rectangles constraint. In ICLP, pages , F. Parisini. Local branching in a constraint programming framework. In ICLP (Technical Communications), pages , Parisini (UniBo) Hybrid methods Final seminars 26 / 27
36 List of publications II F. Parisini, M. Lombardi, and M. Milano. Discrepancy-based sliced neighborhood search. In AIMSA, pages , F. Parisini and M. Milano. Improving cp-based local branching via sliced neighborhood search. Accepted for publication: SAC 11: Proceedings of the 2011 ACM Symposium on Applied Computing. F. Parisini and M. Milano. Sliced neighborhood search. Submitted for publication to:expert Systems with Applications. Parisini (UniBo) Hybrid methods Final seminars 27 / 27
Improving CP-based Local Branching via Sliced Neighborhood Search
Improving CP-based Local Branching via Sliced Neighborhood Search Fabio Parisini D.E.I.S., University of Bologna, Italy fabio.parisini@unibo.it Michela Milano D.E.I.S., University of Bologna, Italy michela.milano@unibo.it
More informationCP-based Local Branching
CP-based Local Branching Zeynep Kiziltan 1, Andrea Lodi 2, Michela Milano 2, and Fabio Parisini 2 1 Department of Computer Science, University of Bologna, Italy. zeynep@cs.unibo.it 2 D.E.I.S., University
More informationMachine Learning for Software Engineering
Machine Learning for Software Engineering Introduction and Motivation Prof. Dr.-Ing. Norbert Siegmund Intelligent Software Systems 1 2 Organizational Stuff Lectures: Tuesday 11:00 12:30 in room SR015 Cover
More informationGraph Coloring via Constraint Programming-based Column Generation
Graph Coloring via Constraint Programming-based Column Generation Stefano Gualandi Federico Malucelli Dipartimento di Elettronica e Informatica, Politecnico di Milano Viale Ponzio 24/A, 20133, Milan, Italy
More informationACO and other (meta)heuristics for CO
ACO and other (meta)heuristics for CO 32 33 Outline Notes on combinatorial optimization and algorithmic complexity Construction and modification metaheuristics: two complementary ways of searching a solution
More informationA Computational Study of Bi-directional Dynamic Programming for the Traveling Salesman Problem with Time Windows
A Computational Study of Bi-directional Dynamic Programming for the Traveling Salesman Problem with Time Windows Jing-Quan Li California PATH, University of California, Berkeley, Richmond, CA 94804, jingquan@path.berkeley.edu
More informationHybrid Metaheuristics
An overview of the integration of metaheuristics and tree search DEIS, Campus of Cesena Alma Mater Studiorum - Università di Bologna andrea.roli@unibo.it Scuola Superiore Sant Anna, Pisa, 28 October 2011
More informationGeneral Methods and Search Algorithms
DM811 HEURISTICS AND LOCAL SEARCH ALGORITHMS FOR COMBINATORIAL OPTIMZATION Lecture 3 General Methods and Search Algorithms Marco Chiarandini 2 Methods and Algorithms A Method is a general framework for
More informationLearning techniques for Automatic Algorithm Portfolio Selection
Learning techniques for Automatic Algorithm Portfolio Selection Alessio Guerri and Michela Milano 1 Abstract. The purpose of this paper is to show that a well known machine learning technique based on
More informationNeighborhood Search: Mixing Gecode and EasyLocal++
: Mixing Gecode and EasyLocal++ Raffaele Cipriano 1 Luca Di Gaspero 2 Agostino 1 1) DIMI - Dip. di Matematica e Informatica Università di Udine, via delle Scienze 206, I-33100, Udine, Italy 2) DIEGM -
More informationColumn Generation Based Primal Heuristics
Column Generation Based Primal Heuristics C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, F. Vanderbeck University Bordeaux 1 & INRIA team RealOpt Outline 1 Context Generic Primal Heuristics The Branch-and-Price
More informationTABU search and Iterated Local Search classical OR methods
TABU search and Iterated Local Search classical OR methods tks@imm.dtu.dk Informatics and Mathematical Modeling Technical University of Denmark 1 Outline TSP optimization problem Tabu Search (TS) (most
More informationGRASP. Greedy Randomized Adaptive. Search Procedure
GRASP Greedy Randomized Adaptive Search Procedure Type of problems Combinatorial optimization problem: Finite ensemble E = {1,2,... n } Subset of feasible solutions F 2 Objective function f : 2 Minimisation
More informationOutline. TABU search and Iterated Local Search classical OR methods. Traveling Salesman Problem (TSP) 2-opt
TABU search and Iterated Local Search classical OR methods Outline TSP optimization problem Tabu Search (TS) (most important) Iterated Local Search (ILS) tks@imm.dtu.dk Informatics and Mathematical Modeling
More informationOutline of the module
Evolutionary and Heuristic Optimisation (ITNPD8) Lecture 2: Heuristics and Metaheuristics Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ Computing Science and Mathematics, School of Natural Sciences University
More informationAmanur Rahman Saiyed (Indiana State University) THE TRAVELING SALESMAN PROBLEM November 22, / 21
. Amanur Rahman Saiyed (Indiana State University) THE TRAVELING SALESMAN PROBLEM November 22, 2011 1 / 21 THE TRAVELING SALESMAN PROBLEM Amanur Rahman Saiyed Indiana State University November 22, 2011
More informationWeight Annealing Heuristics for Solving the Two-Dimensional Bin Packing Problem
Weight Annealing Heuristics for Solving the Two-Dimensional Bin Packing Problem Kok-Hua Loh, Nanyang Technological University Bruce Golden, University of Maryland Edward Wasil, American University th ICS
More informationHeuristics in MILP. Group 1 D. Assouline, N. Molyneaux, B. Morén. Supervisors: Michel Bierlaire, Andrea Lodi. Zinal 2017 Winter School
Heuristics in MILP Group 1 D. Assouline, N. Molyneaux, B. Morén Supervisors: Michel Bierlaire, Andrea Lodi Zinal 2017 Winter School 0 / 23 Primal heuristics Original paper: Fischetti, M. and Lodi, A. (2011).
More informationMethods and Models for Combinatorial Optimization Exact methods for the Traveling Salesman Problem
Methods and Models for Combinatorial Optimization Exact methods for the Traveling Salesman Problem L. De Giovanni M. Di Summa The Traveling Salesman Problem (TSP) is an optimization problem on a directed
More informationA Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal++
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal++ Raffaele Cipriano 1, Luca Di Gaspero 2, and Agostino Dovier 1 1 DIMI (cipriano dovier)@dimi.uniud.it 2 DIEGM l.digaspero@uniud.it
More informationFuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem
Fuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem Bindu Student, JMIT Radaur binduaahuja@gmail.com Mrs. Pinki Tanwar Asstt. Prof, CSE, JMIT Radaur pinki.tanwar@gmail.com Abstract
More informationModified Order Crossover (OX) Operator
Modified Order Crossover (OX) Operator Ms. Monica Sehrawat 1 N.C. College of Engineering, Israna Panipat, Haryana, INDIA. Mr. Sukhvir Singh 2 N.C. College of Engineering, Israna Panipat, Haryana, INDIA.
More informationPrimal Heuristics in SCIP
Primal Heuristics in SCIP Timo Berthold Zuse Institute Berlin DFG Research Center MATHEON Mathematics for key technologies Berlin, 10/11/2007 Outline 1 Introduction Basics Integration Into SCIP 2 Available
More informationA Parallel Architecture for the Generalized Traveling Salesman Problem
A Parallel Architecture for the Generalized Traveling Salesman Problem Max Scharrenbroich AMSC 663 Project Proposal Advisor: Dr. Bruce L. Golden R. H. Smith School of Business 1 Background and Introduction
More informationHow to use your favorite MIP Solver: modeling, solving, cannibalizing. Andrea Lodi University of Bologna, Italy
How to use your favorite MIP Solver: modeling, solving, cannibalizing Andrea Lodi University of Bologna, Italy andrea.lodi@unibo.it January-February, 2012 @ Universität Wien A. Lodi, How to use your favorite
More informationMetaheuristic Development Methodology. Fall 2009 Instructor: Dr. Masoud Yaghini
Metaheuristic Development Methodology Fall 2009 Instructor: Dr. Masoud Yaghini Phases and Steps Phases and Steps Phase 1: Understanding Problem Step 1: State the Problem Step 2: Review of Existing Solution
More informationPre-requisite Material for Course Heuristics and Approximation Algorithms
Pre-requisite Material for Course Heuristics and Approximation Algorithms This document contains an overview of the basic concepts that are needed in preparation to participate in the course. In addition,
More informationAlgorithms for the Bin Packing Problem with Conflicts
Algorithms for the Bin Packing Problem with Conflicts Albert E. Fernandes Muritiba *, Manuel Iori, Enrico Malaguti*, Paolo Toth* *Dipartimento di Elettronica, Informatica e Sistemistica, Università degli
More informationHeuristics in Commercial MIP Solvers Part I (Heuristics in IBM CPLEX)
Andrea Tramontani CPLEX Optimization, IBM CWI, Amsterdam, June 12, 2018 Heuristics in Commercial MIP Solvers Part I (Heuristics in IBM CPLEX) Agenda CPLEX Branch-and-Bound (B&B) Primal heuristics in CPLEX
More informationDynamically Configured λ-opt Heuristics for Bus Scheduling
Dynamically Configured λ-opt Heuristics for Bus Scheduling Prapa Rattadilok and Raymond S K Kwan School of Computing, University of Leeds, UK {prapa, rsk}@comp.leeds.ac.uk Bus scheduling is a complex combinatorial
More informationA Meta-heuristic Applied for a Topologic Pickup and Delivery Problem with Time Windows Constraints
A Meta-heuristic Applied for a Topologic Pickup and Delivery Problem with Time Windows Constraints Jesús Fabián López Pérez Post-Graduate Program of Management Science, FACPYA UANL, Monterrey, México fabian.lopez@e-arca.com.mx
More informationPractice Final Exam 1
Algorithm esign Techniques Practice Final xam Instructions. The exam is hours long and contains 6 questions. Write your answers clearly. You may quote any result/theorem seen in the lectures or in the
More informationOutline of the talk. Local search meta-heuristics for combinatorial problems. Constraint Satisfaction Problems. The n-queens problem
Università G. D Annunzio, maggio 00 Local search meta-heuristics for combinatorial problems Luca Di Gaspero Dipartimento di Ingegneria Elettrica, Gestionale e Meccanica Università degli Studi di Udine
More informationA Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery
A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery Monika Sharma 1, Deepak Sharma 2 1 Research Scholar Department of Computer Science and Engineering, NNSS SGI Samalkha,
More information7KH9HKLFOH5RXWLQJSUREOHP
7K9KO5RXWJSUREOP Given a set of vehicles with a certain capacity located at a depot and a set of customers with different demands at various locations, the vehicle routing problem (VRP) is how to satisfy
More informationGeorge Reloaded. M. Monaci (University of Padova, Italy) joint work with M. Fischetti. MIP Workshop, July 2010
George Reloaded M. Monaci (University of Padova, Italy) joint work with M. Fischetti MIP Workshop, July 2010 Why George? Because of Karzan, Nemhauser, Savelsbergh Information-based branching schemes for
More informationLagrangian Relaxation in CP
Lagrangian Relaxation in CP Willem-Jan van Hoeve CPAIOR 016 Master Class Overview 1. Motivation for using Lagrangian Relaxations in CP. Lagrangian-based domain filtering Example: Traveling Salesman Problem.
More informationSOME GREEDY BASED ALGORITHMS FOR MULTI PERIODS DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM
SOME GREEDY BASED ALGORITHMS FOR MULTI PERIODS DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM Wamiliana 1, Faiz A. M. Elfaki 2, Mustofa Usman 1 and M. Azram 2 1 Department of Mathematics, Faculty of
More informationTabu search and genetic algorithms: a comparative study between pure and hybrid agents in an A-teams approach
Tabu search and genetic algorithms: a comparative study between pure and hybrid agents in an A-teams approach Carlos A. S. Passos (CenPRA) carlos.passos@cenpra.gov.br Daniel M. Aquino (UNICAMP, PIBIC/CNPq)
More informationConstraint Programming
Depth-first search Let us go back to foundations: DFS = Depth First Search Constraint Programming Roman Barták Department of Theoretical Computer Science and Mathematical Logic 2 3 4 5 6 7 8 9 Observation:
More informationEffective probabilistic stopping rules for randomized metaheuristics: GRASP implementations
Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations Celso C. Ribeiro Isabel Rosseti Reinaldo C. Souza Universidade Federal Fluminense, Brazil July 2012 1/45 Contents
More informationIntroduction to Combinatorial Algorithms
Fall 2009 Intro Introduction to the course What are : Combinatorial Structures? Combinatorial Algorithms? Combinatorial Problems? Combinatorial Structures Combinatorial Structures Combinatorial structures
More informationLocal Search Overview
DM841 DISCRETE OPTIMIZATION Part 2 Heuristics Local Search Overview Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. Local Search 2 Outline
More informationConstraint-based solution methods for vehicle routing problems
EWO Seminar - November 17, 2009 Constraint-based solution methods for vehicle routing problems Willem-Jan van Hoeve Tepper School of Business, Carnegie Mellon University Based on joint work with Michela
More informationSome Basics on Tolerances. Gerold Jäger
Some Basics on Tolerances Gerold Jäger University Halle, Germany joint work with Boris Goldengorin and Paul Molitor June 21, 2006 Acknowledgement This paper is dedicated to Jop Sibeyn, who is missed since
More informationLOCAL SEARCH FOR THE MINIMUM FUNDAMENTAL CYCLE BASIS PROBLEM
LOCAL SEARCH FOR THE MINIMUM FUNDAMENTAL CYCLE BASIS PROBLEM Abstract E.Amaldi, L.Liberti, N.Maculan, F.Maffioli DEI, Politecnico di Milano, I-20133 Milano amaldi,liberti,maculan,maffioli @elet.polimi.it
More informationConstructive and destructive algorithms
Constructive and destructive algorithms Heuristic algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) Constructive algorithms In combinatorial optimization problems every
More informationParallel Computing in Combinatorial Optimization
Parallel Computing in Combinatorial Optimization Bernard Gendron Université de Montréal gendron@iro.umontreal.ca Course Outline Objective: provide an overview of the current research on the design of parallel
More informationA Re-examination of Limited Discrepancy Search
A Re-examination of Limited Discrepancy Search W. Ken Jackson, Morten Irgens, and William S. Havens Intelligent Systems Lab, Centre for Systems Science Simon Fraser University Burnaby, B.C., CANADA V5A
More informationSearch. Krzysztof Kuchcinski. Department of Computer Science Lund Institute of Technology Sweden.
Search Krzysztof Kuchcinski Krzysztof.Kuchcinski@cs.lth.se Department of Computer Science Lund Institute of Technology Sweden January 12, 2015 Kris Kuchcinski (LTH) Search January 12, 2015 1 / 46 Search
More informationOverview. H. R. Alvarez A., Ph. D.
Network Modeling Overview Networks arise in numerous settings: transportation, electrical, and communication networks, for example. Network representations also are widely used for problems in such diverse
More informationof optimization problems. In this chapter, it is explained that what network design
CHAPTER 2 Network Design Network design is one of the most important and most frequently encountered classes of optimization problems. In this chapter, it is explained that what network design is? The
More informationOverview of Tabu Search
Overview of Tabu Search The word tabu (or taboo) comes from Tongan, a language of Polynesia, where it was used by the aborigines of Tonga island to indicate things that cannot be touched because they are
More informationOn Mixed-Integer (Linear) Programming and its connection with Data Science
On Mixed-Integer (Linear) Programming and its connection with Data Science Andrea Lodi Canada Excellence Research Chair École Polytechnique de Montréal, Québec, Canada andrea.lodi@polymtl.ca January 16-20,
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationResearch Interests Optimization:
Mitchell: Research interests 1 Research Interests Optimization: looking for the best solution from among a number of candidates. Prototypical optimization problem: min f(x) subject to g(x) 0 x X IR n Here,
More informationFebruary 19, Integer programming. Outline. Problem formulation. Branch-andbound
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland February 19,
More informationMathematical Programming Formulations, Constraint Programming
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 3 Mathematical Programming Formulations, Constraint Programming 1. Special Purpose Algorithms 2. Constraint Programming Marco Chiarandini DM87 Scheduling,
More informationThe Heuristic (Dark) Side of MIP Solvers. Asja Derviskadic, EPFL Vit Prochazka, NHH Christoph Schaefer, EPFL
The Heuristic (Dark) Side of MIP Solvers Asja Derviskadic, EPFL Vit Prochazka, NHH Christoph Schaefer, EPFL 1 Table of content [Lodi], The Heuristic (Dark) Side of MIP Solvers, Hybrid Metaheuristics, 273-284,
More informationDFS* and the Traveling Tournament Problem. David C. Uthus, Patricia J. Riddle, and Hans W. Guesgen
DFS* and the Traveling Tournament Problem David C. Uthus, Patricia J. Riddle, and Hans W. Guesgen Traveling Tournament Problem Sports scheduling combinatorial optimization problem. Objective is to create
More informationDecision Diagrams for Solving Traveling Salesman Problems with Pickup and Delivery in Real Time
Decision Diagrams for Solving Traveling Salesman Problems with Pickup and Delivery in Real Time Ryan J. O Neil a,b, Karla Hoffman a a Department of Systems Engineering and Operations Research, George Mason
More informationPrimal Heuristics for Branch-and-Price Algorithms
Primal Heuristics for Branch-and-Price Algorithms Marco Lübbecke and Christian Puchert Abstract In this paper, we present several primal heuristics which we implemented in the branch-and-price solver GCG
More informationArc-Flow Model for the Two-Dimensional Cutting Stock Problem
Arc-Flow Model for the Two-Dimensional Cutting Stock Problem Rita Macedo Cláudio Alves J. M. Valério de Carvalho Centro de Investigação Algoritmi, Universidade do Minho Escola de Engenharia, Universidade
More informationSimple mechanisms for escaping from local optima:
The methods we have seen so far are iterative improvement methods, that is, they get stuck in local optima. Simple mechanisms for escaping from local optima: I Restart: re-initialise search whenever a
More informationBranch-and-bound: an example
Branch-and-bound: an example Giovanni Righini Università degli Studi di Milano Operations Research Complements The Linear Ordering Problem The Linear Ordering Problem (LOP) is an N P-hard combinatorial
More informationComputational Complexity CSC Professor: Tom Altman. Capacitated Problem
Computational Complexity CSC 5802 Professor: Tom Altman Capacitated Problem Agenda: Definition Example Solution Techniques Implementation Capacitated VRP (CPRV) CVRP is a Vehicle Routing Problem (VRP)
More informationBi-Objective Optimization for Scheduling in Heterogeneous Computing Systems
Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems Tony Maciejewski, Kyle Tarplee, Ryan Friese, and Howard Jay Siegel Department of Electrical and Computer Engineering Colorado
More informationMetaheuristic Optimization with Evolver, Genocop and OptQuest
Metaheuristic Optimization with Evolver, Genocop and OptQuest MANUEL LAGUNA Graduate School of Business Administration University of Colorado, Boulder, CO 80309-0419 Manuel.Laguna@Colorado.EDU Last revision:
More informationThe Branch & Move algorithm: Improving Global Constraints Support by Local Search
Branch and Move 1 The Branch & Move algorithm: Improving Global Constraints Support by Local Search Thierry Benoist Bouygues e-lab, 1 av. Eugène Freyssinet, 78061 St Quentin en Yvelines Cedex, France tbenoist@bouygues.com
More informationHybrid strategies of enumeration in constraint solving
Scientific Research and Essays Vol. 6(21), pp. 4587-4596, 30 September, 2011 Available online at http://www.academicjournals.org/sre DOI: 10.5897/SRE11.891 ISSN 1992-2248 2011 Academic Journals Full Length
More informationCloud Branching MIP workshop, Ohio State University, 23/Jul/2014
Cloud Branching MIP workshop, Ohio State University, 23/Jul/2014 Timo Berthold Xpress Optimization Team Gerald Gamrath Zuse Institute Berlin Domenico Salvagnin Universita degli Studi di Padova This presentation
More informationOptimization Techniques for Design Space Exploration
0-0-7 Optimization Techniques for Design Space Exploration Zebo Peng Embedded Systems Laboratory (ESLAB) Linköping University Outline Optimization problems in ERT system design Heuristic techniques Simulated
More informationLECTURE 20: SWARM INTELLIGENCE 6 / ANT COLONY OPTIMIZATION 2
15-382 COLLECTIVE INTELLIGENCE - S18 LECTURE 20: SWARM INTELLIGENCE 6 / ANT COLONY OPTIMIZATION 2 INSTRUCTOR: GIANNI A. DI CARO ANT-ROUTING TABLE: COMBINING PHEROMONE AND HEURISTIC 2 STATE-TRANSITION:
More informationalgorithms, i.e., they attempt to construct a solution piece by piece and are not able to offer a complete solution until the end. The FM algorithm, l
The FMSAT Satisfiability Solver: Hypergraph Partitioning meets Boolean Satisfiability Arathi Ramani, Igor Markov framania, imarkovg@eecs.umich.edu February 6, 2002 Abstract This report is intended to present
More informationCardinality Reasoning for bin-packing constraint. Application to a tank allocation problem
Cardinality Reasoning for bin-packing constraint. Application to a tank allocation problem Pierre Schaus 1, Jean-Charles Régin 2, Rowan Van Schaeren 3, Wout Dullaert 4, and Birger Raa 5 1 ICTEAM, Université
More informationGeneral properties of staircase and convex dual feasible functions
General properties of staircase and convex dual feasible functions JÜRGEN RIETZ, CLÁUDIO ALVES, J. M. VALÉRIO de CARVALHO Centro de Investigação Algoritmi da Universidade do Minho, Escola de Engenharia
More informationHARNESSING CERTAINTY TO SPEED TASK-ALLOCATION ALGORITHMS FOR MULTI-ROBOT SYSTEMS
HARNESSING CERTAINTY TO SPEED TASK-ALLOCATION ALGORITHMS FOR MULTI-ROBOT SYSTEMS An Undergraduate Research Scholars Thesis by DENISE IRVIN Submitted to the Undergraduate Research Scholars program at Texas
More information56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998
56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998 Part A: Answer any four of the five problems. (15 points each) 1. Transportation problem 2. Integer LP Model Formulation
More informationEvolutionary Computation for Combinatorial Optimization
Evolutionary Computation for Combinatorial Optimization Günther Raidl Vienna University of Technology, Vienna, Austria raidl@ads.tuwien.ac.at EvoNet Summer School 2003, Parma, Italy August 25, 2003 Evolutionary
More informationRecursive column generation for the Tactical Berth Allocation Problem
Recursive column generation for the Tactical Berth Allocation Problem Ilaria Vacca 1 Matteo Salani 2 Michel Bierlaire 1 1 Transport and Mobility Laboratory, EPFL, Lausanne, Switzerland 2 IDSIA, Lugano,
More information5.3 Cutting plane methods and Gomory fractional cuts
5.3 Cutting plane methods and Gomory fractional cuts (ILP) min c T x s.t. Ax b x 0integer feasible region X Assumption: a ij, c j and b i integer. Observation: The feasible region of an ILP can be described
More informationInteger Programming ISE 418. Lecture 7. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 7 Dr. Ted Ralphs ISE 418 Lecture 7 1 Reading for This Lecture Nemhauser and Wolsey Sections II.3.1, II.3.6, II.4.1, II.4.2, II.5.4 Wolsey Chapter 7 CCZ Chapter 1 Constraint
More informationINF Biologically inspired computing Lecture 1: Marsland chapter 9.1, Optimization and Search Jim Tørresen
INF3490 - Biologically inspired computing Lecture 1: Marsland chapter 9.1, 9.4-9.6 2017 Optimization and Search Jim Tørresen Optimization and Search 2 Optimization and Search Methods (selection) 1. Exhaustive
More informationMassively Parallel Approximation Algorithms for the Traveling Salesman Problem
Massively Parallel Approximation Algorithms for the Traveling Salesman Problem Vaibhav Gandhi May 14, 2015 Abstract This paper introduces the reader to massively parallel approximation algorithms which
More informationIEOR E4008: Computational Discrete Optimization
Yuri Faenza IEOR Department Jan 23th, 2018 Logistics Instructor: Yuri Faenza Assistant Professor @ IEOR from 2016 Research area: Discrete Optimization Schedule: MW, 10:10-11:25 Room: 303 Mudd Office Hours:
More informationUsing SAS/OR to Optimize Scheduling and Routing of Service Vehicles
Paper SAS1758-2018 Using SAS/OR to Optimize Scheduling and Routing of Service Vehicles Rob Pratt, SAS Institute Inc. ABSTRACT An oil company has a set of wells and a set of well operators. Each well has
More informationAdaptive Large Neighborhood Search
Adaptive Large Neighborhood Search Heuristic algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) VLSN and LNS By Very Large Scale Neighborhood (VLSN) local search, we
More informationA Development of Hybrid Cross Entropy-Tabu Search Algorithm for Travelling Repairman Problem
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 A Development of Hybrid Cross Entropy-Tabu Search Algorithm for Travelling
More informationSOLVING THE TASK ASSIGNMENT PROBLEM WITH A VARIABLE NEIGHBORHOOD SEARCH. Jozef Kratica, Aleksandar Savić, Vladimir Filipović, Marija Milanović
Serdica J. Computing 4 (2010), 435 446 SOLVING THE TASK ASSIGNMENT PROBLEM WITH A VARIABLE NEIGHBORHOOD SEARCH Jozef Kratica, Aleksandar Savić, Vladimir Filipović, Marija Milanović Abstract. In this paper
More informationHeuristic Optimization
Heuristic Optimization Thomas Stützle RDA, CoDE Université Libre de Bruxelles stuetzle@ulb.ac.be iridia.ulb.ac.be/~stuetzle iridia.ulb.ac.be/~stuetzle/teaching/ho Example problems imagine a very good friend
More informationDynamic programming for the orienteering problem with time windows
Dynamic programming for the orienteering problem with time windows Giovanni Righini, Matteo Salani Dipartimento di Tecnologie dell Informazione Università degli Studi di Milano, Via Bramante 65, 26013
More informationCombinatorial Optimization
Combinatorial Optimization Frank de Zeeuw EPFL 2012 Today Introduction Graph problems - What combinatorial things will we be optimizing? Algorithms - What kind of solution are we looking for? Linear Programming
More informationA simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints
A simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints Sohaib Afifi 1, Duc-Cuong Dang 1,2, and Aziz Moukrim 1 1 Université de Technologie de Compiègne
More informationGraph Coloring Facets from a Constraint Programming Formulation
Graph Coloring Facets from a Constraint Programming Formulation David Bergman J. N. Hooker Carnegie Mellon University INFORMS 2011 Motivation 0-1 variables often encode choices that can be represented
More informationPolyhedral results for the Cardinality Constrained Multi-cycle Problem (CCMcP) and the Cardinality Constrained Cycles and Chains Problem (CCCCP)
1st International Congress on Modelling and Simulation, Gold Coast, Australia, 9 Nov to 4 Dec 015 www.mssanz.org.au/modsim015 Polyhedral results for the Cardinality Constrained Multi-cycle Problem (CCMcP)
More informationTime Complexity of an Algorithm
CPSC 211 Data Structures & Implementations (c) Texas A&M University [ 335] Time Complexity of an Algorithm Time complexity of an algorithm: the function T (n) that describes the (worst-case) running time
More informationA Tabu Search Heuristic for the Generalized Traveling Salesman Problem
A Tabu Search Heuristic for the Generalized Traveling Salesman Problem Jacques Renaud 1,2 Frédéric Semet 3,4 1. Université Laval 2. Centre de Recherche sur les Technologies de l Organisation Réseau 3.
More informationConstraint Programming for Timetabling
Constraint Programming for Faculty of Informatics, Masaryk University Brno, Czech Republic http://www.fi.muni.cz/~hanka ASAP Seminar, 2004 University Course demands for individual students conflicts among
More informationEffective Local Search Algorithms for the Vehicle Routing Problem with General Time Window Constraints
MIC 2001-4th Metaheuristics International Conference 293 Effective Local Search Algorithms for the Vehicle Routing Problem with General Time Window Constraints Toshihide Ibaraki Mikio Kubo Tomoyasu Masuda
More informationarxiv: v1 [cs.dm] 6 May 2009
Solving the 0 1 Multidimensional Knapsack Problem with Resolution Search Sylvain Boussier a, Michel Vasquez a, Yannick Vimont a, Saïd Hanafi b and Philippe Michelon c arxiv:0905.0848v1 [cs.dm] 6 May 2009
More information