Weight Annealing Heuristics for Solving the Two-Dimensional Bin Packing Problem
|
|
- Johnathan Short
- 6 years ago
- Views:
Transcription
1 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 Conference Charleston, Jan 009
2 Outline of Presentation Introduction Concept of Weight Annealing One-Dimensional Bin Packing Problems Classic Bin Packing Two-Dimensional Bin Packing Problems Computational Results Conclusions
3 Weight Annealing Concept Assigning different weights to different parts of a combinatorial problem to guide computational effort to poorly solved regions Ninio and Schneider (005) Allowing both uphill and downhill moves to escape from a poor local optimum Tracking changes in objective function value and how well every region is being solved Applied to the Traveling Salesman Problem (Ninio and Schneider 005) Weight annealing led to mostly better results than simulated annealing
4 Solving the TSP with Weight Annealing () Local Optimum (visit sequence: ) 3
5 One-Dimensional Bin Packing Problem A classic combinatorial optimization problem Pack a set of N = {,,, n} items, each with size t i, i=,,, n, into identical bins, each with capacity C Minimize the number of bins without violating the capacity constraints Large literature on solving this NP-hard problem 4
6 Outline of Weight Annealing Algorithm Construct an initial solution using first-fit decreasing Compute and assign weights to items to distort sizes according to the packing solutions of individual bins Perform local search by swapping items between all pairs of bins Carry out re-weighting based on the result of the previous optimization run Reduce weight distortion according to a cooling schedule 5
7 Neighborhood Search for Bin Packing Problem From a current solution, obtain the next solution by swapping items between bins with the following objective function (suggested by Fleszar and Hindi 00) p = i= Maximize f ( l ) i l i q i j= bin i load p = number of bins q i t j = t j = number of items in bin = size of item j i f = (5 + 3) + = 68 f = + + = new (5 3 ) 00 6
8 Neighborhood Search for Bin Packing Problem Swap (,) Uphill move Bin α Bin β Bin α (f = 6) ( f new = 64) Bin β Swap (,) Uphill move Bin α Bin β Bin α (f = 6) ( f new = 64) Bin β 7
9 Weight Annealing for Bin Packing Problem Weight of bin i ω i = + K r i residual capacity C li ri = C C = capacity l = load of bin i i An item in a not-so-well-packed bin, with large r i, will have its size distorted by a large amount No size distortions for items in fully packed bins K controls the size distortion, given a fixed r i 8
10 Weight Annealing for Bin Packing Problem Weight annealing allows downhill moves in a maximization problem Example C = 00, K= 0.5, 00 li ωi = ω =.05 ω =.087 transformation 9.5 (90) (80) 0.50 (00) 9.44 (85) Bin Bin Transformed space f = Original space f = 6335 Transformed space f new = 703. Original space f new = 635 Transformed space - uphill move Original space - downhill move 9
11 Weight Annealing for Bin Packing Problem Step 0. Step. Step. Initialization Parameters are K (scaling parameter), nloop, T (temperature), and Tred. Inputs are number of items (n), item sizes (t j ), bin capacity (C), and lower bound (LB). Construct an initial solution using first-fit decreasing procedure. Compute residual capacity r i. Improve the current solution. For i = to nloop Compute the weights w it = ( + Kr i ) T. Do for all pairs of bins Perform Swap (,0){ Evaluate feasibility and f(,0). If f(,0) 0 Move the item. Exit Swap(,0) and, Exit i loop if LB is reached. Exit Swap (,0) if no feasible move with f(,0) 0 is found. } Step 3. Perform Swap (,) Perform Swap (,) Perform Swap (,) T := T Tred End of i loop Output the results. Outputs are the number of bins used, the final distribution of items, and r i. 0
12 Two-Dimensional Bin Packing Problems Problem statement Allocate, without overlapping, n rectangular items to identical rectangular bins Pack items such that the edges of bins and items are parallel to each other Minimize the total number of rectangular bins (NP-hard) Classifications Guillotine cutting BP O G BP R G Free cutting BP O F BP R F Fixed Orientation (O), Guillotine Cutting (G) Allowable 90 Rotation (R), Guillotine Cutting (G) Fixed Orientation (O), Free Cutting (F) Allowable 90 Rotation (R), Free Cutting (F)
13 Two-Dimensional Bin Packing Problems (BP O G) Hybrid first-fit algorithm Phase One (one-dimensional horizontal level packing) Arrange the items in the order of non-increasing height Pack the items from left to right into levels; each level i with a maximum width W Pack an item (left justified) on the first level that can accommodate it; initiate a new level if no level can accommodate it Phase Two (one-dimensional vertical bin packing) Arrange the levels in the order of non-increasing height h i ; this is the height of the first item on the left Solve one-dimensional bin packing problems, each item i with size h i and bin size H
14 Two-Dimensional Bin Packing Problems (BP O G) Example: Arrange items in the order of non-increasing height 3
15 Two-Dimensional Bin Packing Problems (BP O G) An example of hybrid first-fit Phase - One Dimensional Horizontal Level Packing h h h 5 8 h 3 w 4
16 Two-Dimensional Bin Packing Problems (BP O G) Hybrid first-fit algorithm Phase One (one-dimensional horizontal level packing) Arrange the items in the order of non-increasing height Pack the items from left to right into levels; each level i with the same width W Pack an item (left justified) on the first level that can accommodate it; initiate a new level if no level can accommodate it Phase Two (one-dimensional vertical bin packing) Solve one-dimensional bin packing problems, each item i with size h i and bin size H 5
17 Two-Dimensional Bin Packing Problems (BP O G) An example of hybrid first-fit Phase - One Dimensional Horizontal Level Packing Phase - One Dimensional Vertical Bin Packing h h h h 5 8 h 5 8 Bin h 3 h H w h 3 w Bin 6
18 Two-Dimensional Bin Packing Problems (BP O G) Weakness of hybrid first-fit 7
19 Weight Annealing Algorithm(BP O G) Phase One (one-dimensional horizontal level packing) Construct an initial solution Arrange the items in the order of non-increasing height Swap items between levels to minimize the number of levels Objective function p p Maximize f = ( bi ) - ( Whi - Ai ) i= i= b w i ij = m i j= w ij = width of item j in level i mi = number of items in level i p = number of levels A = sum of item areas in level i i h i = height of level i W = bin width 8
20 Weight Annealing Algorithm(BP O G) p Example Maximize f = ( bi ) i= Level Level b = (5 + 3) = 64 b = =4 f = b + b = 68 (two levels) Level f = ( ) = 00 (one level) 9
21 Weight Annealing Algorithm(BP O G) p p Example = i Maximize f ( b ) - ( Wh - A ) i= i= i i 0
22 Weight Annealing Algorithm(BP O G) Phase Two (one-dimensional vertical bin packing) Construct initial solution with first-fit decreasing using level height h i as item sizes and bin height H Swap levels between bins to minimize the number of bins Objective function Maximize f = ( d ) q i= i d i = m i j= h ij h = height of level j in bin i ij mi = number of levels in bin i q = number of bins
23 Weight Annealing Algorithm(BP O G) Phase Three q Filling unused space in each level Maximize f = ( Ai ) i=
24 Weight Annealing Algorithm(BP O G) Phase Three q Filling unused space at the top of each bin Maximize f = ( Ai ) i= 3
25 Weight Annealing Algorithm(BP O G) Weight assignments Phase One W bi ωi = + Kri ri = W Phase Two H di ωi = + Kri ri = H Phase Three HW Ai ωi = + Kri ri = HW 4
26 Solution Procedures Tabu search by Lodi, Martello and Toth (999) for BP O G, BP R G, BP O F, BP R F Guided local search by Faroe, Pisinger and Zachariasen (003) for BP O F Exact algorithm by Martello and Vigo (998) for BP O F Constructive algorithm (HBP) by Boschetti and Mingozzi (003) for BP O F Set covering heuristics by Monaci and Toth (006) for BP O F 500 test instances in all for BP O F 5
27 Computational Results for BP O F Procedures Number of bins Running Time (sec) Tabu Search Guided Local Search Exact Algorithm Constructive Algorithm (HBP) Set Covering Heuristics Weight Annealing Best Lower Bound (LB): 773 bins Weight Annealing is.% above LB Timed out on several problems 6
28 Conclusions The application of weight annealing to bin packing and knapsack problems is new Weight annealing algorithms produce high-quality solutions Weight annealing algorithms are fast and competitive Easy to understand Simple to code Small number of parameters 7
Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm
Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm Kok-Hua Loh Nanyang Technological University Bruce Golden University of Maryland Edward Wasil American University
More informationT S 2 P ACK: A Two-Level Tabu Search for the Three-dimensional Bin Packing Problem
T S 2 P ACK: A Two-Level Tabu Search for the Three-dimensional Bin Packing Problem Teodor Gabriel Crainic Département de management et technologie École des sciences de la gestion, U.Q.A.M. and CIRRELT,
More informationTwo-Dimensional Bin Packing Problem with Guillotine Restrictions
Alma Mater Studiorum Università di Bologna DEI - Dipartimento di Ingegneria dell Energia Elettrica e dell Informazione Guglielmo Marconi Dottorato di Ricerca in Automatica e Ricerca Operativa Ciclo XXVI
More informationarxiv: v1 [cs.dm] 22 Jul 2011
Bottom-Left Placement Theorem for Rectangle Packing Wenqi Huang, Tao Ye arxiv:1107.6v1 [cs.dm] Jul 011 School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, 007,
More informationAn Efficient Meta-Heuristic for Multi-Dimensional Multi-Container Packing
An Efficient Meta-Heuristic for Multi-Dimensional Multi-Container Packing Guido Perboli Teodor Gabriel Crainic Roberto Tadei March 2011 Bureaux de Montréal : Bureaux de Québec : Université de Montréal
More informationTwo dimensional bin packing problem
Two dimensional bin packing problem The two dimensional bin packing problem is essentially a problem of fitting rectangles into minimum number of given large rectangles. Given rectangles (bins) of size
More informationROADEF / EURO 2018 Challenge Cutting Optimization Problem Description
ROADEF / EURO 2018 Challenge Cutting Optimization Problem Description Lydia Tlilane and Quentin Viaud Saint-Gobain, Datalab February 23, 2018 Contents 1 Introduction 2 2 Problem description 3 2.1 Inputs,
More informationA Hybrid Improvement Heuristic for the Bin Packing Problem
MIC 2001-4th Metaheuristics International Conference 63 A Hybrid Improvement Heuristic for the Bin Packing Problem Adriana C.F. Alvim Dario J. Aloise Fred Glover Celso C. Ribeiro Department of Computer
More informationResearch Incubator: Combinatorial Optimization. Dr. Lixin Tao December 9, 2003
Research Incubator: Combinatorial Optimization Dr. Lixin Tao December 9, 23 Content General Nature of Research on Combinatorial Optimization Problem Identification and Abstraction Problem Properties and
More informationAn Ant Colony Optimization Heuristic for Solving the Two- Dimensional Level Packing Problems
An Ant Colony Optimization Heuristic for Solving the Two- Dimensional Level Packing Problems AzzaGaber, RaafatElshaer and MahassenKhater Industrial Engineering Department Faculty of Engineering, Zagazig
More informationAlgorithms for Two-Dimensional Bin Packing and Assignment Problems
UNIVERSITÀ DEGLI STUDI DI BOLOGNA Dottorato di Ricerca in Ingegneria dei Sistemi XII Ciclo Sede Amministrativa: Università di Bologna Sedi Consorziate: Università di Firenze, Padova e Siena Algorithms
More informationTWO-DIMENSIONAL PACKING PROBLEMS IN TELECOMMUNICATIONS. Silvano Martello. Received April 21, 2013 / Accepted May 20, 2013
Pesquisa Operacional (2014) 34(1): 31-38 2014 Brazilian Operations Research Society Printed version ISSN 0101-7438 / Online version ISSN 1678-5142 www.scielo.br/pope TO-DIMENSIONAL PACKING PROBLEMS IN
More informationEstimation of Wirelength
Placement The process of arranging the circuit components on a layout surface. Inputs: A set of fixed modules, a netlist. Goal: Find the best position for each module on the chip according to appropriate
More informationON WEIGHTED RECTANGLE PACKING WITH LARGE RESOURCES*
ON WEIGHTED RECTANGLE PACKING WITH LARGE RESOURCES* Aleksei V. Fishkin, 1 Olga Gerber, 1 Klaus Jansen 1 1 University of Kiel Olshausenstr. 40, 24118 Kiel, Germany {avf,oge,kj}@informatik.uni-kiel.de Abstract
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 informationHybrid Constraint Programming and Metaheuristic methods for Large Scale Optimization Problems
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
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 informationAn Empirical Investigation of Meta-heuristic and Heuristic Algorithms for a 2D Packing Problem
European Journal of Operational Research 128/1, 34-57, 2000. An Empirical Investigation of Meta-heuristic and Heuristic Algorithms for a 2D Packing Problem E. Hopper and B. C. H. Turton School of Engineering,
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 informationCS 331: Artificial Intelligence Local Search 1. Tough real-world problems
CS 331: Artificial Intelligence Local Search 1 1 Tough real-world problems Suppose you had to solve VLSI layout problems (minimize distance between components, unused space, etc.) Or schedule airlines
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 informationFundamentals of Integer Programming
Fundamentals of Integer Programming Di Yuan Department of Information Technology, Uppsala University January 2018 Outline Definition of integer programming Formulating some classical problems with integer
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 informationCAD Algorithms. Placement and Floorplanning
CAD Algorithms Placement Mohammad Tehranipoor ECE Department 4 November 2008 1 Placement and Floorplanning Layout maps the structural representation of circuit into a physical representation Physical representation:
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 informationAlgorithm Design Methods. Some Methods Not Covered
Algorithm Design Methods Greedy method. Divide and conquer. Dynamic Programming. Backtracking. Branch and bound. Some Methods Not Covered Linear Programming. Integer Programming. Simulated Annealing. Neural
More informationHybrid genetic algorithms for the three-dimensional multiple container packing problem
Flex Serv Manuf J (2015) 27:451 477 DOI 10.1007/s10696-013-9181-8 Hybrid genetic algorithms for the three-dimensional multiple container packing problem Xuehao Feng Ilkyeong Moon Jeongho Shin Published
More informationA Hybrid Genetic Algorithms and Tabu Search for Solving an Irregular Shape Strip Packing Problem
A Hybrid Genetic Algorithms and Tabu Search for Solving an Irregular Shape Strip Packing Problem Kittipong Ekkachai 1 and Pradondet Nilagupta 2 ABSTRACT This paper presents a packing algorithm to solve
More informationUsing Genetic Algorithms to Solve the Box Stacking Problem
Using Genetic Algorithms to Solve the Box Stacking Problem Jenniffer Estrada, Kris Lee, Ryan Edgar October 7th, 2010 Abstract The box stacking or strip stacking problem is exceedingly difficult to solve
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 informationThree-Dimensional Container Loading: A Simulated Annealing Approach
University of Windsor Scholarship at UWindsor Industrial and Manufacturing Systems Engineering Publications Department of Industrial and Manufacturing Systems Engineering 017 Three-Dimensional Container
More informationA hybrid improvement heuristic for the bin-packing problem and its application to the multiprocessor scheduling problem
A hybrid improvement heuristic for the bin-packing problem and its application to the multiprocessor scheduling problem Adriana C. F. Alvim 1, Celso C. Ribeiro 1 1 Departamento de Informática Pontifícia
More informationA Distributed Hybrid Algorithm for Composite Stock Cutting
Appl. Math. Inf. Sci. 6 No. 2S pp. 661S-667S (2012) Applied Mathematics & Information Sciences An International Journal @ 2012 NSP Natural Sciences Publishing Cor. A Distributed Hybrid Algorithm for Composite
More informationA HYBRID HEURISTIC FOR THE CONSTRAINED TWO-DIMENSIONAL NON-GUILLOTINE ORTHOGONAL CUTTING PROBLEM
A HYBRID HEURISTIC FOR THE CONSTRAINED TWO-DIMENSIONAL NON-GUILLOTINE ORTHOGONAL CUTTING PROBLEM JOSÉ FERNANDO GONÇALVES AND MAURICIO G. C. RESENDE ABSTRACT. This paper addresses a constrained two-dimensional
More informationA recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
Computers & Operations Research 35 (2008) 1281 1291 www.elsevier.com/locate/cor A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem Yaodong Cui, Yuli Yang, Xian
More informationAn exact approach for the vehicle routing problem with two-dimensional loading constraints
An exact approach for the vehicle routing problem with two-dimensional loading constraints Manuel Iori, Juan José Salazar González,Daniele Vigo DEIS, Dipartimento di Elettronica, Informatica e Sistemistica,
More informationSolving Capacitated P-Median Problem by Hybrid K-Means Clustering and Fixed Neighborhood Search algorithm
Proceedings of the 2010 International Conference on Industrial Engineering and Operations Management Dhaka, Bangladesh, January 9 10, 2010 Solving Capacitated P-Median Problem by Hybrid K-Means Clustering
More informationReduction and Exact Algorithms for the Disjunctively Constrained Knapsack Problem
Reduction and Exact Algorithms for the Disjunctively Constrained Knapsack Problem Aminto Senisuka Byungjun You Takeo Yamada Department of Computer Science The National Defense Academy, Yokosuka, Kanagawa
More informationAn empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
European Journal of Operational Research 128 (2001) 34±57 www.elsevier.com/locate/dsw Theory and Methodology An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
More informationIntroduction. A very important step in physical design cycle. It is the process of arranging a set of modules on the layout surface.
Placement Introduction A very important step in physical design cycle. A poor placement requires larger area. Also results in performance degradation. It is the process of arranging a set of modules on
More informationAn Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem
Vol. 33, No. 9 ACTA AUTOMATICA SINICA September, 2007 An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem ZHANG De-Fu 1 CHEN Sheng-Da 1 LIU Yan-Juan
More informationOne-Dimension Multi-Objective Bin Packing Problem using Memetic Algorithm
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 2, February 2014,
More informationNetworks: Lecture 2. Outline
Networks: Lecture Amedeo R. Odoni November 0, 00 Outline Generic heuristics for the TSP Euclidean TSP: tour construction, tour improvement, hybrids Worst-case performance Probabilistic analysis and asymptotic
More informationOne-Dimensional Heuristics Adapted for Two-Dimensional Rectangular Strip Packing G. Belov, G. Scheithauer, E. A. Mukhacheva
One-Dimensional Heuristics Adapted for Two-Dimensional Rectangular Strip Packing G. Belov, G. Scheithauer, E. A. Mukhacheva Dresden University Preprint MATH-NM-02-2006 Revised on October 23, 2006 Abstract
More informationSolving a Real-World Glass Cutting Problem
Solving a Real-World Glass Cutting Problem Jakob Puchinger, Günther R. Raidl, and Gabriele Koller Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria {puchinger
More informationInteger Programming and Network Modeis
H.A. Eiselt C.-L. Sandblom Integer Programming and Network Modeis With Contributions by K. Spielberg, E. Richards, B.T. Smith, G. Laporte, B.T. Boffey With 165 Figures and 43 Tables &m Springer CONTENTS
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 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 informationA Course on Meta-Heuristic Search Methods for Combinatorial Optimization Problems
A Course on Meta-Heuristic Search Methods for Combinatorial Optimization Problems AutOrI LAB, DIA, Roma Tre Email: mandal@dia.uniroma3.it January 16, 2014 Outline 1 An example Assignment-I Tips Variants
More informationSolving the Hard Knapsack Problems with a Binary Particle Swarm Approach
Solving the Hard Knapsack Problems with a Binary Particle Swarm Approach Bin Ye 1, Jun Sun 1, and Wen-Bo Xu 1 School of Information Technology, Southern Yangtze University, No.1800, Lihu Dadao, Wuxi, Jiangsu
More informationOne-Dimensional Heuristics Adapted for Two-Dimensional Rectangular Strip Packing G. Belov, G. Scheithauer, E.A. Mukhacheva
One-Dimensional Heuristics Adapted for Two-Dimensional Rectangular Strip Packing G. Belov, G. Scheithauer, E.A. Mukhacheva Dresden University Preprint MATH-NM-02-2006, March 1, 2006 Abstract We consider
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 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 informationA Recursive Revised First Fit Algorithm for Cutting Stock Problem
International Journal of Information Systems for Logistics and Management Vol. 4, No. 1 (2008) 31-40 http://www.knu.edu.tw/academe/englishweb/web/ijislmweb/index.html A Recursive Revised First Fit Algorithm
More informationA global search framework for practical three-dimensional packing with variable carton orientations
A global search framework for practical three-dimensional packing with variable carton orientations Author He, Yaohua, Wu, Yong, Souza, Robert Published 2012 Journal Title Computers & Operations Research
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 informationHardware-Software Codesign
Hardware-Software Codesign 4. System Partitioning Lothar Thiele 4-1 System Design specification system synthesis estimation SW-compilation intellectual prop. code instruction set HW-synthesis intellectual
More informationTerm Paper for EE 680 Computer Aided Design of Digital Systems I Timber Wolf Algorithm for Placement. Imran M. Rizvi John Antony K.
Term Paper for EE 680 Computer Aided Design of Digital Systems I Timber Wolf Algorithm for Placement By Imran M. Rizvi John Antony K. Manavalan TimberWolf Algorithm for Placement Abstract: Our goal was
More informationA Heuristic Based on Integer Programming for the Vehicle Routing Problem with Backhauls
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 A Heuristic Based on Integer Programming for the Vehicle Routing Problem
More informationNon-deterministic Search techniques. Emma Hart
Non-deterministic Search techniques Emma Hart Why do local search? Many real problems are too hard to solve with exact (deterministic) techniques Modern, non-deterministic techniques offer ways of getting
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 informationA GENETIC ALGORITHM FOR TWO DIMENSIONAL STRIP PACKING PROBLEMS. Nelson Mandela Metropolitan University, South Africa
A GENETIC ALGORITHM FOR TWO DIMENSIONAL STRIP PACKING PROBLEMS V. Mancapa 1, T.I. van Niekerk 2 and T Hua 2 1 Department of Electrical Engineering Nelson Mandela Metropolitan University, South Africa mancapa@nmmu.ac.za
More informationResearch Article Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service
Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 28, Article ID 9981, 1 pages doi:1.11/28/9981 Research Article Single-Commodity Vehicle Routing Problem with Pickup and Delivery
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 informationAvailable online at ScienceDirect. Procedia Engineering 183 (2017 )
Available online at www.sciencedirect.com ScienceDirect Procedia Engineering 183 (2017 ) 291 296 17th International Conference on Sheet Metal, SHEMET17 Meta-heuristic algorithms for nesting problem of
More informationAn ILS Algorithm for the Team Orienteering Problem with Variable Profit
An ILS Algorithm for the Team Orienteering Problem with Variable Profit Aldy Gunawan School of Information Systems Singapore Management University, Singapore Tel: (+65) 6808-5227, Email: aldygunawan@smu.edu.sg
More informationConstructive procedures to solve 2-Dimensional Bin Packing Problems with Irregular Pieces and Guillotine Cuts
Constructive procedures to solve 2-Dimensional Bin Packing Problems with Irregular Pieces and Guillotine Cuts Antonio Martinez a, Ramon Alvarez-Valdes b, Julia Bennell a, Jose Manuel Tamarit b a University
More informationA decomposition problem of a natural number for a rectangular cutting-covering model
Proceedings of the th WSEAS International Conference on COMPUTERS, Agios Nikolaos, Crete Island, Greece, July 2-2, 200 A decomposition problem of a natural number for a rectangular cutting-covering model
More informationeocsa: An Algorithm for Burst Mapping with Strict QoS Requirements in IEEE e Mobile WiMAX Networks
eocsa: An Algorithm for Burst Mapping with Strict QoS Requirements in IEEE 82.6e Mobile WiMAX Networks Chakchai So-In Department of Computer Science & Engineering, Washington University in St. Louis St.
More informationAPPROXIMATION ALGORITHMS FOR GEOMETRIC PROBLEMS
APPROXIMATION ALGORITHMS FOR GEOMETRIC PROBLEMS Subhas C. Nandy (nandysc@isical.ac.in) Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata 70010, India. Organization Introduction
More informationIntroduction to Approximation Algorithms
Introduction to Approximation Algorithms Dr. Gautam K. Das Departmet of Mathematics Indian Institute of Technology Guwahati, India gkd@iitg.ernet.in February 19, 2016 Outline of the lecture Background
More informationAlgorithm Design (4) Metaheuristics
Algorithm Design (4) Metaheuristics Takashi Chikayama School of Engineering The University of Tokyo Formalization of Constraint Optimization Minimize (or maximize) the objective function f(x 0,, x n )
More informationHeuristic Algorithms for the Fixed-Charge Multiple Knapsack Problem
The 7th International Symposium on Operations Research and Its Applications (ISORA 08) Lijiang, China, October 31 Novemver 3, 2008 Copyright 2008 ORSC & APORC, pp. 207 218 Heuristic Algorithms for the
More informationComplete Local Search with Memory
Complete Local Search with Memory Diptesh Ghosh Gerard Sierksma SOM-theme A Primary Processes within Firms Abstract Neighborhood search heuristics like local search and its variants are some of the most
More informationA hybrid algorithm for two-dimensional guillotine cutting problems. Brazil. Brazil.
A hybrid algorithm for two-dimensional guillotine cutting problems David Álvarez Martínez 1;a, Luis Miguel Escobar Falcón 2;b, Eliana Mirledy Toro 3;c and Rubén Augusto Romero Lázaro 4;d 1 São Paulo State
More informationIntegrating Mixed-Integer Optimisation & Satisfiability Modulo Theories
Integrating Mixed-Integer Optimisation & Satisfiability Modulo Theories Application to Scheduling Miten Mistry and Ruth Misener Wednesday 11 th January, 2017 Mistry & Misener MIP & SMT Wednesday 11 th
More informationOptimization of Process Plant Layout Using a Quadratic Assignment Problem Model
Optimization of Process Plant Layout Using a Quadratic Assignment Problem Model Sérgio. Franceira, Sheila S. de Almeida, Reginaldo Guirardello 1 UICAMP, School of Chemical Engineering, 1 guira@feq.unicamp.br
More informationA Compressed Annealing Heuristic for the Traveling Salesman Problem with Time Windows
A Compressed Annealing Heuristic for the Traveling Salesman Problem with Time Windows Jeffrey W. Ohlmann Barrett W. Thomas Department of Management Sciences, University of Iowa 108 John Pappajohn Business
More informationAn Ant System with Direct Communication for the Capacitated Vehicle Routing Problem
An Ant System with Direct Communication for the Capacitated Vehicle Routing Problem Michalis Mavrovouniotis and Shengxiang Yang Abstract Ant colony optimization (ACO) algorithms are population-based algorithms
More informationOutline. Informed Search. Recall: Uninformed Search. An Idea. Heuristics Informed search techniques More on heuristics Iterative improvement
Outline Informed Search ECE457 Applied Artificial Intelligence Fall 2007 Lecture #3 Heuristics Informed search techniques More on heuristics Iterative improvement Russell & Norvig, chapter 4 Skip Genetic
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 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 informationOpen Vehicle Routing Problem Optimization under Realistic Assumptions
Int. J. Research in Industrial Engineering, pp. 46-55 Volume 3, Number 2, 204 International Journal of Research in Industrial Engineering www.nvlscience.com Open Vehicle Routing Problem Optimization under
More informationREM WORKING PAPER SERIES. Iterated Local Search Algorithm for the Vehicle Routing Problem with Backhauls and Soft Time Windows.
REM WORKING PAPER SERIES Iterated Local Search Algorithm for the Vehicle Routing Problem with Backhauls and Soft Time Windows José Brandão REM Working Paper 010-2017 October 2017 REM Research in Economics
More informationA Two-Dimensional Mapping for the Traveling Salesman Problem
Computers Math. Apphc. Vol. 26, No. 12, pp. 65-73, 1993 0898-1221/93 $6.00 + 0.00 Printed in Great Britain. All rights reserved Copyright 1993 Pergarnon Press Ltd A Two-Dimensional Mapping for the Traveling
More informationAn Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem
An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem Harald Feltl and Günther R. Raidl Institute of Computer Graphics and Algorithms Vienna University of Technology, Vienna, Austria
More informationVirtualization in Wireless Networks Feb. 23 th, 2009
Virtualization in Wireless Networks Feb. 23 th, 2009 Heejin Lee Keum-mo Park Prof. Chong-kwon Kim Outline Introduction Examples: WLAN virtualization Techniques: Wireless resource isolation Embedding problem
More informationRecent advances on two-dimensional bin packing problems
Discrete Applied Mathematics 123 (2002) 379 396 Recent advances on two-dimensional bin packing problems Andrea Lodi, Silvano Martello, Daniele Vigo Dipartimento di Elettronica, Informatica e Sistemistica,
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 informationA Bi-directional Resource-bounded Dynamic Programming Approach for the Traveling Salesman Problem with Time Windows
Submitted manuscript A Bi-directional Resource-bounded Dynamic Programming Approach for the Traveling Salesman Problem with Time Windows Jing-Quan Li California PATH, University of California, Berkeley,
More informationThree-Dimensional Cylindrical Model for Single-Row Dynamic Routing
MATEMATIKA, 2014, Volume 30, Number 1a, 30-43 Department of Mathematics, UTM. Three-Dimensional Cylindrical Model for Single-Row Dynamic Routing 1 Noraziah Adzhar and 1,2 Shaharuddin Salleh 1 Department
More informationSeach algorithms The travelling salesman problem The Towers of Hanoi Playing games. Comp24412: Symbolic AI. Lecture 4: Search. Ian Pratt-Hartmann
Comp24412: Symbolic AI Lecture 4: Search Ian Pratt-Hartmann Room KB2.38: email: ipratt@cs.man.ac.uk 2016 17 Outline Seach algorithms The travelling salesman problem The Towers of Hanoi Playing games Typical
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 informationCMSC 451: Lecture 22 Approximation Algorithms: Vertex Cover and TSP Tuesday, Dec 5, 2017
CMSC 451: Lecture 22 Approximation Algorithms: Vertex Cover and TSP Tuesday, Dec 5, 2017 Reading: Section 9.2 of DPV. Section 11.3 of KT presents a different approximation algorithm for Vertex Cover. Coping
More informationSolving the Capacitated Vehicle Routing Problem and the Split Delivery Using GRASP Metaheuristic
Solving the Capacitated Vehicle Routing Problem and the Split Delivery Using GRASP Metaheuristic Joseph Gallart Suárez and Manuel Tupia Anticona Engineering department, Pontificia Universidad Católica
More informationAlgorithms & Complexity
Algorithms & Complexity Nicolas Stroppa - nstroppa@computing.dcu.ie CA313@Dublin City University. 2006-2007. November 21, 2006 Classification of Algorithms O(1): Run time is independent of the size of
More informationDiscrete Optimization. Lecture Notes 2
Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The
More informationCutting Stock with Binary Patterns: Arc-flow Formulation with Graph Compression
Cutting Stock with Binary Patterns: Arc-flow Formulation with Graph Compression Filipe Brandão INESC TEC and Faculdade de Ciências, Universidade do Porto, Portugal fdabrandao@dcc.fc.up.pt arxiv:1502.02899v1
More informationCOMP 355 Advanced Algorithms Approximation Algorithms: VC and TSP Chapter 11 (KT) Section (CLRS)
COMP 355 Advanced Algorithms Approximation Algorithms: VC and TSP Chapter 11 (KT) Section 35.1-35.2(CLRS) 1 Coping with NP-Completeness Brute-force search: This is usually only a viable option for small
More information5. Computational Geometry, Benchmarks and Algorithms for Rectangular and Irregular Packing. 6. Meta-heuristic Algorithms and Rectangular Packing
1. Introduction 2. Cutting and Packing Problems 3. Optimisation Techniques 4. Automated Packing Techniques 5. Computational Geometry, Benchmarks and Algorithms for Rectangular and Irregular Packing 6.
More information