Advanced search
Showing result 16 - 20 of 38 essays matching the above criteria.
-
16. Fantastic Voyage - Wayfinding design for Danderyds Hospital in Stockholm
University essay from Göteborgs universitet/HDK - Högskolan för design och konsthantverkAbstract : This thesis project is a design solution for a specific situation. It explores how design can support wayfinding in a complex environment. READ MORE
-
17. High Performance Multi-Objective Voyage Planning Using Local Gradient-Free Methods
University essay from Uppsala universitet/Avdelningen för beräkningsvetenskapAbstract : A number of parallel gradient-free local optimization methods are investigated in application to problems of voyage planning for maritime ships. Two optimization algorithms are investigated, a parallel version of the Nelder-Mead Simplex method and the Subplex method with Nelder-Mead Simplex as its inner solver. READ MORE
-
18. On-ship Power Management and Voyage Planning Interaction
University essay from Uppsala universitet/Avdelningen för systemteknikAbstract : Voyage planning methods have advanced significantly in recent years to take advantage of the increasingly available computing power. With the aid of detailed weather predictions it is now possible to decide a route that is optimized with respect to some criterion. READ MORE
-
19. vemod(en) : -A tribute to the perfect error.
University essay from Akademin för textil, teknik och ekonomiAbstract : In this collection I have explored the paradox of perfection. The collection is an epic tribute to my prior self and discovers how the unperfect can be transformed to something, perceived, perfect. I flirt with my past obsessions in finding mathematically measured legs, exact tailored arms and perfectly fitted stockings. READ MORE
-
20. Multi-Objective Optimization of Voyage Plans for Ships
University essay from Lunds universitet/Institutionen för reglerteknikAbstract : In this thesis two methods are investigated to solve a multi-objective optimization problem for voyage planning. The first method, grid search, is a brute force search in a three-dimensional graph while the other uses the Lipschitzian algorithm DIRECT to do a continuous search along a nominal route. READ MORE