Essays about: "Greedy heuristic"

Showing result 11 - 15 of 21 essays containing the words Greedy heuristic.

  1. 11. Optimal Taxi Placement Using a Maximal Covering Approach

    University essay from KTH/Optimeringslära och systemteori

    Author : San-San Ma; [2018]
    Keywords : ;

    Abstract : Taxi placement problem is a problem where a number of available taxi vehicles needs to be placed in an area with the objective of covering as much of the demand population as possible in order to acquire as many customer orders as possible. This study tries to model the taxi placement problem as maximum covering location problem (MCLP) and solve it with the heuristic methods, greedy adding (GA) algorithm and local search. READ MORE

  3. 12. Improving the Robustness of Stockholm’s Metro System

    University essay from KTH/Skolan för teknikvetenskap (SCI)

    Author : Hanna Gustavsson; Linnea Thorstensson; [2017]
    Keywords : ;

    Abstract : This study is evaluating and improving the robustness of the metro system in Stockholm. It is based on the existing metro system and by interpreting it as a network we can represent it in a mathematical graph. READ MORE

  4. 13. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB

    University essay from Umeå universitet/Institutionen för matematik och matematisk statistik

    Author : Josefin Lundquist; Linnéa O'Hara; [2017]
    Keywords : Inventory optimization; Integer programming; Generalized assignment problem; Combinatorial optimization; Greedy heuristic; Constructive algorithm;

    Abstract : A key challenge for manufacturing companies is to store parts in an efficient way atthe lowest cost possible. As the demand of differentiated products increases, togetherwith the fact that old products are not phased out at the same pace, the need of usingstorage space as dynamically as possible becomes vital. READ MORE

  5. 14. Increase resource utilization of Alfa Laval's Vertical Lift Modules by maximizing their order picking share

    University essay from Umeå universitet/Institutionen för matematik och matematisk statistik

    Author : Sofia Gullberg; Elina Lundberg; [2017]
    Keywords : ;

    Abstract : Alfa Laval is currently world leaders within heat transfer, separation and fluid handling. One of their distribution centers is situated in Tumba, Stockholm, where they maintain a storage warehouse used for spare parts to their products. In the warehouse, there are currently 4 216 items located in so called Vertical Lift Modules, VLMs. READ MORE

  6. 15. Finding the Densest Common Subgraph with Linear Programming

    University essay from Göteborgs universitet/Institutionen för data- och informationsteknik

    Author : Alexander Reinthal; Anton T örnqvist; Arvid Andersson; Erik Norlander; Philip Stålhammar; Sebastian Norlin; [2016-11-15]
    Keywords : Linear Programming; Graph theory; Dense Subgraphs; Densest Common Subgraph;

    Abstract : This thesis studies the concept of dense subgraphs, speci cally for graphs with multiple edge sets. Our work improves the running time of an existing Linear Program (LP) for solving the Densest Common Subgraph problem. READ MORE