Bibliografias temáticas / Optimisation de route

Índice

  1. Artigos de revistas
  2. Teses / dissertações
  3. Livros
  4. Capítulos de livros
  5. Trabalhos de conferências

Literatura científica selecionada sobre o tema "Optimisation de route"

Autor: Grafiati
Publicado: 25 de janeiro de 2025

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Optimisation de route".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Artigos de revistas sobre o assunto "Optimisation de route"

1

Li, Jialu. "Research on Route Optimization of RO-Ro Ship Based on Ant Colony Algorithm". Applied and Computational Engineering 110, n.º 1 (6 de dezembro de 2024): 201–11. https://doi.org/10.54254/2755-2721/2024.melb18117.

Texto completo da fonte
Resumo:
This study is based on an ant colony algorithm for route optimisation of roll-on roll-off (RO-RO) vessels, aiming to minimise the total cost of RO-RO shipping routes. The model takes into account factors such as port berthing cost, fuel consumption and sailing time, and ensures the stability and efficiency of the optimisation results by adjusting the algorithm parameters such as pheromone initialisation, pheromone evaporation rate and ant colony size. The results of the study provide a practical solution for ro-ro ship route optimisation, which significantly reduces the operating costs and also provides key technical support for shipping companies to compete in the global market. In addition, the study demonstrates the potential of the optimisation model to reduce transport costs, improve shipping efficiency and reduce carbon emissions, providing an effective technical support for shipping companies in an increasingly competitive global market. Through this optimisation approach, shipping companies are able to better manage their route selection, resource allocation and operational processes, enhancing market competitiveness and promoting sustainable development of the shipping industry.
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Ibrahim, A., B. Michael, Z. A. T. Suleyman e O. B. Akintuyi. "Geospatial Approach to Route Optimisation for Security Architecture Improvement". Environmental Technology and Science Journal 14, n.º 1 (1 de agosto de 2023): 75–82. http://dx.doi.org/10.4314/etsj.v14i1.8.

Texto completo da fonte
Resumo:
Understanding the complexity of road networks is tiring, especially in finding the optimum routes for emergency response. Dynamic route optimisation is a decision-making process powered by mathematical models to formulate a strong basis for predicting the best path between any two points in a road network. Exploring the numerous interconnected routes in and out of a road network provides a strong foothold for securing lives and properties. This study presents the findings of route optimisation at the Federal University of Technology Minna, Gidan Kwano Campus. High Target Differential Global Positioning System receiver (DGPS), Handheld GPS (Garmin GPSmap 60Cx), Quick Bird Satellite Imagery, and Google Earth Images were used for data acquisition purposes. An ArcGIS network analyst for optimum route identification based on Dijktra’s algorithm was utilised for analysis. Five different optimisation tests were done and the optimised routes were compared with alternative routes from the network. The total travel distances for alternative and optimum routes are 11852.414 m and 16614.156 m respectively while the total travel times for alternative and optimum routes are 2135.35 s and 2993.25 s respectively. The study revealed all optimum routes are faster cumulatively by (11.7%) and are best for security and emergency responses. Ten unauthorised access roads to the campus were identified. The number of routes paving access to the campus shows that efforts towards ensuring security must be increased.
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Gigih, Priyandoko, Siti Nur Arofah, Nan Mad Sahar e Istiadi Istiadi. "Donor Collectors Route Optimisation using Genetic Algorithm Method". International Journal of Electrical, Energy and Power System Engineering 3, n.º 1 (28 de fevereiro de 2020): 1–5. http://dx.doi.org/10.31258/ijeepse.3.1.1-5.

Texto completo da fonte
Resumo:
Searching for a route to take donation in terms of time and the shortest route is a must for the management because it can save time and effort. In order to make donations more efficient, a system is needed to provide recommendations for taking donation routes, one of which is using a Genetic Algorithm (GA) method. The GA can be applied in optimizing schedules, routes, and spaces. The results show that after testing two different routes with different maximum generation values of 50, 100, 500 and 1000, a maximum generation value of 50 can give optimal results.
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Hou, Rong, e Pengfei Zhang. "A-star Ant Colony Fusion Optimisation for Unmanned Ground Vehicle Route Planning". Journal of Physics: Conference Series 2891, n.º 11 (1 de dezembro de 2024): 112001. https://doi.org/10.1088/1742-6596/2891/11/112001.

Texto completo da fonte
Resumo:
Abstract Route planning technology of Unmanned Ground Vehicle (UGV) is a key issue in robotics, with the goal of avoiding obstacles and moving quickly to the target point. Aiming at the problem of easy collision with obstacles when utilizing the conventional A-star algorithm for global route planning, an improved turning mechanism is proposed to avoid collision. Aiming at the problems of longer routes and insufficiently smooth routes introduced by it, an improved A-star ant colony fusion algorithm for UGV route planning is proposed by combining the local planning capability of the ant colony algorithm. The A-star algorithm with an improved turning mechanism is fused with an ant colony algorithm to iteratively optimize the route length and route smoothness progressively. Simulation results show that the improved A-star ant colony fusion algorithm is able to avoid obstacles, reduce the length of the planned route by at least 2.34%, and improve the route smoothness by at least 5.62% compared to the A-star algorithm. It is beneficial for UGV to accomplish the corresponding tasks quickly on the basis of ensuring its obstacle avoidance.
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

WANG, Zeyu, Fujian CHEN e Chengcheng MO. "Optimisation Methods for Cold Chain Logistics Path Considering Carbon Emission Costs in Time-Varying Networks". Promet - Traffic&Transportation 36, n.º 6 (20 de dezembro de 2024): 1103–19. https://doi.org/10.7307/ptt.v36i6.735.

Texto completo da fonte
Resumo:
With the escalating global climate change, the cost of carbon emissions has become a crucial metric for evaluating the sustainability of logistics systems. This study addresses the optimisation of cold chain logistics routes in a time-varying network environment, considering the carbon emission cost factor, and proposes an enhanced particle swarm optimisation algorithm to solve this optimisation problem. Firstly, we establish a cold chain logistics optimisation model that incorporates the time-varying network, integrating logistics route planning with carbon emission costs. Subsequently, we design an improved particle swarm optimisation algorithm suitable for time-varying networks. This algorithm optimises vehicle routes and adjusts delivery times to minimise the total cost incurred during distribution. Finally, through simulation experiments, we analyse the impact of vehicle speeds and carbon trading mechanisms on optimisation outcomes. The results demonstrate that this method effectively optimises cold chain logistics routes, considering real network conditions and environmental factors, thereby reducing delivery costs and carbon emissions.
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Ramtake, Dhammpal, Sanjay Kumar e V. K. Patle. "Route Optimisation byAnt Colony OptimisationTechnique". Procedia Computer Science 92 (2016): 48–55. http://dx.doi.org/10.1016/j.procs.2016.07.322.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Mezitis, Mareks, Arpabekov Muratbek, Zura Sansyzbayeva e Alimzhan Assiltayev. "Enhancing effectiveness of use of the rolling stock through route optimisation". AUTOBUSY – Technika, Eksploatacja, Systemy Transportowe 19, n.º 12 (31 de dezembro de 2018): 808–10. http://dx.doi.org/10.24136/atest.2018.502.

Texto completo da fonte
Resumo:
The article deals with issues of enhancing efficient use of the rolling stock of urban passenger transport through route optimisation. The authors offer to upgrade urban route network opt for: optimisation of routing system. In order to streamline passenger transport performance, the authors propose to calculate transport route schemes by applying economically mathematical methods of planning.
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Bychkova, A. A. "Optimisation of Russian railways’ high-speed routes in the regions". Vestnik Universiteta 1, n.º 7 (31 de agosto de 2022): 82–89. http://dx.doi.org/10.26425/1816-4277-2022-7-82-89.

Texto completo da fonte
Resumo:
Rail transport is constantly in development and improvement, as it is one of the most important strategic means of transportation. That is why the optimization of Russian railway routes in this case is an integral element of development. The introduction of a high-speed passenger transportation route makes it possible to increase throughput capacity, improve service conditions, and strengthen the position in the industry. The article points out the necessity of optimising the route from the Ural to the Volga federal districts. The relevance of the topic under study lies in the advantage of railway transport in interspecific competition in the market for the provision of passenger transportation services. The author used the local Moran index in the analysis, studied regional interconnections, and identified clusters. The results of the study are visually represented in the figure, where the dotted line highlights the potential route of high-speed traffic Yekaterinburg–Kazan. The article describes the possible risks of implementing this route, cites optimization expediency factors (increase of interspecific competition).
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Siti Hafawati Jamaluddin, Nurul Alyaa Zulkefli, Norwaziah Mahmud e Nur Syuhada Muhammat Pazil. "Optimising Routes Scheduling of Garbage Truck for Waste Collection using Artificial Bee Colony Algorithm". Applied Mathematics and Computational Intelligence (AMCI) 12, n.º 3 (10 de outubro de 2023): 40–50. http://dx.doi.org/10.58915/amci.v12i3.317.

Texto completo da fonte
Resumo:
The issue of waste generation has attracted significant public attention in today’s societies, not only because waste production is increasing quantitatively but also because some products and components are becoming more complex. The growing problem of municipal solid waste management has become the most serious environmental issue. Population growth has resulted in the increase in the generation of solid waste, which has become a serious issue that must be resolved. Optimised route planning is one of the most important components of a smart waste management system. Route planning is a technological approach to determining the shortest routes through optimisation. The route optimisation problem commonly referred to as the vehicle routing problem (VRP), has been thoroughly studied to find the best possible route for a vehicle. This study aims to find the optimal routes and reduce the distance travelled by the garbage truck when collecting waste using Artificial Bee Colony algorithm. ABC algorithm is an optimization method based on the clever behaviour of honey bee swarms. The artificial bee colony in the ABC algorithm is divided into three groups which are employed bees, onlookers and scouts. To provide neighbouring solutions that are guaranteed to be possible, swap operator is used. Results show that by using 10 trucks in total as the vehicle, the optimal solution produced a total of optimal distance for 94.9542 km. The findings of this study fulfilled the intended objectives which are to find the optimal route and shortest distance for the vehicles.
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Chiu, Ching-Sheng, e Chris Rizos. "Towards a Multi Objective Path Optimisation for Car Navigation". Journal of Navigation 65, n.º 1 (25 de novembro de 2011): 125–44. http://dx.doi.org/10.1017/s0373463311000579.

Texto completo da fonte
Resumo:
In a car navigation system the conventional information used to guide drivers in selecting their driving routes typically considers only one criterion, usually the Shortest Distance Path (SDP). However, drivers may apply multiple criteria to decide their driving routes. In this paper, possible route selection criteria together with a Multi Objective Path Optimisation (MOPO) model and algorithms for solving the MOPO problem are proposed. Three types of decision criteria were used to present the characteristics of the proposed model. They relate to the cumulative SDP, passed intersections (Least Node Path – LNP) and number of turns (Minimum Turn Path – MTP). A two-step technique which incorporates shortest path algorithms for solving the MOPO problem was tested. To demonstrate the advantage that the MOPO model provides drivers to assist in route selection, several empirical studies were conducted using two real road networks with different roadway types. With the aid of a Geographic Information System (GIS), drivers can easily and quickly obtain the optimal paths of the MOPO problem, despite the fact that these paths are highly complex and difficult to solve manually.
Estilos ABNT, Harvard, Vancouver, APA, etc.
Mais fontes

Teses / dissertações sobre o assunto "Optimisation de route"

1

Mrazovic, Petar. "Crowdsensing-driven route optimisation algorithms for smart urban mobility". Doctoral thesis, Universitat Politècnica de Catalunya, 2018. http://hdl.handle.net/10803/663456.

Texto completo da fonte
Resumo:
Urban rörlighet anses ofta vara en av de främsta möjliggörarna för en hållbar statsutveckling. Idag skulle det dock kräva ett betydande skifte mot renare och effektivare stadstransporter vilket skulle stödja ökad social och ekonomisk koncentration av resurser i städerna. En viktig prioritet för städer runt om i världen är att stödja medborgarnas rörlighet inom stadsmiljöer medan samtidigt minska trafikstockningar, olyckor och föroreningar. Att utveckla en effektivare och grönare (eller med ett ord; smartare) stadsrörlighet är en av de svåraste problemen att bemöta för stora metropoler. I denna avhandling närmar vi oss problemet från det snabba utvecklingsperspektivet av ITlandskapet i städer vilket möjliggör byggandet av rörlighetslösningar utan stora stora investeringar eller sofistikerad sensortenkik. I synnerhet föreslår vi utnyttjandet av den mobila rörlighetsavkännings, eng. Mobile Crowdsensing (MCS), paradigmen i vilken befolkningen exploaterar sin mobilkommunikation och/eller mobilasensorer med syftet att frivilligt samla, distribuera, lokalt processera och analysera geospecifik information. Rörlighetavkänningssdata (t.ex. händelser, trafikintensitet, buller och luftföroreningar etc.) inhämtad från frivilliga i befolkningen kan ge värdefull information om aktuella rörelsesförhållanden i stad vilka, med adekvata databehandlingsalgoriter, kan användas för att planera människors rörelseflöden inom stadsmiljön. Såtillvida kombineras i denna avhandling två mycket lovande smarta rörlighetsmöjliggörare, eng. Smart Mobility Enablers, nämligen MCS och rese/ruttplanering. Vi kan därmed till viss utsträckning sammanföra forskningsutmaningar från dessa två delar. Vi väljer att separera våra forskningsmål i två delar, dvs forskningssteg: (1) arkitektoniska utmaningar vid design av MCS-system och (2) algoritmiska utmaningar för tillämpningar av MCS-driven ruttplanering. Vi ämnar att visa en logisk forskningsprogression över tiden, med avstamp i mänskligt dirigerade rörelseavkänningssystem som MCS och ett avslut i automatiserade ruttoptimeringsalgoritmer skräddarsydda för specifika MCS-applikationer. Även om vi förlitar oss på heuristiska lösningar och algoritmer för NP-svåra ruttproblem förlitar vi oss på äkta applikationer med syftet att visa på fördelarna med algoritm- och infrastrukturförslagen.
La movilidad urbana es considerada una de las principales desencadenantes de un desarrollo urbano sostenible. Sin embargo, hoy en día se requiere una transición hacia un transporte urbano más limpio y más eficiente que soporte una concentración de recursos sociales y económicos cada vez mayor en las ciudades. Una de las principales prioridades para las ciudades de todo el mundo es facilitar la movilidad de los ciudadanos dentro de los entornos urbanos, al mismo tiempo que se reduce la congestión, los accidentes y la contaminación. Sin embargo, desarrollar una movilidad urbana más eficiente y más verde (o en una palabra, más inteligente) es uno de los temas más difíciles de afrontar para las grandes áreas metropolitanas. En esta tesis, abordamos este problema desde la perspectiva de un panorama TIC en rápida evolución que nos permite construir movilidad sin la necesidad de grandes inversiones ni sofisticadas tecnologías de sensores. En particular, proponemos aprovechar el paradigma Mobile Crowdsensing (MCS) en el que los ciudadanos utilizan sus teléfonos móviles y dispositivos, para nosotros recopilar, procesar y analizar localmente información georreferenciada, distribuida voluntariamente. Los datos de movilidad recopilados de ciudadanos que voluntariamente quieren compartirlos (por ejemplo, eventos, intensidad del tráfico, ruido y contaminación del aire, etc.) pueden proporcionar información valiosa sobre las condiciones de movilidad actuales en la ciudad, que con el algoritmo de procesamiento de datos adecuado, pueden utilizarse para enrutar y gestionar el flujo de gente en entornos urbanos. Por lo tanto, en esta tesis combinamos dos prometedoras fuentes de movilidad inteligente: MCS y la planificación de viajes/rutas, uniendo en cierta medida los distintos desafíos de investigación. Hemos dividido nuestros objetivos de investigación en dos etapas: (1) Desafíos arquitectónicos en el diseño de sistemas MCS y (2) Desafíos algorítmicos en la planificación de rutas aprovechando la información del MCS. Nuestro objetivo es demostrar una progresión lógica de la investigación a lo largo del tiempo, comenzando desde los fundamentos de los sistemas de detección centrados en personas, como el MCS, hasta los algoritmos de optimización de rutas diseñados específicamente para la aplicación de estos. Si bien nos centramos en algoritmos y heurísticas para resolver problemas de enrutamiento de clase NP-hard, utilizamos ejemplos de aplicaciones en el mundo real para mostrar las ventajas de los algoritmos e infraestructuras propuestas.
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Kajgård, Emil. "Route Optimisation for Winter Road Maintenance using Constraint Modelling". Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-268025.

Texto completo da fonte
Resumo:
Planning of routes for the many kinds of road maintenance problems is essential. These problems can be generalised to the vehicle routing problem, where a num- ber of available vehicles should be assigned to objectives in an optimised order. With different kinds of winter-based maintenance tasks come many variations of the problem, making the flexibility of an optimisation system an important aspect. The problem is approached using constraint programming technology with the modelling language MiniZinc. A model is presented for route opti- misation of winter road maintenance related problems. The model has been tested against an existing system written in C# using guided local search as search strategy, in terms of quality of the solution and solving time. Several back-end solvers have been tested with the model in a black-box manner; CPX Opturion, Gecode, or-tools, and OscaR/CBLS, where or-tools performed well compared to the others. The advantages of using constraint modelling with MiniZinc are shown when the problem specifications are not clear beforehand, since adapting a model for new scenarios is done with little effort. However, the presented model can not compete in terms of solving time when the problem size increases. A proposed solution to this is to cluster objectives together and generalising the problem, making the problem sizes smaller.
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Durand, Nicolas. "Optimisation de trajectoires pour la résolution de conflits aériens en route". Toulouse, INPT, 1996. https://tel.archives-ouvertes.fr/tel-01293710.

Texto completo da fonte
Resumo:
L'augmentation du trafic aerien genere des problemes d'optimisation tres complexes pour le controle aerien. Le probleme d'optimisation de trajectoires pour la resolution de conflits en route reste aujourd'hui ouvert. Dans cette these, l'approche initiale est d'etudier le probleme de conflit a deux avions comme un probleme de commande optimale avec contrainte sur l'etat. Cette approche permet de degager certaines proprietes des trajectoires optimales. L'etude theorique de la structure de l'ensemble des trajectoires admissibles fait apparaitre le caractere fortement combinatoire du probleme. Des applications numeriques effectuees avec un algorithme de type gradient permettent alors d'illustrer les resultats theoriques et de constater l'inefficacite des methodes locales. Dans un deuxieme temps, les resultats theoriques sont exploites afin de definir les premiers elements de modelisation du probleme reel permettant de tenir compte des contraintes operationnelles liees au contexte du controle du trafic aerien. Le caractere global et fortement combinatoire du probleme d'optimisation conduit a utiliser les algorithmes genetiques. Ceux-ci permettent d'approcher plusieurs solutions differentes proches de l'optimum. Un operateur de croisement adapte aux fonctions partiellement separables est introduit dans les algorithmes genetiques de maniere a pouvoir resoudre des conflits pouvant impliquer jusqu'a une vingtaine d'avions en temps reel avec de faibles populations. Les resultats sont illustres par plusieurs exemples
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Djannaty, Farhad. "Network based heuristics for the set covering problem". Thesis, Brunel University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.320547.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Boje, E. P., e B. J. Kotze. "An integrated control system for an Automatic Guided Vehicle (AGV)". Interim : Interdisciplinary Journal, Vol 7, Issue 1: Central University of Technology Free State Bloemfontein, 2008. http://hdl.handle.net/11462/376.

Texto completo da fonte
Resumo:
Published Article
An immense amount of research is currently, being done on the development and use of Automatic Guided Vehicles (AGVs) in industry. An important component of this research often involves navigation and route-optimization of such AGVs. In this paper the design and control of an AGV, using a stationary control system and a GPS-like navigational system, is discussed. Substantial provision has also been made for the display of operational characteristics of the AGV on the stationary control unit.
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Kemloh, Wagoum Armel Ulrich [Verfasser]. "Route Choice Modelling and Runtime Optimisation for Simulation of Building Evacuation / Armel Ulrich Kemloh Wagoum". Wuppertal : Universitätsbibliothek Wuppertal, 2013. http://d-nb.info/1037086201/34.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Kandirakis, Ioannis. "Route optimisation for mobile IPV6 using the return routability procedure: test bed implementation and security analysis /". Monterey, Calif. : Naval Postgraduate School, 2007. http://bosun.nps.edu/uhtbin/hyperion.exe/07Mar%5FKandirakis.pdf.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Zawahreh, Yousef 'Issa. "A novel microwave synthesis of calcium hydroxyapatite : optimisation and investigation of a microwave assisted reaction route". Thesis, Queen Mary, University of London, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.251711.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Zhou, Jun. "Optimisation des procédures de départ et d'arrivée dans une zone terminale". Thesis, Toulouse 3, 2017. http://www.theses.fr/2017TOU30033/document.

Texto completo da fonte
Resumo:
Cette thèse s'intéresse au problème de conception optimale des routes de départ et d'arrivée dans une zone terminale autour d'un aéroport. Cette conception prend en compte la configuration et l'environnement autour des aéroports, et les différentes contraintes sous-jacentes, notamment l'évitement des obstacles et la séparation des routes. Nous proposons une formulation mathématique conduisant à un problème d'optimisation combinatoire, ainsi que des méthodes de résolution ad hoc efficaces pour le problème. Pour la résolution du problème, nous procédons en deux étapes. Nous considérons d'abord la conception d'une route de longueur minimale évitant les obstacles, en utilisant la méthode de Branch and Bound (B&B). Ensuite, nous nous intéressons à la conception de plusieurs routes en assurant en plus la séparation des routes. Deux approches différentes sont appliquées : une méthode basée sur la méthode B&B pour construire les routes séquentiellement suivant un ordre fixé à l'avance, et une méthode de recuit simulé pour construire les routes simultanément. Les résultats sur un ensemble de problèmes tests (artificiels et réels) montrent l'efficacité de notre approche
This thesis proposes a methodology for the optimization of departure and arrival routes in the Terminal Maneuvering Area (TMA). The design of these routes takes into account the configuration and environment around airports, and the related constraints, in particular the avoidance of obstacles and the separation between routes. We propose a mathematical formulation leading to a combinatorial optimization problem, as well as efficient ad hoc resolution methods for the problem. The problem is solved in two steps. First, we design an individual route avoiding obstacles with respect to minimum route length by using a Branch and Bound (B&B) method. Afterwards, the design of multiple routes is solved by two different approaches: a B&B-based approach (where routes are generated sequentially in a given order) and a Simulated Annealing approach (where routes are generated simultaneously). The simulation results of a set of (artificial and real) test problems show the efficiency of our approach
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Berntsson, Simon, e Mattias Andreasson. "Efficient Route-based Optimal Energy Management for Hybrid Electric Vehicles". Thesis, Linköpings universitet, Fordonssystem, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148565.

Texto completo da fonte
Resumo:
The requirements on fuel consumption and emissions for passenger cars are getting stricter every year. This has forced the vehicle industry to look for ways to improve the performance of the driveline. With the increasing focus on electrification, a common method is to combine an electrical driveline with a conventional driveline that uses a petrol or diesel engine, thus creating a hybrid electric vehicle. To fully be able to utilise the potential of the driveline in such a vehicle, an efficient energy management strategy is needed. This thesis describes the development of an efficient route-based energy management strategy. Three different optimisation strategies are combined, deterministic dynamic programming, equivalent consumption minimisation strategy and convex optimisation, together with segmentation of the input data. The developed strategy shows a decrease in computational time with up to more than one hundred times compared to a benchmark algorithm. When implemented in Volvo's simulation tool, VSim, substantial fuel savings of up to ten percent is shown compared to a charge-depleting charge-sustain strategy.
Estilos ABNT, Harvard, Vancouver, APA, etc.
Mais fontes

Livros sobre o assunto "Optimisation de route"

1

Rafiq, Saqib. A decision support system for route optimisation analysis and network cost calculations for an airline. Oxford: Oxford Brookes University, 2003.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Very Soft Organic Clay Applied for Road Embankment: Modelling and Optimisation Approach, UNESCO-IHE PhD, Delft, the Netherlands. Taylor & Francis Group, 2008.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Limsiri, C. Very Soft Organic Clay Applied for Road Embankment: Modelling and Optimisation Approach, UNESCO-IHE PhD, Delft, the Netherlands. Taylor & Francis Group, 2017.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Limsiri, C. Very Soft Organic Clay Applied for Road Embankment: Modelling and Optimisation Approach, UNESCO-IHE PhD, Delft, the Netherlands. Taylor & Francis Group, 2008.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Very Soft Organic Clay Applied for Road Embankment: Modelling and Optimisation Approach, UNESCO-IHE PhD, Delft, the Netherlands. CRC Press LLC, 2012.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.

Capítulos de livros sobre o assunto "Optimisation de route"

1

Raghestani, Nikmal, e Carsten Keßler. "Route Optimisation for Winter Maintenance". In Lecture Notes in Geoinformation and Cartography, 125–42. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-14745-7_8.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Dębski, Roman, e Rafał Dreżewski. "Surrogate-Assisted Ship Route Optimisation". In Computational Science – ICCS 2023, 395–409. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-36024-4_31.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Kim, Dae Gyu, David Corne e Peter Ross. "Industrial plant pipe-route optimisation with genetic algorithms". In Parallel Problem Solving from Nature — PPSN IV, 1012–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61723-x_1064.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Paviotti, Marco, Simon Cooksey, Anouk Paradis, Daniel Wright, Scott Owens e Mark Batty. "Modular Relaxed Dependencies in Weak Memory Concurrency". In Programming Languages and Systems, 599–625. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_22.

Texto completo da fonte
Resumo:
AbstractWe present a denotational semantics for weak memory concurrency that avoids thin-air reads, provides data-race free programs with sequentially consistent semantics (DRF-SC), and supports a compositional refinement relation for validating optimisations. Our semantics identifies false program dependencies that might be removed by compiler optimisation, and leaves in place just the dependencies necessary to rule out thin-air reads. We show that our dependency calculation can be used to rule out thin-air reads in any axiomatic concurrency model, in particular C++. We present a tool that automatically evaluates litmus tests, show that we can augment C++ to fix the thin-air problem, and we prove that our augmentation is compatible with the previously used compilation mappings over key processor architectures. We argue that our dependency calculation offers a practical route to fixing the longstanding problem of thin-air reads in the C++ specification.
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Qureshi, Rehan, e Arek Dadej. "Prefix Delegation Based Route Optimisation in Cooperative Ad Hoc Interconnected Mobile Networks". In Ad Hoc Networks, 302–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36958-2_21.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Alvarez, Pablo, Iosu Lerga, Adrian Serrano e Javier Faulin. "Considering Congestion Costs and Driver Behaviour into Route Optimisation Algorithms in Smart Cities". In Smart Cities, 39–50. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59513-9_5.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Attivilli, Ravali, Afraa Noureen, Vaibhavi Sachin Rao e Siddhaling Urolagin. "A Real-Time Graphical Representation of Various Path Finding Algorithms for Route Optimisation". In Advances in Data-driven Computing and Intelligent Systems, 479–93. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-0981-0_37.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Wei, Hanbo, e Chengming Zhu. "Optimisation of Bus Routes in Small and Medium-sized Cities: The Case of No. 7 Bus Route in Jiaozuo City". In Advances in Engineering Research, 104–14. Dordrecht: Atlantis Press International BV, 2024. https://doi.org/10.2991/978-94-6463-610-9_12.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

García, María González, Rodrigo de la Calle Alonso, Álvaro Lozano Murciego e María N. Moreno-García. "Van Trip Design System Based on Route Optimisation and an Innovative Cold-Start Solution for POI Recommender Systems". In Advances in Intelligent Systems and Computing, 283–93. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38344-1_27.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Goodwin, Morten, Ole-Christoffer Granmo, Jaziar Radianti, Parvaneh Sarshar e Sondre Glimsdal. "Ant Colony Optimisation for Planning Safe Escape Routes". In Recent Trends in Applied Artificial Intelligence, 53–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38577-3_6.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.

Trabalhos de conferências sobre o assunto "Optimisation de route"

1

Reimer, N. "Ice Route Optimisation". In The International Conference on Ice Class Ships 2012. RINA, 2012. http://dx.doi.org/10.3940/rina.ice.2012.14.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Romdhani, Imed, Jose Munoz, Hatem Bettahar e Abdelmadjid Bouabdallah. "Mobile Multicast Route Optimisation". In 2006 IEEE International Conference on Communications. IEEE, 2006. http://dx.doi.org/10.1109/icc.2006.255060.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Kedia, Raja Kumar, e B. Krishna Naick. "Review of vehicle route optimisation". In 2017 2nd IEEE International Conference on Intelligent Transportation Engineering (ICITE). IEEE, 2017. http://dx.doi.org/10.1109/icite.2017.8056881.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Waldock, Antony, e David Corne. "Multiple objective optimisation applied to route planning". In the 13th annual conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/2001576.2001821.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Goojar, Arunya, Parth Verma, Nitin Singh, Shubhradeep Debnath e Neha Tyagi. "Intelligent Carpooling - Machine Learning Route and Pickup Optimisation". In 2024 IEEE International Conference on Computing, Power and Communication Technologies (IC2PCT). IEEE, 2024. http://dx.doi.org/10.1109/ic2pct60090.2024.10486491.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Alexandru-Ionuţ, Niţu. "A Practical Agile Route Optimisation Solution for Transport of Goods". In 2023 27th International Conference on System Theory, Control and Computing (ICSTCC). IEEE, 2023. http://dx.doi.org/10.1109/icstcc59206.2023.10308473.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Pease, Gareth, David Limebeer e Peter Fussey. "Diesel engine optimisation, with emissions constraints, on a prescribed driving route". In 2017 IEEE AFRICON. IEEE, 2017. http://dx.doi.org/10.1109/afrcon.2017.8095517.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Ojo, Oluwatayo Babatope, Uyioghosa Igie e Pericles Pilidis. "Techno-Economic Optimisation of Gas Compressor Station Location As a Decision Variable". In ASME Turbo Expo 2024: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2024. http://dx.doi.org/10.1115/gt2024-126805.

Texto completo da fonte
Resumo:
Abstract An economical natural gas transportation will require the lowest possible capital and operating expenditures over its lifecycle. To attain these conditions, the designers and investors must estimate the number of compressor stations (CS) that are needed along the pipeline route. More so is the need to determine their optimised locations at various pipeline segments along the pipeline. This study considers the techno-economic optimisation of the compressor station and pipeline segments, making up the proposed Trans-Saharan Gas Pipeline (TSGP) project. The optimised lifecycle cost, CS locations and pipeline segments are evaluated with the main aim of minimising costs. A SIMULINK model is developed using the techno-economic and environmental risk analysis (TERA) framework. The model is incorporated with an optimiser that enables an economic analysis of the TERA framework. Including the optimiser affects the outcome of the TERA in terms of the lifecycle cost. The optimisation problems are formulated considering the compressor station location as the decision variable. The lifecycle cost of the compressor stations and pipeline system is the objective function. A scenarios-based techno-economic optimisation study is performed to mimic the standard compressor station and pipeline system network configurations in the real world. The baseline case consists of 18 compressor stations at fixed locations along the pipeline route. The results show 12 compressor station locations along the pipeline route with a reduction in the lifecycle cost by 12.95% in one of the optimised scenarios compared to the baseline case. The net present value is $28.77 billion assuming a discount rate of 15%. The optimised compressor station locations are at 1, 38, 76, 113, 150, 186, 222, 260, 296, 332, 368, and 408 segments of the pipeline. The outcome of the analyses shows the importance of the two-level optimisation algorithm utilised by the SIMULINK model for the integrated TERA. Hence, this study shows the potential of the TERA modelling and CS location optimisation method utilised in this research in guiding decision-makers on the selection of compressor-turbine configurations. These configurations will give the optimal lifecycle cost at the optimised compressor station locations along the pipeline route.
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Kefalidou, Genovefa. "An Empirical Framework for Understanding Human-Technology Interaction Optimisation for Route Planning". In Proceedings of the 32nd International BCS Human Computer Interaction Conference. BCS Learning & Development, 2018. http://dx.doi.org/10.14236/ewic/hci2018.62.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Karode, Tanakorn, e Warodom Werapun. "A Case Study of Route Optimisation for Phuket Healthy Drink Delivery System". In 2019 23rd International Computer Science and Engineering Conference (ICSEC). IEEE, 2019. http://dx.doi.org/10.1109/icsec47112.2019.8974704.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
Você também pode estar interessado nas extensas listas de trabalhos sobre o assunto "Optimisation de route":
Artigos de revistas Teses / dissertações
Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!

Vá para a bibliografia