Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 52 for “"Tabu search"”.
-
Tabu search for bus and train driver scheduling with time windows
… of solution is therefore compromised. The research presented in this thesis focuses on solving the driver scheduling problem with WROs using a constructive approach, which builds and refines a single schedule iteratively. Filtering rules are unnecessary under the approach. The 2-opt heuristic …
-
A tabu search algorithm for the vehicle routing problem with time windows
Includes bibliographic references.
-
Minimization of weighted tardiness in job shops using shifting bottleneck and tabu search procedures
… and other losses to an organization. This research work concentrates on the problem of minimizing the total weighted tardiness in classical job shops. Job shop scheduling problems are among the hardest known combinatorial optimization problems. In particular the problem of minimizing …
-
In-core Optimization of Pressurised Water Reactor Reload Design via Multi-objective Tabu Search
… objectives simultaneously – multi-objective Tabu Search. It was statistically analysed in comparison to other common leading methods – notably the Genetic Algorithm. It was tested on real reactor models using realistic data provided by a utility. The Tabu Search was first tuned via …
-
Examination timetabling at the University of Cape Town: a tabu search approach to automation
… have expanded yet the disconnect between research and reality remains. The University of Cape Town's (UCT) Examinations Office currently produces their schedules manually with software relegated to error-checking status. While they have requested automation, this study is the first attempt …
-
Molecular Design of Crosslinked Copolymers
… using optimization techniques is a new area of research. The first part of this project seeks to develop a novel data structure capable of adequately storing a complete description of the crosslinked polymer structure. Numerical descriptors of polymer structure are then calculated from the data …
-
A Probabilistic Study of 3-SATISFIABILITY
… function value assigned to each solution. Local search algorithms provide useful tools for addressing a wide variety of intractable discrete optimization problems. Each such algorithm offers a distinct set of rules to intelligently exploit the solution space with the hope of finding an …
-
In vivo research scheduling and coordination in the pharmaceutical industry
… A multi-criteria objective function uses the researcher's preference to optimize both room assignments and procedure start time. A Tabu search meta-heuristic has been developed to generate a near-optimal solution. The solution approach uses four neighborhood move strategies based on insert and …
-
Optimally Locating Facilities with Variable Characteristics
… problem which we try to solve by combining tabu search with global optimization algorithms. We develop three different tabu search methods and the computational results on a set of problem instances for comparing the performance of the solution methods show that the third tabu search method …
-
The difficulty of approximating the chromatic number for random composite graphs
… be just as difficult. Recently, many generalized search techniques have been developed to improve upon the solutions found by the heuristic algorithms.</p> <p>This paper presents results for CGCP. In particular, exact and heuristic algorithms are presented and analyzed. This study is made, to show …
-
A Complete & Practical Approach to Ensure the Legality of a Signal Transmitted by a Cognitive Radio
… to use software testing program based on the tabu search algorithm that tests the software off-line. The primary purpose of the software testing program is to find most of the errors, specially structural errors, while the radio is not in use so that it does not affect the performance of the …
-
A Convergence Analysis of Generalized Hill Climbing Algorithms
… several discrete optimization problem local search heuristics, including simulated annealing and tabu search. A necessary and a sufficient convergence condition for GHC algorithms are presented. The convergence conditions presented in this dissertation are based upon a new iteration …
-
Approaches for solving some scheduling and routing problems
… outperform simple 2-opt and 3-opt local search procedures for instances with 20 nodes.<br/>We introduce the supply ship scheduling problem, another roblem inspired by a support vessel environment. We wish to minimise the number of mobile machines required to process a set of jobs; each …
-
Robust vehicle routing in disaster relief and ride-sharing: models and algorithms
… combines the extended insertion algorithm and tabu search (TS) is proposed to solve the models for large-scale problems. In addition, a new hybrid algorithm named scoring tabu search with variable neighborhood (STSVN) is proposed to solve the models and compared with TS. The solutions of the …
-
Job shop scheduling to minimize work-in-process, earliness and tardiness costs
Our research is motivated by a scenario of a manufacturing company receiving highly customized orders from different customers. A good production schedule is required to complete the orders on time with the limited resources and minimize the relevant costs. Such a scenario is modelled as a job shop …
-
Relaxation Adaptive Memory Programming For The Resource Constrained Project Scheduling Problem
… of the most intractable problems in operations research; it is NP-hard in the strong sense. Due to the hardness of the problem, exact solution methods can only tackle instances of relatively small size. For larger instances commonly found in real applications heuristic solution methods are …
-
Search, polynomial complexity, and the fast messy genetic algorithm
… Simulated annealing, genetic algorithms, tabu search are some examples. Unfortuntely, each of these algorithms is creating a separate field in itself and their use in practice is often guided by personal discretion rather than scientific reasons. The primary reason behind this confusing …
-
Contributions to Multiple Postmen Problems
… several new improvement procedures, and a tabu search algorithm incorporating these new methods. Computational experiments show that the tabu search algorithm achieves upper bounds of high quality which in many cases could be proven to be optimal. With respect to lower bounds for the MM …
-
Home Health Care Routing and Scheduling Problem with Genetic Algorithms
… proposing a novel GA and, for the first time, a Tabu Search (TS) approach for the HHCRSP. The GA incorporates and evaluates the Best-Cost Route Crossover (BCRC) operator—originally designed for vehicle routing problems. In addition, an enhanced version of the BCRC, the Best-Cost Route Crossover …
-
Tvarkaraščio sudarymo bibliotekų tyrimas /
… mention of this can be found in C. Gotlieb's research paper on school scheduling task automation. The aim of this thesis is to analyze the possibilities of one of the selected libraries used for solving planning problems ("JacOp", "Optaplanner", "Choco Solver") based on the restriction groups …
Page 1 of 3