Essays about: "Simulated Annealing"

Showing result 1 - 5 of 60 essays containing the words Simulated Annealing.

  1. 1. Comparison of Two Constraint Solvers for University Timetable Creation with Focus on Algorithm Choices

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS); KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Herman Karlsson; Sebastian Williams; [2020]
    Keywords : ;

    Abstract : The problem of finding an optimal schedule for universities based on their numerous constraints is NP-complete and thus requires heuristics to get good solutions. Our study has compared two constraint solvers that employ different combinations of heuristics to determine which is more suitable for universities. READ MORE

  2. 2. A Comparative Study of Simulated Annealing and Self-Organising Map Batching for Solving the Order Batching Problem in Warehouses

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS); KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Nils Streijffert; Frans Tegelmark; [2020]
    Keywords : ;

    Abstract : Warehouses need efficient picking strategies. Batching orders is one such strategy, but creating efficient batches out of orders is computationally hard. READ MORE

  3. 3. Parametric design and optimization of steel and timber truss structures : Development of a workflow for design and optimization processes in Grasshopper 3D environment

    University essay from KTH/Bro- och stålbyggnad; KTH/Bro- och stålbyggnad

    Author : FILMON WELDEGIORGIS; ANUP RAJ DHUNGANA; [2020]
    Keywords : Parametric design; Optimization; Parametric workflow; Steel; Timber; Truss; Grasshopper 3D; Karamba 3D; Galapagos; GH Python; Glulam; Finite Element Analysis;

    Abstract : The demand for complex structures and the urge to perform more detailed structural analyses in an early stage of the project design phase has increased the use of parametric design in the construction sector, especially among architects and structural engineers. Also, an increasing demand for sustainable structures is creating pressure on engineers and architects to design optimized structures that consume as little resources as possible. READ MORE

  4. 4. Artificial Intelligence for Warehouse Picking Optimization - An NP-Hard Problem

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Louis Janse van Rensburg; [2019]
    Keywords : ;

    Abstract : This master thesis work demonstrates an approach to processing warehouse management system log-dump datasets and architectural CAD floor maps for graphical network representation of large warehouse environments. This representation enables use of stochastic search and linear programming algorithms (Simulated Annealing and Concorde TSP Solver) for the purpose of warehouse pick-run routing optimization (a case of the NP-Hard Travelling Salesperson Problem). READ MORE

  5. 5. Comparing Two-Phase Hybrid Metaheuristics for the University Course Timetabling Problem (UCTP)

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS); KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Isabella Andersson; Carl Petter Svensson; [2019]
    Keywords : ;

    Abstract : Timetabling is a time consuming and difficult task for large organizations. One popular research field is the university course timetabling problem (UCTP). UCTP is the NP-hard combinatorial problem of scheduling courses at a university while satisfying some constraints. READ MORE