Hanteringen när medarbetares privata problem inverkar negativt på arbetsplatsen : En studie ur ett ledarskapsperspektiv

Uppsatsens syfte var att undersöka hur ledare hanterar situationer där medarbetares privata problem inverkar negativt på arbetet för både arbetsgivare och övriga medarbetare. För att få svar på det har vi inspirerats av vinjettstudie som utgår från diskussioner av fiktiva fall. Vi har genomfört studien med fyra enskilda semistrukturerade intervjuer och en fokusgruppsintervju där vi först introducerade respondenterna med vinjetterna. Deltagarna till undersökningen valdes ut genom ett subjektivt urval där vi riktade in oss på ledare, angående vilken organisation de tillhörde var av mindre vikt. I teoridelen introducerades teorierna ledarskap, medarbetarskap, individen i gruppen, ekonomi, hälsa, lagar, organisationskultur och föreskrifter samt försäkringskassans roll. Resultatet analyserades sedan mot teorierna och vi kan konstatera att respondenterna generellt menade att det var viktigt att prioritera kommunikation och relationer. Betydelsefullt var att relationerna etablerades innan problemen uppstår eftersom det anses vara svårt att skapa relationer i konfliktfyllda lägen. Tiden har betydelse vid hantering av problem av den orsaken att gränsen för vad som är acceptabelt förflyttas med tidens gång. Beroende på problem varierade graden av toleransnivå hos chefer och övriga medarbetare i vår undersökning. Resultatet visade att gränsen för privatlivets påverkan på arbetslivet går när arbetet blir misskött och när kunder och andra medarbetare påverkas. Utifrån ett genusperspektiv ansåg intervjupersonerna att det saknade betydelse om chefen var en man eller kvinna när det handlade om att hantera problem som uppkom, det ansågs vara personligt.

Jämförelse av två system för att bedöma vinter väglag : Ett nytt system i utvecklingen för att säkra Sveriges vägar

Trafikverket, är den statliga verksamhet som har hand om alla Sveriges vägar och järnvägar har den så kallade nollvisionen som ett huvudmål. Tanken bakom nollvisionen är att de som använder vägarna skall vara säkra och inte komma till skada. En del av uppfyllandet av detta mål är att Trafikverket ger ut korttidsprognoser för väglag och körförhållande. I nuläget så används ett mycket manuellt systemet som heter NTIS, men man håller på att utveckla det nya automatiska systemet RCC som skall kunna ta fram korttidsprognoser baserat på olika former av data, t.ex. data från väderstationer. Syftet med denna studie är att utvärdera hur väl de två olika systemen utför en korttidsprognos och jämföra de mot varandra, samt verkligheten. Denna studie gjordes i form av en förklarande fallstudie. Som datainsamling används dokument i olika former och analysen var kvantitativ då resultatet av utvärdering ger olika procenttal av hur rätt respektive system har. Under undersökningen gång så kom vi fram till att båda systemen hade sina fördelar och nackdelar. T.ex. så det gamla NTIS systemet fortfarande bäst på isigt och moddigt väglag. Medans det nya RCC systemet hade sina egna fördelar, t.ex. snöigt väglag och vått väglag. Samt så hade RCC en klar fördel med sin rapporteringstid, vilket var ett problem man såg med NTIS. Resultat var som sagt ett procenttal av hur rätt de två olika systemen hade, men även förslag till förbättringar. T.ex. hur man skulle kunna ändra RCC regler för bättre resultat.

Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing

This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.

Spanning Tree Approach On The Snow Cleaning Problem

Snow cleaning is one of the important tasks in the winter time in Sweden. Every year government spends huge amount money for snow cleaning purpose. In this thesis we generate a shortest road network of the city and put the depots in different place of the city for snow cleaning. We generate shortest road network using minimum spanning tree algorithm and find the depots position using greedy heuristic. When snow is falling, vehicles start work from the depots and clean the snow all the road network of the city. We generate two types of model. Models are economic model and efficient model. Economic model provide good economical solution of the problem and it use less number of vehicles. Efficient model generate good efficient solution and it take less amount of time to clean the entire road network.

Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem

The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman problem using multilevel graph partitioning approach.Although traveling salesman problem itself very difficult as this problem is belong to the NP-Complete problems but I have tried my best to solve this problem using multilevel graph partitioning it also belong to the NP-Complete problems. I have solved this thesis by using the k-mean partitioning algorithm which divides the problem into multiple partitions and solving each partition separately and its solution is used to improve the overall tour by applying Lin Kernighan algorithm on it. Through all this I got optimal solution which proofs that solving traveling salesman problem through graph partition scheme is good for this NP-Problem and through this we can solved this intractable problem within few minutes.Keywords: Graph Partitioning Scheme, Traveling Salesman Problem.

Från kvinnans problem till problemfri kvinna : En undersökning av audiovisuell reklam för sanitetsprodukter till menstruerande kvinnor mellan åren 1970 och 2000

This thesis tries trough qualitative analyzes to illuminate advertising and its didactic aspects, how menstruation and menstruating women are portrayed over time. The method underlying the survey is didactic, diachronic comparative and hermeneutic. There will also be a feminist point of view on the material. The issue is about how the advertisement presents sanitary products and menstruation and how a menstruating woman is portrayed.The conclusion is that the image of a menstruating woman changes slightly while consolidating the ethos that menstruation should not be visible. The menstruating woman is in constant motion, always fresh and fragrant.

Limits to phase resolution in matter-wave interferometry

We study the quantum dynamics of a two-mode Bose-Einstein condensate in a time-dependent symmetric double-well potential using analytical and numerical methods. The effects of internal degrees of freedom on the visibility of interference fringes during a stage of ballistic expansion are investigated varying particle number, nonlinear interaction sign and strength, as well as tunneling coupling. Expressions for the phase resolution are derived and the possible enhancement due to squeezing is discussed. In particular, the role of the superfluid-Mott insulator crossover and its analog for attractive interactions is recognized.

Distance measure and the p-median problem in rural areas

The p-median model is used to locate P facilities to serve a geographically distributed population. Conventionally, it is assumed that the population patronize the nearest facility and that the distance between the resident and the facility may be measured by the Euclidean distance. Carling, Han, and Håkansson (2012) compared two network distances with the Euclidean in a rural region witha sparse, heterogeneous network and a non-symmetric distribution of thepopulation. For a coarse network and P small, they found, in contrast to the literature, the Euclidean distance to be problematic. In this paper we extend their work by use of a refined network and study systematically the case when P is of varying size (2-100 facilities). We find that the network distance give as gooda solution as the travel-time network. The Euclidean distance gives solutions some 2-7 per cent worse than the network distances, and the solutions deteriorate with increasing P. Our conclusions extend to intra-urban location problems.