Добірка наукової літератури з теми "Problème d'itinéraire de véhicule"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Problème d'itinéraire de véhicule".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Problème d'itinéraire de véhicule":
Tardif, Maurice. "Le chercheur et les contraintes doxologiques." Revue des sciences de l'éducation 14, no. 2 (November 26, 2009): 149–63. http://dx.doi.org/10.7202/900592ar.
Poupart, Anthony, Milad Delavary, Cheikh Faye, Hector Ignacio Castellucci, Mathieu Tremblay, and Martin Lavallière. "Analyse des accidents de travail mortels survenus au Québec comprenant un véhicule roulant de 2013 à 2017 : perspectives et avenues d’intervention." Revue organisations & territoires 30, no. 3 (February 11, 2022): 23–32. http://dx.doi.org/10.1522/revueot.v30n3.1376.
de Feraudy, Tatiana. "La civic tech : des professionnel·les de la communication numérique à l’assaut de la participation citoyenne (2016-2019)." Politiques de communication N° 20-21, no. 1 (March 6, 2024): 195–227. http://dx.doi.org/10.3917/pdc.020.0195.
Wang, Hanchi (Emilie). "La belle infidèle orientale." Babel. Revue internationale de la traduction / International Journal of Translation 66, no. 6 (November 25, 2020): 928–49. http://dx.doi.org/10.1075/babel.00197.wan.
Labelle, Micheline, and Daniel Salée. "La citoyenneté en question : l’État canadien face à l’immigration et à la diversité nationale et culturelle." Sociologie et sociétés 31, no. 2 (October 2, 2002): 125–44. http://dx.doi.org/10.7202/001395ar.
Des Aulniers, Luce. "Pratiques rituelles du temps du mourir et formes actuelles de la belle mort1." Articles 20, no. 1 (May 8, 2008): 22–26. http://dx.doi.org/10.7202/017943ar.
Riesen, Ingrid. "L’angoisse de vivre et l’angoisse d’écrire dans Incidents de parcours de Simone Chaput." Articles 28, no. 1 (June 15, 2016): 35–44. http://dx.doi.org/10.7202/1036747ar.
Hangnilo, Robert. "Eclairage électrique décentralisé des zones rurales isolées de la République du Bénin." Journal of Renewable Energies 15, no. 2 (October 23, 2023): 265–74. http://dx.doi.org/10.54966/jreen.v15i2.317.
Slama, Omessaad, Bechir Alaya, and Salah Zidi. "Towards Misbehavior Intelligent Detection Using Guided Machine Learning in Vehicular Ad-hoc Networks (VANET)." Inteligencia Artificial 25, no. 70 (December 31, 2022): 138–54. http://dx.doi.org/10.4114/intartif.vol25iss70pp138-154.
MBIDI, Didier OMADJELA, and David ANGALAWE OTEMIKONGO. "PROTECTION SOCIALE DES PERSONNES VIVANT AVEC HANDICAP MOTEUR EN REPUBLIQUE DEMOCRATIQUE DU CONGO : CAS DE LA VILLE DE KISANGANI DE 2015 A 2020." IJRDO - Journal of Social Science and Humanities Research 8, no. 11 (November 9, 2022): 170–80. http://dx.doi.org/10.53555/sshr.v8i11.5419.
Дисертації з теми "Problème d'itinéraire de véhicule":
Shahin, Reza. "Incorporating Ad Hoc Stops in Public Transport : A Study on Flex-Route Transit." Electronic Thesis or Diss., Université Gustave Eiffel, 2024. http://www.theses.fr/2024UEFL2004.
In recent years, there has been an ascending trend towards the adoption of flexible transit solutions like Demand Responsive Transit (DRT), primarily due to the enhanced convenience they offer to passengers. However, this flexibility comes with an associated economic burden. Consequently, transport authorities are presently exploring methods to augment the flexibility of Conventional Public Transport (CPT), which is more conservative compared to DRT. This gives rise to the significance of Flex-Route Transit (FRT), an innovative system amalgamating the benefits of both DRT and CPT. In the doctoral dissertation presented here, we conduct an exhaustive investigation of FRT frameworks. Specifically, we scrutinize pertinent academic literature, highlighting extant research lacunae. Then, we formulate a Mixed Integer Linear Programming (MILP) model extending the state of the art to include previously neglected problem features, and we supplement it by a set of valid inequalities to enhance its linear relaxation. We also introduce a heuristic algorithm to procure a feasible solution and employ a warm start technique to boost the MILP solution. Subsequently, a comprehensive full factorial experimental design sensitivity analysis is carried out. Here, we evaluate the system's saturation levels under various demand scenarios, focusing on the elongated wait times for passengers. In the final contribution chapter, a stochastic MILP model for the FRT is proposed, wherein certain initial parameters of the base MILP are elevated to variable status. We conclude the dissertation by outlining prospective avenues for future research
Souid, Mahdi. "Résolution approchée d'un problème de tournées de véhicule avec contraintes d'accessibilité." Valenciennes, 2003. http://www.theses.fr/2003VALE0041.
In a competitive context, enterprises must improve the efficiency of their logistical chains, in order to optimize the factors cost and time of service. A fundamental element of all logistical system is the management and the scheduling of distribution networks. Our survey consists in treating a problem of location and routing called Vehicle Routing Problem with Accessibility constraint (VRPA). The problematic consists in supplying, at least cost, a set of customers with a road-train composed of a truck and a trailer, while taking account the accessibility constraint. We proposed two models for the VRPA and developed three heuristics for resolution of the PTVA. First, we implement methods that can be considered as two phases methods. The first phase consists in solving a location problem and the second phase to solve routing problems. Then, we present methods of resolution of the PTVA based on variable neighbourhood search method. Finally, we present three tabu search methods for the resolution of the PTVA
Sukarno, Setyawan Ajie. "Méthodes d'approximation au problème de routage de véhicule pour une gestion de flotte de drones." Thesis, Valenciennes, Université Polytechnique Hauts-de-France, 2019. http://www.theses.fr/2019UPHF0022.
Nowadays, drone plays a big role in civilian purposes, and it will getting bigger and more important in the future. Because of it’s flexibility and versatility, the application of drone is more extensive. Incertain fields of implementation, applying a team of drones will improve the effectiveness and efficiency of the application, such as in search and rescue, military purpose, agriculture and surveillance. Recently, there is a challenging issue to manage a team of drones in order to achieve the given mission. This issue opens many research opportunities, and our project is made to answer this challenge, to develop a platform for managing a fleet of drones. Among several approaches, vehicle routing problem (VRP) is one of a considered study to answer this challenge, in order to allocate the tasks and find the best path for each drone, with several constraints to be considered. There are many methods to solve VRP, and could be categorized into two groups i.e. exact and approximation method. But since VRP is classified as an NP-hard optimization problem, an approximation method is considered to be implemented in this project. Genetic Algorithm (GA), an approximation method which designed by an inspiration to the evolutionary ideas of genetic and natural selection, is applied in this project, since it is one of most used algorithm to solve VRP, among several approximation method. We observed that GA is suitable to be implemented in this project, but when the number of to-be-visited-points is hugely augmented, the number of iterations to get a satisfactory result would be extremely increased. This issue led us to hybridize GA with Clarke and Wright’s saving algorithm (SA) in order to generate the initial population, so that it is no longer randomly generated as usually done. Eventually, this proposed hybrid method can improve the performance of the algorithm very satisfactorily, and reduce the number of iteration more than 90%. Furthermore, a dynamic scenario in VRP is taken into account in this work i.e. an emerge of one or several new points that appear once the mission is already launched, and require a visit by a single drone. To deal with this dynamic scenarios, a Reverse Open Vehicle Routing Problem (ROVRP) is considered to be implemented. We decide to choose a heuristic method in solving the ROVRP, as it is classified as an NP-hard optimization problem, and we prefer to apply Clarke and Wright’s Saving Algorithm (SA) in this project, due to their speed and simplicity. In our point of view, speed is one most considerable thing in choosing algorithm to solve dynamic scenario in VRP. Our proposed method is devided into two phases i.e. clustering and routing. And the experimental results show that our proposed method can give more than 95% accuracy. In order to simulate and investigate the proposed methods, a Graphical User Interface (GUI) is developed. There are some available framework to develop this tool, and Netlogo is considered as the chosen framework
Gueguen, Cyrille. "Méthodes de résolution exacte pour les problèmes de tournées de véhicules." Châtenay-Malabry, Ecole centrale de Paris, 1999. http://www.theses.fr/1999ECAP0664.
Kueviakoe, Kangni. "Localisation multi-capteurs garantie : résolution d'un problème de satisfaction de contraintes." Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112241/document.
This thesis deals with the vehicle locationand addresses the problem of SLAM (simultaneous localization and mapping). Several methods are used to solve this kind of problem. They can be classified into two broad categories of approaches: probabilistic approach and deterministic approaches. This work addresses the deterministic approaches and more precisely the approach based on interval analysis. The work has been conducted on real data sets collected in outdoor environments with proprioceptive and exteroceptive sensors.When multiple sensors providing complementary or redundant information are put into play, it is important to merge the data to improve the estimated pose. The approach detailed in this document uses the intervals methods and presents the localization problem as a constraint satisfaction problem.The resolution is done using a solver interval. Several solvers were compared. One thing is clear: local consistency algorithms do not address the uncertainty of the orientation. This thesis proposes a method of locating usable in real time applications and corrects the uncertainty in the heading of the vehicle. We compared our results with those of the extended Kalman filter (probabilistic reference method) and highlighted one of the interests of our method: the assurance of consistency of the pose (position and orientation of the mobile).This thesis proposes two contributions. The first is methodological. In the state of the art all works affirm the need (or obligation) to pre-decompose the constraints of the problem before the resolution step. Our work allows to prove otherwise. The second contribution relates to the reduction of the orientation uncertainty by combining constraint propagation and a bisection approach
Pinaud, Olivier. "Caractérisation, modélisation et identification de sources de champ magnétique dans un véhicule électrique." Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENT070/document.
Electric vehicles have a lot of electrical devices onboard. All of them may generate electromagnetic field inside the car: a quite small space containing the passengers. A complete modeling of the vehicle can hardly be done because of the parameters number. The magnetic field measurement everywhere inside the car is also impossible. We first measure the magnetic field inside the car to study its characteristics. Then we propose to merge together a priori modeling with measurements into a Bayesian approach of the inverse problem. Based on spherical harmonic decomposition of the magnetic field, a priori information helps the resolution and gives the identified parameters with a very few measurements
Roynette, Eliott. "Optimisation de la conception du design du harnais de commande des véhicules spatiaux." Thesis, Toulouse, ISAE, 2018. http://www.theses.fr/2018ESAE0011/document.
Sixty years ago, on October 4, 1957, Sputnik, the first man-made artificial satellite, was sent into space. Its only function is to emit a radio beep at frequencies of 20 and 40 MHz to demonstrate the space power of the USSR. Since then, satellites have been multiple and their missions have diversified. Today, the missions of the satellites are so varied that some leave Earth's orbit. We speak in the case of probes, even if, in the rest of this thesis, they will be included in the term "satellite". The best-known satellite mission of the general public is the discovery of the universe and interplanetary exploration with satellite satellites such as the Hubble International Space Telescope or probes such as Rosetta, Voyager 1 and 2, ... nevertheless nowadays Although space exploration remains a major issue for humanity, most satellites have smaller missions that have a significant impact on economic and political life. The satellites in question today have two goals: defense and commercial. In both cases the satellites can be divided into two distinct groups: observation satellites and telecommunication satellites. To operate all these satellites, use an electrical harness. The electrical harness includes all the cables present in the satellite and which does not carry any customer data. As part of this we are interested in optimizing the design of the electrical harness of satellites
Hendi, Hayder. "Ontologies et web sémantique pour une construction évolutive d'applications dédiées à la logistique." Thesis, Littoral, 2017. http://www.theses.fr/2017DUNK0462/document.
Logistics problems are often complex combinatorial problems. These may also implicitly refer to the processes, actors, activities, and methods concerning various aspects that need to be considered. Thus the same process may involve the processes of sale/purchase, transport/delivery, and stock management. These processes are so diverse and interconnected that it is difficult for a logistic expert to compete all of them. In this thesis, we propose the explications with the help of ontologies of conceptual ans semantic knowledge concerning the logistic processes. This explicit knowledge is then used to develop a reasoning system to guide the logistic expert for an incremental and semi-automatic construction of a software solution to an instantly posed problem. We define an ontology concerning the inter-connected logistics and associated optimization problem. We, henceforth, establish an explicit semantic link between the domains of logistics and the optimization. It may allow the logistic expert to identify precisely and unambiguously the confronted logistic problem and the associated optimization problem. The identification of the problems then leads to a process to choose the solutions ranging from the choice of the precise logistic process to be implemented to that of the method to solve the combinatorial problem until the discovery of the software component to be invoked and which is implemented by a web service. The approach we have adopted and implemented has been experimented with the "Vehicle Routing Problems", the "Passenger Train Problem" and the "Container Terminal problems"
Volpert, Thibault. "Étude d'un schéma différences finies haute précision et d'un modèle de fil mince oblique pour simuler les perturbations électromagnétiques sur véhicule aérospatial." Thesis, Toulouse, ISAE, 2014. http://www.theses.fr/2014ESAE0042/document.
This thesis is about the study of a high spatial finite element method whichcan be assimilated at an extension of the Yee schema. In the next, this method is also called high order finite difference method. In the first chapter, we give a non exhaustive recall of the major methods used to treat EMC problems and we show the necessity to have this kind of schema to simulate efficiently some EMC configurations. In the second chapter, the principle of the numerical method is presented and a stability condition is given. A numerical study analysis of the schema convergence is also done. Next, we show the interest to have the possibility to use local spatial order by cell in each direction of the computational domain. Some canonic examples are given to show the advantages interms of CPU time and memory storage of the method by comparison with Yee’s scheme and DG approach. In the third chapter, we define and validate on several examples,some physical models as thin wire, materials and perfectly metallic ground in presence of a plane wave, to have the possibility to treat EMC problems. The fourth chapter is about a hybridization strategy between our high order FDTD method and a DG schema.We focalize our study on a hybrid method which provides an energy conservation of the continuous problem. A numerical example is given to validate the method. Finally, in the last chapter, we present some simulations on industrial problems to show the possibility of the method to treat realistic EMC problems
Ait, Saadi Amylia. "Coordination of scout drones (UAVs) in smart-city to serve autonomous vehicles." Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG064.
The subject of Unmanned Aerial Vehicles (UAVs) has become a promising study field in bothresearch and industry. Due to their autonomy and efficiency in flight, UAVs are considerablyused in various applications for different tasks. Actually, the autonomy of the UAVis a challenging issue that can impact both its performance and safety during the mission.During the flight, the autonomous UAVs are required to investigate the area and determineefficiently their trajectory by preserving their resources (energy related to both altitude andpath length) and satisfying some constraints (obstacles and axe rotations). This problem isdefined as the UAV path planning problem that requires efficient algorithms to be solved,often Artificial Intelligence algorithms. In this thesis, we present two novel approachesfor solving the UAV path planning problem. The first approach is an improved algorithmbased on African Vultures Optimization Algorithm (AVOA), called CCO-AVOA algorithms,which integrates the Chaotic map, Cauchy mutation, and Elite Opposition-based learningstrategies. These three strategies improve the performance of the original AVOA algorithmin terms of the diversity of solutions and the exploration/exploitation search balance. Asecond approach is a hybrid-based approach, called CAOSA, based on the hybridization ofChaotic Aquila Optimization with Simulated Annealing algorithms. The introduction of thechaotic map enhances the diversity of the Aquila Optimization (AO), while the SimulatedAnnealing (SA) algorithm is applied as a local search algorithm to improve the exploitationsearch of the traditional AO algorithm. Finally, the autonomy and efficiency of the UAVare tackled in another important application, which is the UAV placement problem. Theissue of the UAV placement relays on finding the optimal UAV placement that satisfies boththe network coverage and connectivity while considering the UAV's limitation from energyand load. In this context, we proposed an efficient hybrid called IMRFO-TS, based on thecombination of Improved Manta Ray Foraging Optimization, which integrates a tangentialcontrol strategy and Tabu Search algorithms