The Implementation of Eulerian Coverings of a Graph for Solving Routing Problems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

The Implementation of Eulerian Coverings of a Graph for Solving Routing Problems

Tatiana A. Makarovskikh
  • Fonction : Auteur
  • PersonId : 1154721

Résumé

In terms of graph theory, the urban transport network can be adequately represented as a graph. All crossroads in the city are considered to be the vertices of the graph, and streets are the edges. Using this model, one can set and effectively solve many routing problems: (1) constructing the routes between given starting and ending points, satisfying the rules of the road (allowed turns at crossroads and a given sequence of driving through the streets), (2) finding the way, passing through all the streets of the city in accordance with the rules of the road and a given sequence of turns at crossroads (an algorithm for constructing an permissible Eulerian chain), (3) constructing a minimal cardinality set of routes running through all the streets of the city (Eulerian cover of any graph with permissible chains). The paper provides a formalization of these problems and effective algorithms for solving them.
Fichier principal
Vignette du fichier
520762_1_En_6_Chapter.pdf (523.82 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03897879 , version 1 (14-12-2022)

Licence

Paternité

Identifiants

Citer

Tatiana A. Makarovskikh. The Implementation of Eulerian Coverings of a Graph for Solving Routing Problems. IFIP International Conference on Advances in Production Management Systems (APMS), Sep 2021, Nantes, France. pp.51-58, ⟨10.1007/978-3-030-85914-5_6⟩. ⟨hal-03897879⟩
16 Consultations
7 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More