Sökning: "large neighborhood search"

Hittade 4 avhandlingar innehållade orden large neighborhood search.

  1. 1. Short-term Underground Mine Scheduling : Constraint Programming in an Industrial Application

    Författare :Max Åstrand; Mikael Johansson; Christian Schulte; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; scheduling; mining; mine; underground; constraint programming; cp; large neighborhood search; lns; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : The operational performance of an underground mine depends critically on how the production is scheduled. Increasingly advanced methods are used to create optimized long-term plans, and simultaneously the actual excavation is getting more and more automated. LÄS MER

  3. 2. Short-term Underground Mine Scheduling : An Industrial Application of Constraint Programming

    Författare :Max Åstrand; Mikael Johansson; Mats Carlsson; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; scheduling; mining; underground mines; constraint programming; large neighborhood search; korttidsplanering; gruvdrift; underjordsgruvor; villkorsprogrammering; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : The mining industry is facing a surge in automation in the pursuit of safe and profitable operations. As the excavation process is increasingly automated, today's mining companies seek to optimize the coordination of the now automated mining activities. LÄS MER

  4. 3. IMPROVING DIFFERENTIAL EVOLUTION WITH ADAPTIVE AND LOCAL SEARCH METHODS

    Författare :Miguel Leon; Ning Xiong; Peter Funk; Yigen Zenlander; Kristian Sandström; Mälardalens högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Differential Evolution; Adaptation; Memetic algorithm; Evolutionary Algorithm; Computer Science; datavetenskap;

    Sammanfattning : Differential Evolution (DE) is a population-based algorithm that belongs to the Evolutionary algorithm family. During recent years, DE has become a popular algorithm in optimization due to its strength solving different types of optimization problems and due to its easy usage and implementation. LÄS MER

  5. 4. Just-in-Time Models with Applications to Dynamical Systems

    Författare :Anders Stenman; Lennart Ljung; Fredrik Gustafsson; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : System identification deals with the problem of estimating models of dynamical systems given observations from the systems. In this thesis we focus on the nonlinear modeling problem, and, in particular, on the situation that occurs when a very large amount of data is available. LÄS MER