This master’s thesis is dedicated to user’s movement tracking in public transport, as well as to optimize route planning. In the first part, author presents information related to graph theory and graph theory algorithms, including Breadth-First Search, Djikstra’s algorithm and A*. In the second part of this thesis, author describes the design of server and mobile application including description of routing process and how individual parts works.

The problem of route planning in air transport (in public transport in general ) is similar to the shortest path problem. The main differences are the time dependency of the input graph and the multicriterial aspect of the path costs . The aim of this thesis was to create a complex system that would be able to load elementary flights from database and then respond to user requests with combined journeys made from single flights . It was achieved using two state of the art algorithms , CSA and RAPTOR , which were adapted for the flight graph. The experiments which were run on real world data showed massive speedup of the algorithms when using the proposed optimisations . The whole system was also tested against an existing proprietary solution .

This master’s thesis is about optimal route planning for electric vehicles. The first, theoretical part of this work introduces the issue and describes several heuristic methods that have been used to address optimization tasks. A practical part of the thesis is based around software implementation of the methods described earlier. Finally, several experiments and comparisons of obtained results are carried out.

Der Aufenthaltsort eines mobilen Benutzers stellt eine wichtige Information für Anwendungen aus den Bereichen Mobile Computing, Wearable Computing oder Ubiquitous Computing dar. Ist ein mobiles Endgerät in der Lage, die aktuelle Position des Benutzers zu bestimmen, kann diese Information von der Anwendung berücksichtigt werden -- man spricht dabei allgemein von ortsbezogenen Anwendungen. Eng verknüpft mit dem Begriff der ortsbezogenen Anwendung ist der Begriff des ortsbezogenen Dienstes. Hierbei handelt es sich beispielsweise um einen Dienst, der Informationen über den aktuellen Standort übermittelt. Mittlerweile werden solche Dienste kommerziell eingesetzt und erlauben etwa, dass ein Reisender ein Hotel, eine Tankstelle oder eine Apotheke in der näheren Umgebung findet. Man erwartet, nicht zuletzt durch die Einführung von LTE, ein großes Potenzial ortsbezogener Anwendungen für die Zukunft. Das jährlich stattfindende Fachgespräch "Ortsbezogene Anwendungen und Dienste" der GI/ITG-Fachgruppe Kommunikation und Verteilte Systeme hat sich zum Ziel gesetzt, aktuelle Entwicklungen dieses Fachgebiets in einem breiten Teilnehmerkreis aus Industrie und Wissenschaft zu diskutieren. Der vorliegende Konferenzband fasst die Ergebnisse des neunten Fachgesprächs zusammen. / The location of a mobile user poses an important information for applications in the scope of Mobile Computung, Wearable Computing and Ubiquitous Computing. If a mobile device is able to determine the current location of its user, this information may be taken into account by an application. Such applications are called a location-based applications. Closely related to location-based applications are location-based services, which for example provides the user informations about his current location. Meanwhile such services are deployed commercially and enable travelers for example to find a hotel, a petrol station or a pharmacy in his vicinity. It is expected, not least because of the introduction of LTE, a great potential of locations-based applications in the future. The annual technical meeting "Location-based Applications and Services" of the GI/ITG specialized group "Communication and Dsitributed Systems" targets to discuss current evolutions in a broad group of participants assembling of industrial representatives and scientists. The present proceedings summarizes the result of the 9th annual meeting.

Autonomous underwater vehicles have become a popular countermeasure to naval mines. Saab’s AUV62-MR detects, locates and identifies mine-like objects through three phases. By extracting functionality from the AUV62-MR and placing it on a second vehicle, it is suggested that the second and third phases can be performed in parallel. This thesis investigates how to design the second vehicle so that the runtime of the mine reconnaissance process is minimized. A simulation framework is implemented to simulate the second and third phases of the mine reconnaissance process in order to test various design choices. The vehicle design choices in focus are the size and the route planning of the second vehicle. The route-planning algorithms investigated in this thesis are a nearest neighbour algorithm, a simulated annealing algorithm, an alternating algorithm, a genetic algorithm and a proposed Dubins simulated annealing algorithm. The algorithms are evaluated both in a static environment and in the simulation framework. Two different vehicle sizes are investigated, a small and a large, by evaluating their performances in the simulation framework. This thesis takes into account the limited travelling distance of the vehicle and implements a k-means clustering algorithm to help the route planner determine which mine-like objects can be scanned without exceeding the distance limit. The simulation framework is also used to evaluate whether parallel execution of the second and third phases outperforms the current sequential execution. The performance evaluation shows that a major reduction in runtime can be gained by performing the two phases in parallel. The Dubins simulated annealing algorithm on average produces the shortest paths and is considered the preferred route-planning algorithm according to the performance evaluation. It also indicates that a small vehicle size results in a reduced runtime compared to a larger vehicle.

No description available.

Approved for public release, distribution is unlimited / The objective of this thesis is to provide an aircraft with an optimal route to its destination that avoids encroaching into surface-to-air weapons killing envelopes in real time. The optimal route computed will be updated dynamically, depending on the location of the vehicle and the location of the Surface to Air Missile (SAM) sites. The problem was solved using heuristic algorithms instead of the conventional Dijkstra's & Bellman Ford algorithms, which are computationally expensive. Data fusion techniques such as spatial correlation and triangulation algorithms are presented in detail. Such techniques are important for situational awareness in a real time combat environment. Important information provided by onboard sensors are merged with the preplanned data to provide the operator with a better integrated picture of the combat environment. / Civilian, Singapore Ministry of Defense

This report is the final part within our education, Industrial Organization and Economy focusing on Logistics and Management at Jönköping School of Engineering. The aim with this report is to coordinate recycle drives for deposited aluminum-cans and bottles collected from grocery stores within Jönköping county and locality. In the present situation both aluminum cans and bottles filled with drinks are distributed to the grocery stores by the brewery’s own distributers. At the same time as they supply the drinks they also discharge the grocery stores units with restored aluminumcans and bottles. To make it easier for the grocery stores to handle the goods in the future, all distribution of drinks ought to be directly delivered to the grocery stores own separate central warehouse. This means every brewery ought to instead supply their drinks to the grocery stores central warehouse instead of taking them directly to the grocery stores. The drinks will then be distributed from the central warehouse to the grocery stores in connection with their orders of provisions. Due to hygienic reasons it is not possible that the deposited units are transported together with the provision.Therefore a kind of recycle drive needs to be organized. By using computer-aided route planning systems every transport are optimized, which means the transportation and labour costs will be reduced. At the same time the strain on the environment will also be a reduced. The company, DPS Europe, an international supplier of professional designed route planning systems. They have assisted with computer software and support during the study. The software PlanLogix build optimized drive routes based on different presumptions, restrictions and parameters which is based on information given by Returpack, responsible for the Swedish bottle refund system. A week’s work requires 19 shifts, three shifts on every work day and two shifts on the weekends. How many times the deposited units need to be collected varies between each grocery store. It differs from seven times a week to one time every forth week. This will lead to a four-week schedule with 76 routes. The total cost for the bottle refund system is 603 459 SEK/four weeks, and the filling degree on the vehicles will be approximately 50 percent. If a bottle refund system is to be implemented it needs to be profitable for the environment, meaning the positive effects need to exceed the negative effects, which the transports cause. To implement deposit drives, the units of aluminum-cans and bottles needs to be higher so the filling degree increases. A proposal to increase the filling degree could be to decrease the number of times each grocery store gets their deposits collected. This will increase the filling degree since at every occasion there will be more units to collect and at the same time decrease the transportation. / Rapporten är det avslutande momentet av utbildningen Industriell Organisation och Ekonomi med inriktning Logistik och Ledning vid Jönköpings Tekniska Högskola. Målet med examensarbetet är att planera och utforma rutter utifrån förutbestämda kriterier, för returkörningar av pantade PET-flaskor och aluminiumburkar från livsmedelsbutiker i Jönköpings län med omnejd. I dagsläget distribueras konsumtionsfärdig dryck i aluminiumburkar och PET-flaskor till butiker med bryggeriernas egna distributörer som i samband med leveransen tömmer butikernas lager av pantade enheter. Men för att underlätta godshanteringen hos handlarna ska i framtiden distributionen istället ske till livsmedelskedjornas olika centrallager och därifrån distribueras tillsammans med butikens beställning av livsmedel. På grund av hygieniska skäl kan butikens pantade enheter inte samköras medlivsmedel vilket kräver att någon form av returkörning samordnas. Genom att använda datorstödd ruttplanering optimeras transporterna vilket betyder att transportkostnader och arbetskostnader minimeras samtidigt som miljöpåverkan reduceras. Företaget DPS Europe är en internationell leverantör av professionella ruttplaneringssystem som bistått med programvara och support. Med hjälp av programmet PlanLogix, från DPS Europe, har optimala körrutter byggts upp utifrån olika förutsättningar, begränsningar och parametrar baserade på information från Returpack, som ansvarar för det svenska pantsystemet. Det krävs 19 arbetsskift i veckan, tre skift på vardagar och två skift på helger, för att samtliga butiker ska få sina lager av pantade enheter tömda. Hämtningsfrekvensen hos butikerna varierar från sju gånger i veckan till en gång var fjärde vecka, vilket resulterar i att ett fyraveckorsschema med totalt 76 rutter skapas. Totalkostnaden är 603 459 kronor/fyra veckor och den använda lastkapaciteten på fordonen är 50 procent. Om ett retursystem ska användas måste det vara miljölönsamt, det vill säga att de positiva effekterna med retursystemet måste vara fler än de negativa konsekvenserna som ökade transporter medför. För att det ska bli försvarbart och lönsamt att utföra returkörningar för PET-flaskor och aluminiumburkar krävs en högt utnyttjande av lastkapacitet. Ett förslag som ökar utnyttjandet av lastkapaciteten är att minska butikernas hämtningsfrekvens så att det vid varje hämtningstillfälle finns mer pantande enheter att hämta. På så sätt ökar den använda lastkapaciteten samtidigt som transportsträckan reduceras.

<p>This report is the final part within our education, Industrial Organization and Economy focusing on Logistics and Management at Jönköping School of Engineering. The aim with this report is to coordinate recycle drives for deposited aluminum-cans and bottles collected from grocery stores within Jönköping county and locality.</p><p>In the present situation both aluminum cans and bottles filled with drinks are distributed to the grocery stores by the brewery’s own distributers. At the same time as they supply the drinks they also discharge the grocery stores units with restored aluminumcans and bottles. To make it easier for the grocery stores to handle the goods in the future, all distribution of drinks ought to be directly delivered to the grocery stores own separate central warehouse. This means every brewery ought to instead supply their drinks to the grocery stores central warehouse instead of taking them directly to the grocery stores. The drinks will then be distributed from the central warehouse to the grocery stores in connection with their orders of provisions. Due to hygienic reasons it is not possible that the deposited units are transported together with the provision.Therefore a kind of recycle drive needs to be organized.</p><p>By using computer-aided route planning systems every transport are optimized, which means the transportation and labour costs will be reduced. At the same time the strain on the environment will also be a reduced. The company, DPS Europe, an international supplier of professional designed route planning systems. They have assisted with computer software and support during the study. The software PlanLogix build optimized drive routes based on different presumptions, restrictions and parameters which is based on information given by Returpack, responsible for the Swedish bottle refund system.</p><p>A week’s work requires 19 shifts, three shifts on every work day and two shifts on the weekends. How many times the deposited units need to be collected varies between each grocery store. It differs from seven times a week to one time every forth week. This will lead to a four-week schedule with 76 routes. The total cost for the bottle refund system is 603 459 SEK/four weeks, and the filling degree on the vehicles will be approximately 50 percent.</p><p>If a bottle refund system is to be implemented it needs to be profitable for the environment, meaning the positive effects need to exceed the negative effects, which the transports cause. To implement deposit drives, the units of aluminum-cans and bottles needs to be higher so the filling degree increases. A proposal to increase the filling degree could be to decrease the number of times each grocery store gets their deposits collected. This will increase the filling degree since at every occasion there will be more units to collect and at the same time decrease the transportation.</p> / <p>Rapporten är det avslutande momentet av utbildningen Industriell Organisation och Ekonomi med inriktning Logistik och Ledning vid Jönköpings Tekniska Högskola. Målet med examensarbetet är att planera och utforma rutter utifrån förutbestämda kriterier, för returkörningar av pantade PET-flaskor och aluminiumburkar från livsmedelsbutiker i Jönköpings län med omnejd.</p><p>I dagsläget distribueras konsumtionsfärdig dryck i aluminiumburkar och PET-flaskor till butiker med bryggeriernas egna distributörer som i samband med leveransen tömmer butikernas lager av pantade enheter. Men för att underlätta godshanteringen hos handlarna ska i framtiden distributionen istället ske till livsmedelskedjornas olika centrallager och därifrån distribueras tillsammans med butikens beställning av livsmedel. På grund av hygieniska skäl kan butikens pantade enheter inte samköras medlivsmedel vilket kräver att någon form av returkörning samordnas.</p><p>Genom att använda datorstödd ruttplanering optimeras transporterna vilket betyder att transportkostnader och arbetskostnader minimeras samtidigt som miljöpåverkan reduceras. Företaget DPS Europe är en internationell leverantör av professionella ruttplaneringssystem som bistått med programvara och support. Med hjälp av programmet PlanLogix, från DPS Europe, har optimala körrutter byggts upp utifrån olika förutsättningar, begränsningar och parametrar baserade på information från Returpack, som ansvarar för det svenska pantsystemet.</p><p>Det krävs 19 arbetsskift i veckan, tre skift på vardagar och två skift på helger, för att samtliga butiker ska få sina lager av pantade enheter tömda. Hämtningsfrekvensen hos butikerna varierar från sju gånger i veckan till en gång var fjärde vecka, vilket resulterar i att ett fyraveckorsschema med totalt 76 rutter skapas. Totalkostnaden är 603 459 kronor/fyra veckor och den använda lastkapaciteten på fordonen är 50 procent.</p><p>Om ett retursystem ska användas måste det vara miljölönsamt, det vill säga att de positiva effekterna med retursystemet måste vara fler än de negativa konsekvenserna som ökade transporter medför. För att det ska bli försvarbart och lönsamt att utföra returkörningar för PET-flaskor och aluminiumburkar krävs en högt utnyttjande av lastkapacitet. Ett förslag som ökar utnyttjandet av lastkapaciteten är att minska butikernas hämtningsfrekvens så att det vid varje hämtningstillfälle finns mer pantande enheter att hämta. På så sätt ökar den använda lastkapaciteten samtidigt som transportsträckan reduceras.</p>

Este trabalho está inserido no campo da Geomática e se concentra, mais especificamente, no estudo de métodos para exploração e seleção de rotas em espaços geográficos sem delimitação prévia de vias trafegáveis. As atividades que poderiam se beneficiar de estudos desse tipo estão inseridas em áreas da engenharia, logística e robótica. Buscou-se, com as pesquisas realizadas nesse trabalho, elaborar um modelo computacional capaz de consultar as informações de um terreno, explorar uma grande quantidade de rotas viáveis e selecionar aquelas rotas que oferecessem as melhores condições de trajetória entre dois pontos de um mapa. Foi construído um sistema a partir do modelo computacional proposto para validar sua eficiência e aplicabilidade em diferentes casos de estudo. Para que esse sistema fosse construído, foram combinados conceitos de sistemas baseados em agentes, lógica nebulosa e planejamento de rotas em robótica. As informações de um terreno foram organizadas, consumidas e apresentadas pelo sistema criado, utilizando mapas digitais. Todas as funcionalidades do sistema foram construídas por meio de software livre. Como resultado, esse trabalho de pesquisa disponibiliza um sistema eficiente para o estudo, o planejamento ou a simulação de rotas sobre mapas digitais, a partir de um módulo de inferência nebuloso aplicado à classificação de rotas e um módulo de exploração de rotas baseado em agentes autônomos. A perspectiva para futuras aplicações utilizando o modelo computacional apresentado nesse trabalho é bastante abrangente. Acredita-se que, a partir dos resultados alcançados, esse sistema possa ajudar a reduzir custos e automatizar equipamentos em diversas atividades humanas. / This research is placed in the field of Geomatics and focuses more specifically on the study of methods for exploration and route selection in geographic areas without prior definition of trafficable roads. Activities that could benefit from such studies are embedded in areas of engineering, logistics and robotics. This study aimed to develop a computational model able to select information from a terrain, explore a lot of viable routes and select those routes that offer the best possible path between two points on a map. It was built a system from the proposed computational model to validate its effectiveness and applicability in different case studies. For this system to be built concepts of agent-based systems, fuzzy logic and route planning in robotics were combined. The information about land were organized, presented and consumed by the system created using digital maps. All features of the system were built using open source. As a result, this research provides an efficient system for the study, planning or route simulation on digital maps, using a fuzzy inference module applied to the classification of routes and a module to operate routes based on autonomous agents. The perspective for future applications using the computational model presented in this study is quite comprehensive. It is believed that from the results, this system can help reduce costs and automate equipment in various human activities.