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 11 of 11 for “"Combinational optimization"”.

  1. Algorithms and complexity analyses for some combinational optimization problems

    … this dissertation is on classical combinatorial optimization problems in two important areas: scheduling and network design. In the area of scheduling, the main interest is in problems in the master-slave model. In this model, each machine is either a master machine or a slave machine. Each job …

    njit Repository record for Algorithms and complexity analyses for some combinational optimization problems (opens in a new tab)

  2. Modeling Probabilistic Combinational Optimization Problems on Graphs Using Communication Channel

    This thesis studies Combinatorial Optimization Problems (COPs) on graphs that integrate uncertainty in the problem definition. We focus on Probabilistic Combinatorial Optimization Problems (PCOPs), where uncertainty is associated with the presence or absence of subsets of vertices that describe the …

    uab Repository record for Modeling Probabilistic Combinational Optimization Problems on Graphs Using Communication Channel (opens in a new tab)

  3. Some combinational optimization problems on radio network communication and machine scheduling

    The combinatorial optimization problems coming from two areas are studied in this dissertation: network communication and machine scheduling. In the network communication area, the complexity of distributed broadcasting and distributed gossiping is studied in the setting of random networks. Two …

    njit Repository record for Some combinational optimization problems on radio network communication and machine scheduling (opens in a new tab)

  4. Traffic Signal Control with Swam Intelligence Ant Colony Optimization

    … signal control with swam intelligence ant colony optimization Pang-shi Shih Ant colony optimization (ACO) is a meta-heuristic based on the indirect communication of a colony of artificial ants mediated by pheromone trails with collaboration and knowledge-sharing mechanism during their food-seeking …

    calpoly Repository record for Traffic Signal Control with Swam Intelligence Ant Colony Optimization (opens in a new tab)

  5. Σχεδιασμός, χαρτογράφηση και δημιουργία ωρολογίου προγράμματος δρομολογίων των ελληνικών ακτοπλοϊκών μεταφορών

    … Greek coastal shipping transportation network optimization, discussed in the present publication, is becoming exceedingly topical and imperative. Centered on the optimization factors and the methodology proposed, the heuristic algorithm by the name of ‘Nautilus’ is presented in this paper. On …

    greece Repository record for Σχεδιασμός, χαρτογράφηση και δημιουργία ωρολογίου προγράμματος δρομολογίων των ελληνικών ακτοπλοϊκών μεταφορών (opens in a new tab)

  6. Μέθοδοι κατάτμησης έγχρωμης εικόνας με χρήση: ασαφούς λογικής, watershed ανάλυσης, θεωρίας γράφων και χώρου κλιμάκων

    … The application of graph theory to formulate the combinational optimization problem in order to determine the final partitioning of the image. 6. The idea of representing the visual information in multiple resolutions on the basis of scale space theory. These ideas were incorporated in order to …

    greece Repository record for Μέθοδοι κατάτμησης έγχρωμης εικόνας με χρήση: ασαφούς λογικής, watershed ανάλυσης, θεωρίας γράφων και χώρου κλιμάκων (opens in a new tab)

  7. Vehicle Dispatching Problem at the Container Terminal with Tandem Lift Quay Cranes

    … can be formulated as an MILP model and it is a combinational optimization problem. When the type of QC is tandem lift, the problem becomes more complicated because it requires two vehicles side by side under the QC. Thus, the alignments of vehicles have to be considered by coordinating the …

    tamu Repository record for Vehicle Dispatching Problem at the Container Terminal with Tandem Lift Quay Cranes (opens in a new tab)

  8. The scheduling of manufacturing systems using Artificial Intelligence (AI) techniques in order to find optimal/near-optimal solutions.

    … The JSSP is the most general and popular hard combinational optimization problem in manufacturing systems. For the past sixty years, an enormous amount of research has been carried out to solve these problems. The literature review showed the inherent shortcomings of solutions to scheduling …

    bradford Repository record for The scheduling of manufacturing systems using Artificial Intelligence (AI) techniques in order to find optimal/near-optimal solutions. (opens in a new tab)

  9. Υβριδικοί εξελικτικοί αλγόριθμοι βελτιστοποίησης και εφαρμογές σε προβλήματα συνδυαστικής βελτιστοποίησης

    … approaches for addressing computationally hard optimization problems, through the analysis and the proposal of hybrid evolutionary methods and the formulation of the framework for applying them to specific problems. Initially, the mechanisms that rule the evolutionary methods and other …

    greece Repository record for Υβριδικοί εξελικτικοί αλγόριθμοι βελτιστοποίησης και εφαρμογές σε προβλήματα συνδυαστικής βελτιστοποίησης (opens in a new tab)

  10. Assembly line balancing: assessment tools and indices

    … The ALB problem (and its variants) is an NP-hard combinational optimization problem and for large-scale lines the objective is often reduced to finding feasible solutions. The situation is further exacerbated by the time variability inherent in assembly tasks. A rigorous analysis of the literature …

    greece Repository record for Assembly line balancing: assessment tools and indices (opens in a new tab)