2019

Chapitre de livre

Artificial Intelligence and Soft Computing, Springer International Publishing, 2019, pp 512--525

Many fields use the graphs as a tool of representation such as multimodal networks, computer networks, wireless sensor networks, energy distribution. But, beyond the representation of data, the graphs also serve to propose solutions to certain problems mentioning the well-known problem finding the shortest Hamiltonian circuit in a graph. The aim of this paper is to elucidate a mechanism to obtain the most efficient Hamiltonian circuit among specified nodes in a given superimposed graphs (SGs). The Hamiltonian circuit is a circuit that visits each node on the graph exactly once. The SG represents a scheme of multimodal transportation systems and takes into account distance among other variables. The Hamiltonian path may be constructed and adjusted according to specific constraints such as time limits. This paper introduces new constraint satisfaction optimization problem formalism (CSOP) for the problem of finding the lowest Hamiltonian circuit in superimposed graphs, and as a resolution method, we use the genetic algorithm. As a case study, we adopt the transportation data of Guangzhou, in China.

@InProceedings{10.1007/978-3-030-20915-5_46,

author="Bouazzi, Khaoula

and Hammami, Moez

and Bouamama, Sadok",

editor="Rutkowski, Leszek

and Scherer, Rafa{\l}

and Korytkowski, Marcin

and Pedrycz, Witold

and Tadeusiewicz, Ryszard

and Zurada, Jacek M.",

title="Hybrid Genetic Algorithm for CSOP to Find the Lowest Hamiltonian Circuit in a Superimposed Graph",

booktitle="Artificial Intelligence and Soft Computing",

year="2019",

publisher="Springer International Publishing",

address="Cham",

pages="512--525",

abstract="Many fields use the graphs as a tool of representation such as multimodal networks, computer networks, wireless sensor networks, energy distribution. But, beyond the representation of data, the graphs also serve to propose solutions to certain problems mentioning the well-known problem finding the shortest Hamiltonian circuit in a graph. The aim of this paper is to elucidate a mechanism to obtain the most efficient Hamiltonian circuit among specified nodes in a given superimposed graphs (SGs). The Hamiltonian circuit is a circuit that visits each node on the graph exactly once. The SG represents a scheme of multimodal transportation systems and takes into account distance among other variables. The Hamiltonian path may be constructed and adjusted according to specific constraints such as time limits. This paper introduces new constraint satisfaction optimization problem formalism (CSOP) for the problem of finding the lowest Hamiltonian circuit in superimposed graphs, and as a resolution method, we use the genetic algorithm. As a case study, we adopt the transportation data of Guangzhou, in China.",

isbn="978-3-030-20915-5"

}