Results 1 
8 of
8
Applications of Modern Heuristic Search Methods to Pattern Sequencing Problems
 COMPUTERS & OPERATIONS RESEARCH
, 1999
"... This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with respect to some given objective function. We consider two di#erent objectives: Minimization of the number of simultane ..."
Abstract

Cited by 24 (6 self)
 Add to MetaCart
This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with respect to some given objective function. We consider two di#erent objectives: Minimization of the number of simultaneously open stacks and minimization of the average order spread. Both objectives require the adaptive evaluation of changed solutions to allow an e#cient application of neighbourhood search techniques.
Caching search states in permutation problems
 In van Beek [19
"... Abstract. When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment will not occur again. However, we show that for some problems recording assignments is useful, because other assi ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
Abstract. When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment will not occur again. However, we show that for some problems recording assignments is useful, because other assignments can lead to the same state of the search. We demonstrate this in two classes of permutation problem, a satisfaction problem and an optimization problem. Caching states visited has proved effective in reducing both search effort and runtime for difficult instances of each class, and the space requirements are manageable. 1
Solving Talent Scheduling with Dynamic Programming
"... We give a dynamic programming solution to the problem of scheduling scenes to minimize the cost of the talent. Starting from a basic dynamic program, we show a number of ways to improve the dynamic programming solution, by preprocessing and restricting the search. We show how by considering a bounde ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
We give a dynamic programming solution to the problem of scheduling scenes to minimize the cost of the talent. Starting from a basic dynamic program, we show a number of ways to improve the dynamic programming solution, by preprocessing and restricting the search. We show how by considering a bounded version of the problem, and determining lower and upper bounds, we can improve the search. We then show how ordering the scenes from both ends can drastically reduce the search space. The final dynamic programming solution is, orders of magnitude faster than competing approaches, and finds optimal solutions to larger problems than were considered previously.
Constraint Programming in Practice: Scheduling a Rehearsal Report
, 2003
"... The basic principles of constraint programming (constraint satisfaction problems, search, constraint propagation) are introduced by discussing how constraint programming can be used to solve a specific optimization problem. A set of orchestral pieces is to be rehearsed and the problem requires fi ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
The basic principles of constraint programming (constraint satisfaction problems, search, constraint propagation) are introduced by discussing how constraint programming can be used to solve a specific optimization problem. A set of orchestral pieces is to be rehearsed and the problem requires finding a sequence that will minimize the time that players are at the rehearsal but not playing, if they arrive for the first piece they are involved in and leave after the last. A constraint programming model of this problem is presented. A similar problem arises in `talent scheduling' in shooting a film; improvements to the basic model are given that allow a larger instance of this kind to be solved.
Iterative local search methods for the talent scheduling problem
"... We study the talent scheduling problem which can be reformulated as the column permutation problem for a binary matrix. The problem is NPhard in the strong sense. Modified greedy algorithm and iterative local search metaheuristics are developed for this problem. Computational experiments show that ..."
Abstract
 Add to MetaCart
(Show Context)
We study the talent scheduling problem which can be reformulated as the column permutation problem for a binary matrix. The problem is NPhard in the strong sense. Modified greedy algorithm and iterative local search metaheuristics are developed for this problem. Computational experiments show that we can find optimal or near optimal solutions easily by these methods if number of columns and number of rows of the matrix are at most 100.
Improving Combinatorial Optimization (Extended Abstract)
 PROCEEDINGS OF THE TWENTYTHIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
, 2013
"... Combinatorial Optimization is an important area of computer science that has many theoretical and practical applications. In the thesis [Chu, 2011], we present important contributions to several different areas of combinatorial optimization, including nogood learning, symmetry breaking, dominance, r ..."
Abstract
 Add to MetaCart
Combinatorial Optimization is an important area of computer science that has many theoretical and practical applications. In the thesis [Chu, 2011], we present important contributions to several different areas of combinatorial optimization, including nogood learning, symmetry breaking, dominance, relaxations and parallelization. We develop a new nogood learning technique based on constraint projection that allows us to exploit subproblem dominances that arise when two different search paths lead to subproblems which are identical on the remaining unfixed variables. We present a new symmetry breaking technique called SBDS1UIP, which extends Symmetry Breaking During Search (SBDS) by using the more powerful 1UIP nogoods generated by Lazy Clause Generation (LCG) solvers. We present two new general methods for exploiting almost symmetries by modifying SBDS1UIP and by using conditional symmetry breaking constraints.
4 An Enhanced Branchandbound Algorithm for the Talent Scheduling Problem
"... ar ..."
(Show Context)
OPTIMAL PRODUCTION SCHEDULE: A CASE STUDY OF PIONEER FOOD CANNERY LIMITED BY
, 2013
"... I hereby declare that this submission is my own work towards the MSc and that, to the best of my knowledge, it contains no material previously published by another person nor material which has been accepted for the award of any other degree of the University, except where due acknowledgement has be ..."
Abstract
 Add to MetaCart
I hereby declare that this submission is my own work towards the MSc and that, to the best of my knowledge, it contains no material previously published by another person nor material which has been accepted for the award of any other degree of the University, except where due acknowledgement has been made in the text.