{"id":198108,"date":"2025-10-10T06:08:00","date_gmt":"2025-10-10T05:08:00","guid":{"rendered":"https:\/\/datascientest.com\/en\/?p=198108"},"modified":"2025-09-23T18:09:00","modified_gmt":"2025-09-23T17:09:00","slug":"all-about-genetic-algorithms","status":"publish","type":"post","link":"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms","title":{"rendered":"Optimizing a tourist route with a genetic algorithm: use case in the Morvan"},"content":{"rendered":"\t\t<div data-elementor-type=\"wp-post\" data-elementor-id=\"198108\" class=\"elementor elementor-198108\" data-elementor-post-type=\"post\">\n\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-cb61671 e-flex e-con-boxed e-con\" data-id=\"cb61671\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-88c26d9 elementor-widget elementor-widget-text-editor\" data-id=\"88c26d9\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<style>\/*! elementor - v3.15.0 - 02-08-2023 *\/\n.elementor-widget-text-editor.elementor-drop-cap-view-stacked .elementor-drop-cap{background-color:#69727d;color:#fff}.elementor-widget-text-editor.elementor-drop-cap-view-framed .elementor-drop-cap{color:#69727d;border:3px solid;background-color:transparent}.elementor-widget-text-editor:not(.elementor-drop-cap-view-default) .elementor-drop-cap{margin-top:8px}.elementor-widget-text-editor:not(.elementor-drop-cap-view-default) .elementor-drop-cap-letter{width:1em;height:1em}.elementor-widget-text-editor .elementor-drop-cap{float:left;text-align:center;line-height:1;font-size:50px}.elementor-widget-text-editor .elementor-drop-cap-letter{display:inline-block}<\/style>\t\t\t\t<p><b>As their name suggests, optimization algorithms are designed to find an optimal (or ideally the best) solution to a problem, according to specific criteria or objectives.<\/b><\/p><p><b>Among <a href=\"https:\/\/datascientest.com\/en\/boosting-business-with-3-essential-machine-learning-algorithms\">the many optimization algorithms available<\/a>, some are inspired by nature: these are known as biomimetic algorithms. They may draw from the collective intelligence of insects (swarm optimization) or the principles of natural selection, as seen in genetic optimization algorithms (also referred to as evolutionary algorithms).<\/b><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-fef2377 elementor-widget elementor-widget-text-editor\" data-id=\"fef2377\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">The <\/span><b>principles of natural selection<\/b><span style=\"font-weight: 400;\">, which primarily derive from <\/span><b>Darwin&#8217;s theory<\/b><span style=\"font-weight: 400;\">, focus on selecting the most well-adapted individuals, enabling species to evolve over generations.<\/span><\/p><p><span style=\"font-weight: 400;\">In the realm of <\/span><b>genetic algorithms<\/b><span style=\"font-weight: 400;\">, the data for our problem are organized in the form of a vector that represents the genome of different individuals. The aim is to create an initial population of individuals and then <\/span><b>select the best ones<\/b><span style=\"font-weight: 400;\">, generation after generation. This selection is based on rating criteria, with the highest-rated individuals chosen for the next generation.<\/span><\/p><p><span style=\"font-weight: 400;\">To illustrate this article, consider the example of a vacationer planning to spend 10 days in the Morvan Regional Natural Park in Burgundy. The goal is to visit cities boasting the most historical points of interest while covering the fewest kilometers. On the third and eighth days, accommodations must include a hotel with at least a 3-star rating.<\/span><\/p><p><span style=\"font-weight: 400;\">There are certainly more sophisticated turnkey libraries available to implement these algorithms, but the code example developed here will help clarify their basic mechanisms.<\/span><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-e5ba29b e-flex e-con-boxed e-con\" data-id=\"e5ba29b\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-97a05d6 elementor-widget elementor-widget-heading\" data-id=\"97a05d6\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<style>\/*! elementor - v3.15.0 - 02-08-2023 *\/\n.elementor-heading-title{padding:0;margin:0;line-height:1}.elementor-widget-heading .elementor-heading-title[class*=elementor-size-]>a{color:inherit;font-size:inherit;line-height:inherit}.elementor-widget-heading .elementor-heading-title.elementor-size-small{font-size:15px}.elementor-widget-heading .elementor-heading-title.elementor-size-medium{font-size:19px}.elementor-widget-heading .elementor-heading-title.elementor-size-large{font-size:29px}.elementor-widget-heading .elementor-heading-title.elementor-size-xl{font-size:39px}.elementor-widget-heading .elementor-heading-title.elementor-size-xxl{font-size:59px}<\/style><h2 class=\"elementor-heading-title elementor-size-xl\">The Data<\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-c8ac5f7 elementor-widget elementor-widget-text-editor\" data-id=\"c8ac5f7\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">For data collection, I sourced historical points of interest (POIs) for each town in the park from OpenStreetMap. Information from the French government provided the locations of 3-star or better hotels and the geographical coordinates of town centers for calculating distances.<\/span><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-3c95d8c elementor-widget elementor-widget-image\" data-id=\"3c95d8c\" data-element_type=\"widget\" data-widget_type=\"image.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<style>\/*! elementor - v3.15.0 - 02-08-2023 *\/\n.elementor-widget-image{text-align:center}.elementor-widget-image a{display:inline-block}.elementor-widget-image a img[src$=\".svg\"]{width:48px}.elementor-widget-image img{vertical-align:middle;display:inline-block}<\/style>\t\t\t\t\t\t\t\t\t\t\t\t<img decoding=\"async\" width=\"774\" height=\"204\" src=\"https:\/\/datascientest.com\/en\/files\/2025\/07\/image6.png\" class=\"attachment-full size-full wp-image-198111\" alt=\"\" srcset=\"https:\/\/datascientest.com\/en\/files\/2025\/07\/image6.png 774w, https:\/\/datascientest.com\/en\/files\/2025\/07\/image6-300x79.png 300w, https:\/\/datascientest.com\/en\/files\/2025\/07\/image6-768x202.png 768w\" sizes=\"(max-width: 774px) 100vw, 774px\" \/>\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-6bd1893 elementor-align-center button-principale elementor-widget elementor-widget-button\" data-id=\"6bd1893\" data-element_type=\"widget\" data-widget_type=\"button.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-button-wrapper\">\n\t\t\t<a class=\"elementor-button elementor-button-link elementor-size-sm elementor-animation-grow\" href=\"https:\/\/datascientest.com\/en\/data-scientist-course\">\n\t\t\t\t\t\t<span class=\"elementor-button-content-wrapper\">\n\t\t\t\t\t\t<span class=\"elementor-button-text\">Learn to use Python<\/span>\n\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-ae6215b e-flex e-con-boxed e-con\" data-id=\"ae6215b\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-18eed55 elementor-widget elementor-widget-heading\" data-id=\"18eed55\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-xl\">Creating the Initial Population<\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-b894161 elementor-widget elementor-widget-text-editor\" data-id=\"b894161\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">If our goal were to directly find the <\/span><b>optimal solution to the problem<\/b><span style=\"font-weight: 400;\">, it would involve evaluating all possible combinations and assessing their effectiveness in solving the problem. Unfortunately, current computational capabilities don&#8217;t allow for this with complex problems. Hence, we need to form a population large enough to be a <\/span><b>representative sample<\/b><span style=\"font-weight: 400;\">, yet not so large as to excessively prolong computation times. A potential compromise could be a smaller population size in exchange for increasing the <\/span><b>number of iterations<\/b><span style=\"font-weight: 400;\"> (or generations). This step involves some experimentation, and multiple tries may be necessary to find a satisfactory compromise. I opted for an initial population of 1500 individuals.<\/span><\/p><p><span style=\"font-weight: 400;\">Regarding each individual&#8217;s genetic traits, the solution is straightforward: the genome is randomly generated from various values.<\/span><\/p><p><span style=\"font-weight: 400;\">In our scenario, a function generates random lists based on the INSEE codes of the various municipalities in the Morvan park.<\/span><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-ba4f229 e-flex e-con-boxed e-con\" data-id=\"ba4f229\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-8942bcf elementor-widget elementor-widget-heading\" data-id=\"8942bcf\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-xl\">Evaluating Individuals<\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-21920a2 elementor-widget elementor-widget-text-editor\" data-id=\"21920a2\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">Once the first generation of the population is established, each individual must be evaluated to select the best ones.<\/span><\/p><p><span style=\"font-weight: 400;\">Here, no one-size-fits-all solution exists; each problem requires its own evaluation strategy to identify the top performers. Once evaluation is complete, the process of selecting and forming new generations begins.<\/span><\/p><p><span style=\"font-weight: 400;\">In my case, the two evaluation criteria are the total distance traveled and the total number of points of interest on the route. To avoid routes with few kilometers but lacking points of interest (or the reverse), I chose to group the most efficient routes in terms of both mileage and points of interest by decile. Thus, routes rated 2 belong simultaneously to the second deciles of these two categories. Routes rated 10 include, beyond their deciles, all routes not meeting this dual decile requirement.<\/span><\/p><p><span style=\"font-weight: 400;\">As the accommodation criterion inevitably changes with iterations, I decided not to include it as a pure rating criterion but rather use it as a filter within my data frames.<\/span><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-99096c6 elementor-widget elementor-widget-shortcode\" data-id=\"99096c6\" data-element_type=\"widget\" data-widget_type=\"shortcode.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-shortcode\"><script src=\"https:\/\/gist.github.com\/julio24048\/c23b6bb61ff2551450c6d5359791f0fc.js\"><\/script><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-5f12dfc elementor-align-center button-principale elementor-widget elementor-widget-button\" data-id=\"5f12dfc\" data-element_type=\"widget\" data-widget_type=\"button.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-button-wrapper\">\n\t\t\t<a class=\"elementor-button elementor-button-link elementor-size-sm elementor-animation-grow\" href=\"https:\/\/datascientest.com\/en\/data-scientist-course\">\n\t\t\t\t\t\t<span class=\"elementor-button-content-wrapper\">\n\t\t\t\t\t\t<span class=\"elementor-button-text\">Training in Data Science<\/span>\n\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-960bb3c e-flex e-con-boxed e-con\" data-id=\"960bb3c\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-dbbb70c elementor-widget elementor-widget-heading\" data-id=\"dbbb70c\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-xl\">Selection and Creation of the Next Generation<\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-9dd579a elementor-widget elementor-widget-text-editor\" data-id=\"9dd579a\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">At this stage, two strategies are available: <\/span><b>Elitism or fusion<\/b><span style=\"font-weight: 400;\">. In both scenarios, the aim is to develop a new generation that matches the previous generation in terms of the number of individuals.<\/span><\/p><p><span style=\"font-weight: 400;\">With <\/span><b>elitism<\/b><span style=\"font-weight: 400;\">, evaluation occurs first, and the genomes of the most highly-rated individuals are directly reused for the subsequent generation. The remainder of the population is filled with <\/span><b>individuals generated through crossover<\/b><span style=\"font-weight: 400;\"> (as in sexual reproduction) or mutations.<\/span><\/p><p><span style=\"font-weight: 400;\">In <\/span><b>fusion<\/b><span style=\"font-weight: 400;\">, the new generation (equivalent in number to the previous one) is created first via crossover and mutations. Selection is then applied to retain only <\/span><b>the highest evaluated individuals<\/b><span style=\"font-weight: 400;\"> up to the previous generation&#8217;s numbers.<\/span><\/p><p><span style=\"font-weight: 400;\">For my project, I chose the elitist system, adhering to the old saying that you don&#8217;t change a winning team. More seriously, each system offers its own pros and cons. While fusion can expand genetic diversity among individuals, elitism can preserve the best-adapted individuals. This quality persuaded me to choose elitism. For the cohort, I selected 20% of the best individuals in the population as the elite to guide the next generation. Generally, the proportion of elites ranges between 5% and 20%; I opted for the higher range.<\/span><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-41c1560 elementor-widget elementor-widget-image\" data-id=\"41c1560\" data-element_type=\"widget\" data-widget_type=\"image.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t\t\t\t<figure class=\"wp-caption\">\n\t\t\t\t\t\t\t\t\t\t<img decoding=\"async\" width=\"716\" height=\"409\" src=\"https:\/\/datascientest.com\/en\/files\/2025\/07\/image5.png\" class=\"attachment-full size-full wp-image-198112\" alt=\"\" srcset=\"https:\/\/datascientest.com\/en\/files\/2025\/07\/image5.png 716w, https:\/\/datascientest.com\/en\/files\/2025\/07\/image5-300x171.png 300w\" sizes=\"(max-width: 716px) 100vw, 716px\" \/>\t\t\t\t\t\t\t\t\t\t\t<figcaption class=\"widget-image-caption wp-caption-text\">Elitisme vs fusion<\/figcaption>\n\t\t\t\t\t\t\t\t\t\t<\/figure>\n\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-dd5d060 elementor-align-center button-principale elementor-widget elementor-widget-button\" data-id=\"dd5d060\" data-element_type=\"widget\" data-widget_type=\"button.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-button-wrapper\">\n\t\t\t<a class=\"elementor-button elementor-button-link elementor-size-sm elementor-animation-grow\" href=\"https:\/\/datascientest.com\/en\/data-analyst-course\">\n\t\t\t\t\t\t<span class=\"elementor-button-content-wrapper\">\n\t\t\t\t\t\t<span class=\"elementor-button-text\">Training in Data Analysis<\/span>\n\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-a0a91c8 e-flex e-con-boxed e-con\" data-id=\"a0a91c8\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-e5ed5cf elementor-widget elementor-widget-heading\" data-id=\"e5ed5cf\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-xl\">Crossover and Mutation<\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-a8e657d elementor-widget elementor-widget-text-editor\" data-id=\"a8e657d\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">These natural processes enable the <\/span><b>creation of new individuals<\/b><span style=\"font-weight: 400;\"> whose <\/span><b>distinctive genome traits<\/b><span style=\"font-weight: 400;\"> might better adapt them to their environment. Being better adapted, these individuals will have <\/span><b>a higher probability of survival<\/b><span style=\"font-weight: 400;\">, hence reproduce and pass on their genes.<\/span><\/p><p><span style=\"font-weight: 400;\">In genetic algorithms, the concept is similar. <\/span><b>The top-evaluated individuals are selected for the subsequent generation<\/b><span style=\"font-weight: 400;\"> and in turn have a greater chance of propagating their traits.<\/span><\/p><p><span style=\"font-weight: 400;\">Crossover recreates the mechanics of sexual reproduction. Genes from both parents are blended to form a new, unique genome.<\/span><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-3bd294e elementor-widget elementor-widget-image\" data-id=\"3bd294e\" data-element_type=\"widget\" data-widget_type=\"image.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<img decoding=\"async\" width=\"800\" height=\"305\" src=\"https:\/\/datascientest.com\/en\/files\/2025\/07\/image2.png\" class=\"attachment-full size-full wp-image-198113\" alt=\"\" srcset=\"https:\/\/datascientest.com\/en\/files\/2025\/07\/image2.png 800w, https:\/\/datascientest.com\/en\/files\/2025\/07\/image2-300x114.png 300w, https:\/\/datascientest.com\/en\/files\/2025\/07\/image2-768x293.png 768w\" sizes=\"(max-width: 800px) 100vw, 800px\" \/>\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-e9c63cf elementor-widget elementor-widget-text-editor\" data-id=\"e9c63cf\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">In some models, the suggestion is to combine genomes segment by segment (by halves or gene pairs). For my approach, I favored a method more akin to nature, handling it gene by gene.<\/span><\/p><p><span style=\"font-weight: 400;\">In my setup, the crossover function for individuals is combined with a small degree of mutation. Theoretically, at any point, selection happens only between the genes of each parent. With this system, the same city could end up appearing twice in the same route, which is undesirable. Therefore, I added a restriction to prevent this scenario.<\/span><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-1f38439 elementor-widget elementor-widget-shortcode\" data-id=\"1f38439\" data-element_type=\"widget\" data-widget_type=\"shortcode.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-shortcode\"><script src=\"https:\/\/gist.github.com\/julio24048\/9145d44dc1d989dde41c940f98a9c291.js\"><\/script><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-58333d5 elementor-align-center button-principale elementor-widget elementor-widget-button\" data-id=\"58333d5\" data-element_type=\"widget\" data-widget_type=\"button.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-button-wrapper\">\n\t\t\t<a class=\"elementor-button elementor-button-link elementor-size-sm elementor-animation-grow\" href=\"https:\/\/datascientest.com\/en\/data-scientist-course\">\n\t\t\t\t\t\t<span class=\"elementor-button-content-wrapper\">\n\t\t\t\t\t\t<span class=\"elementor-button-text\">Mastering data science<\/span>\n\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-48ba141 elementor-widget elementor-widget-text-editor\" data-id=\"48ba141\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">In nature, there are also <\/span><b>mutation processes<\/b><span style=\"font-weight: 400;\"> where an individual&#8217;s genome changes independently of any <\/span><b>reproductive process<\/b><span style=\"font-weight: 400;\">. This mechanism enhances <\/span><b>genetic diversity<\/b><span style=\"font-weight: 400;\"> by introducing novel genetic solutions.<\/span><\/p><p><span style=\"font-weight: 400;\">Three mutation possibilities may occur.<\/span><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-5375568 elementor-widget elementor-widget-heading\" data-id=\"5375568\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Insertion: a gene moves to insert after another<\/h3>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-d60dc19 elementor-widget elementor-widget-image\" data-id=\"d60dc19\" data-element_type=\"widget\" data-widget_type=\"image.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<img decoding=\"async\" width=\"800\" height=\"307\" src=\"https:\/\/datascientest.com\/en\/files\/2025\/07\/image7.png\" class=\"attachment-full size-full wp-image-198114\" alt=\"\" srcset=\"https:\/\/datascientest.com\/en\/files\/2025\/07\/image7.png 800w, https:\/\/datascientest.com\/en\/files\/2025\/07\/image7-300x115.png 300w, https:\/\/datascientest.com\/en\/files\/2025\/07\/image7-768x295.png 768w\" sizes=\"(max-width: 800px) 100vw, 800px\" \/>\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-556e71a elementor-widget elementor-widget-heading\" data-id=\"556e71a\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Permutation (or swap): two genes exchange their positions<\/h3>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-d56a32a elementor-widget elementor-widget-image\" data-id=\"d56a32a\" data-element_type=\"widget\" data-widget_type=\"image.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<img decoding=\"async\" width=\"800\" height=\"303\" src=\"https:\/\/datascientest.com\/en\/files\/2025\/07\/image1.png\" class=\"attachment-full size-full wp-image-198115\" alt=\"\" srcset=\"https:\/\/datascientest.com\/en\/files\/2025\/07\/image1.png 800w, https:\/\/datascientest.com\/en\/files\/2025\/07\/image1-300x114.png 300w, https:\/\/datascientest.com\/en\/files\/2025\/07\/image1-768x291.png 768w\" sizes=\"(max-width: 800px) 100vw, 800px\" \/>\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-d89cecb elementor-widget elementor-widget-heading\" data-id=\"d89cecb\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Sequence inversion: the order of part of the genome is reversed<\/h3>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-ff565de elementor-widget elementor-widget-image\" data-id=\"ff565de\" data-element_type=\"widget\" data-widget_type=\"image.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<img decoding=\"async\" width=\"800\" height=\"312\" src=\"https:\/\/datascientest.com\/en\/files\/2025\/07\/image3.png\" class=\"attachment-full size-full wp-image-198116\" alt=\"\" srcset=\"https:\/\/datascientest.com\/en\/files\/2025\/07\/image3.png 800w, https:\/\/datascientest.com\/en\/files\/2025\/07\/image3-300x117.png 300w, https:\/\/datascientest.com\/en\/files\/2025\/07\/image3-768x300.png 768w\" sizes=\"(max-width: 800px) 100vw, 800px\" \/>\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-3fda203 elementor-widget elementor-widget-text-editor\" data-id=\"3fda203\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">The percentage of mutations typically comprises 5% of new individuals, though I have observed mutation rates reach up to 10%. Since the <\/span><b>elitist system<\/b><span style=\"font-weight: 400;\"> tends to diminish genetic diversity, I maintained this 10% figure as a form of balance.<\/span><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-5b35b93 elementor-widget elementor-widget-shortcode\" data-id=\"5b35b93\" data-element_type=\"widget\" data-widget_type=\"shortcode.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-shortcode\"><script src=\"https:\/\/gist.github.com\/julio24048\/4ef3f7d2874b1f6266b1ca4f06da42a8.js\"><\/script><\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-8770e3c elementor-align-center button-principale elementor-widget elementor-widget-button\" data-id=\"8770e3c\" data-element_type=\"widget\" data-widget_type=\"button.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-button-wrapper\">\n\t\t\t<a class=\"elementor-button elementor-button-link elementor-size-sm elementor-animation-grow\" href=\"https:\/\/datascientest.com\/en\/data-courses\">\n\t\t\t\t\t\t<span class=\"elementor-button-content-wrapper\">\n\t\t\t\t\t\t<span class=\"elementor-button-text\">Learn all about data science<\/span>\n\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-1b6e64c e-flex e-con-boxed e-con\" data-id=\"1b6e64c\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-dd02107 elementor-widget elementor-widget-heading\" data-id=\"dd02107\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-xl\">Iteration of the Process and Solution<\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-6d11455 elementor-widget elementor-widget-text-editor\" data-id=\"6d11455\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">By repeating <\/span><b>the process of selecting and building new generations<\/b><span style=\"font-weight: 400;\">, we gradually produce individuals whose attributes are increasingly better suited to resolving the problem at hand.<\/span><\/p><p><span style=\"font-weight: 400;\">The dilemma arises as to when the process should be halted. This depends on our constraints.<\/span><\/p><p><span style=\"font-weight: 400;\">If time is limited, iterations can be stopped after a set duration. Alternatively, we might aim to attain a threshold tied to a criterion (an optimal distance for our journey, for instance, or ensuring each city visited has a minimum number of points of interest). In a trial mode, iterations can be conducted repeatedly, analyzing when iterations no longer yield <\/span><b>significant improvement<\/b><span style=\"font-weight: 400;\">. A cap on the number of iterations can then be defined.<\/span><\/p><p><span style=\"font-weight: 400;\">For this exercise, to avoid overly long computation times, I settled on 200 iterations.<\/span><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-84d766b e-flex e-con-boxed e-con\" data-id=\"84d766b\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-6e0624b elementor-widget elementor-widget-heading\" data-id=\"6e0624b\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-xl\">Conclusion<\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-39443ba elementor-widget elementor-widget-text-editor\" data-id=\"39443ba\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">As with many areas, nature once again proves to be a rich source of inspiration. This straightforward example illustrates how <\/span><b>complex issues can be optimized by drawing insights from natural solutions<\/b><span style=\"font-weight: 400;\"> that have evolved over hundreds of millions of years.<\/span><\/p><p><span style=\"font-weight: 400;\">Ultimately, after 200 iterations, I established the following itinerary:<\/span><\/p><p><i><span style=\"font-weight: 400;\">Glux-en-Glenne, Roussillon-en-Morvan, Alligny-en-Morvan, Anost, Quarr\u00e9-les-Tombes, Saint-L\u00e9ger-Vauban, Avallon, V\u00e9zelay, Bazoches, Pierre-Perthuis\u2026 <\/span><\/i><span style=\"font-weight: 400;\">totaling 154 km and incorporating 115 points of interest along the way.<\/span><\/p><p><span style=\"font-weight: 400;\">By increasing the number of iterations, I could have further refined the solution, but the primary aim of this script is more educational rather than performance-driven. I aimed to avoid excessively extending the computational execution times.<\/span><\/p><p><span style=\"font-weight: 400;\">For reference, utilizing <\/span><a href=\"https:\/\/datascientest.com\/en\/pandas-the-python-library\"><span style=\"font-weight: 400;\">Pandas dataframes<\/span><\/a><span style=\"font-weight: 400;\"> isn&#8217;t optimal for performance, but again, the core objective of this script is explanatory.<\/span><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-44e0cc2 elementor-align-center button-principale elementor-widget elementor-widget-button\" data-id=\"44e0cc2\" data-element_type=\"widget\" data-widget_type=\"button.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-button-wrapper\">\n\t\t\t<a class=\"elementor-button elementor-button-link elementor-size-sm elementor-animation-grow\" href=\"https:\/\/datascientest.com\/en\/data-courses\">\n\t\t\t\t\t\t<span class=\"elementor-button-content-wrapper\">\n\t\t\t\t\t\t<span class=\"elementor-button-text\">Start your data science training<\/span>\n\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-5e1f744 elementor-widget elementor-widget-text-editor\" data-id=\"5e1f744\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">You can view my complete code on my <\/span><a href=\"https:\/\/github.com\/julio24048\/meileuritineraire\"><span style=\"font-weight: 400;\">Git repo<\/span><\/a><span style=\"font-weight: 400;\">.<\/span><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-558b9fb e-flex e-con-boxed e-con\" data-id=\"558b9fb\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-ba0e8d4 elementor-widget elementor-widget-html\" data-id=\"ba0e8d4\" data-element_type=\"widget\" data-widget_type=\"html.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<script type=\"application\/ld+json\">\r\n{\r\n  \"@context\": \"https:\/\/schema.org\",\r\n  \"@type\": \"FAQPage\",\r\n  \"mainEntity\": [\r\n    {\r\n      \"@type\": \"Question\",\r\n      \"name\": \"What is No Code?\",\r\n      \"acceptedAnswer\": {\r\n        \"@type\": \"Answer\",\r\n        \"text\": \"Optimization algorithms are designed to find an optimal (or ideally the best) solution to a problem, according to specific criteria or objectives.\"\r\n      }\r\n    },\r\n    {\r\n      \"@type\": \"Question\",\r\n      \"name\": \"The Data\",\r\n      \"acceptedAnswer\": {\r\n        \"@type\": \"Answer\",\r\n        \"text\": \"Historical points of interest were sourced from OpenStreetMap, and hotel locations and town coordinates came from French government data.\"\r\n      }\r\n    },\r\n    {\r\n      \"@type\": \"Question\",\r\n      \"name\": \"Creating the Initial Population\",\r\n      \"acceptedAnswer\": {\r\n        \"@type\": \"Answer\",\r\n        \"text\": \"An initial population of 1500 individuals was generated with genomes built from INSEE codes of municipalities in the Morvan park.\"\r\n      }\r\n    },\r\n    {\r\n      \"@type\": \"Question\",\r\n      \"name\": \"Evaluating Individuals\",\r\n      \"acceptedAnswer\": {\r\n        \"@type\": \"Answer\",\r\n        \"text\": \"The two evaluation criteria are the total distance traveled and the total number of points of interest on the route.\"\r\n      }\r\n    },\r\n    {\r\n      \"@type\": \"Question\",\r\n      \"name\": \"Selection and Creation of the Next Generation\",\r\n      \"acceptedAnswer\": {\r\n        \"@type\": \"Answer\",\r\n        \"text\": \"The elitist method was used, keeping 20% of the best individuals to guide the next generation.\"\r\n      }\r\n    },\r\n    {\r\n      \"@type\": \"Question\",\r\n      \"name\": \"Crossover and Mutation\",\r\n      \"acceptedAnswer\": {\r\n        \"@type\": \"Answer\",\r\n        \"text\": \"New individuals are generated through gene-by-gene crossover and three mutation types: insertion, permutation, and inversion.\"\r\n      }\r\n    },\r\n    {\r\n      \"@type\": \"Question\",\r\n      \"name\": \"Iteration of the Process and Solution\",\r\n      \"acceptedAnswer\": {\r\n        \"@type\": \"Answer\",\r\n        \"text\": \"The process was run for 200 iterations, with the final route including 10 towns and 115 points of interest over 154 km.\"\r\n      }\r\n    }\r\n  ]\r\n}\r\n<\/script>\r\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"<p>As their name suggests, optimization algorithms are designed to find an optimal (or ideally the best) solution to a problem, according to specific criteria or objectives. Among the many optimization algorithms available, some are inspired by nature: these are known as biomimetic algorithms. They may draw from the collective intelligence of insects (swarm optimization) or [&hellip;]<\/p>\n","protected":false},"author":45,"featured_media":198110,"comment_status":"open","ping_status":"open","sticky":false,"template":"elementor_theme","format":"standard","meta":{"content-type":"","inline_featured_image":false},"categories":[46],"tags":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v21.7 (Yoast SEO v21.7) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Optimizing a tourist route with a genetic algorithm: use case in the Morvan<\/title>\n<meta name=\"description\" content=\"Discover how a genetic algorithm can optimize a tourist route in the Morvan region by combining points of interest, distances, and accommodation constraints.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms\" \/>\n<meta property=\"og:locale\" content=\"en_GB\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Optimizing a tourist route with a genetic algorithm: use case in the Morvan\" \/>\n<meta property=\"og:description\" content=\"As their name suggests, optimization algorithms are designed to find an optimal (or ideally the best) solution to a problem, according to specific\" \/>\n<meta property=\"og:url\" content=\"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms\" \/>\n<meta property=\"og:site_name\" content=\"DataScientest\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/DataScientestEN\" \/>\n<meta property=\"article:published_time\" content=\"2025-10-10T05:08:00+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-09-23T17:09:00+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/datascientest.com\/en\/files\/2025\/07\/travel-planning-datascientest.png\" \/>\n\t<meta property=\"og:image:width\" content=\"768\" \/>\n\t<meta property=\"og:image:height\" content=\"512\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"author\" content=\"Daniel\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@DataScientest__\" \/>\n<meta name=\"twitter:site\" content=\"@DataScientest__\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Daniel\" \/>\n\t<meta name=\"twitter:label2\" content=\"Estimated reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"8 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms#article\",\"isPartOf\":{\"@id\":\"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms\"},\"author\":{\"name\":\"Daniel\",\"@id\":\"https:\/\/datascientest.com\/en\/#\/schema\/person\/5a86e30c5090234fb43dd8baa83c44b0\"},\"headline\":\"Optimizing a tourist route with a genetic algorithm: use case in the Morvan\",\"datePublished\":\"2025-10-10T05:08:00+00:00\",\"dateModified\":\"2025-09-23T17:09:00+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms\"},\"wordCount\":1376,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/datascientest.com\/en\/#organization\"},\"articleSection\":[\"Non class\u00e9\"],\"inLanguage\":\"en-GB\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms#respond\"]}],\"copyrightYear\":\"2025\",\"copyrightHolder\":{\"@id\":\"https:\/\/datascientest.com\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms\",\"url\":\"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms\",\"name\":\"Optimizing a tourist route with a genetic algorithm: use case in the Morvan\",\"isPartOf\":{\"@id\":\"https:\/\/datascientest.com\/en\/#website\"},\"datePublished\":\"2025-10-10T05:08:00+00:00\",\"dateModified\":\"2025-09-23T17:09:00+00:00\",\"description\":\"Discover how a genetic algorithm can optimize a tourist route in the Morvan region by combining points of interest, distances, and accommodation constraints.\",\"inLanguage\":\"en-GB\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms\"]}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/datascientest.com\/en\/#website\",\"url\":\"https:\/\/datascientest.com\/en\/\",\"name\":\"DataScientest\",\"description\":\"Leader in Data Science Courses\",\"publisher\":{\"@id\":\"https:\/\/datascientest.com\/en\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/datascientest.com\/en\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-GB\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/datascientest.com\/en\/#organization\",\"name\":\"DataScientest\",\"url\":\"https:\/\/datascientest.com\/en\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-GB\",\"@id\":\"https:\/\/datascientest.com\/en\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/datascientest.com\/en\/wp-content\/blogs.dir\/9\/files\/2024\/02\/DataScientest_icon_blue-2.png\",\"contentUrl\":\"https:\/\/datascientest.com\/en\/wp-content\/blogs.dir\/9\/files\/2024\/02\/DataScientest_icon_blue-2.png\",\"width\":301,\"height\":301,\"caption\":\"DataScientest\"},\"image\":{\"@id\":\"https:\/\/datascientest.com\/en\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/DataScientestEN\",\"https:\/\/twitter.com\/DataScientest__\",\"https:\/\/www.linkedin.com\/school\/datascientest\/mycompany\/\",\"https:\/\/www.tiktok.com\/@datascientest\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/datascientest.com\/en\/#\/schema\/person\/5a86e30c5090234fb43dd8baa83c44b0\",\"name\":\"Daniel\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-GB\",\"@id\":\"https:\/\/datascientest.com\/en\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/837acad4f2dc47e85d81cce837261670?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/837acad4f2dc47e85d81cce837261670?s=96&d=mm&r=g\",\"caption\":\"Daniel\"},\"sameAs\":[\"https:\/\/www.linkedin.com\/school\/datascientest\/\",\"user\"],\"jobTitle\":\"ing\u00e9nieur logiciel\",\"worksFor\":\"DataScientest\",\"url\":\"https:\/\/datascientest.com\/en\/author\/team-redac\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"Optimizing a tourist route with a genetic algorithm: use case in the Morvan","description":"Discover how a genetic algorithm can optimize a tourist route in the Morvan region by combining points of interest, distances, and accommodation constraints.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms","og_locale":"en_GB","og_type":"article","og_title":"Optimizing a tourist route with a genetic algorithm: use case in the Morvan","og_description":"As their name suggests, optimization algorithms are designed to find an optimal (or ideally the best) solution to a problem, according to specific","og_url":"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms","og_site_name":"DataScientest","article_publisher":"https:\/\/www.facebook.com\/DataScientestEN","article_published_time":"2025-10-10T05:08:00+00:00","article_modified_time":"2025-09-23T17:09:00+00:00","og_image":[{"width":768,"height":512,"url":"https:\/\/datascientest.com\/en\/files\/2025\/07\/travel-planning-datascientest.png","type":"image\/png"}],"author":"Daniel","twitter_card":"summary_large_image","twitter_creator":"@DataScientest__","twitter_site":"@DataScientest__","twitter_misc":{"Written by":"Daniel","Estimated reading time":"8 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms#article","isPartOf":{"@id":"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms"},"author":{"name":"Daniel","@id":"https:\/\/datascientest.com\/en\/#\/schema\/person\/5a86e30c5090234fb43dd8baa83c44b0"},"headline":"Optimizing a tourist route with a genetic algorithm: use case in the Morvan","datePublished":"2025-10-10T05:08:00+00:00","dateModified":"2025-09-23T17:09:00+00:00","mainEntityOfPage":{"@id":"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms"},"wordCount":1376,"commentCount":0,"publisher":{"@id":"https:\/\/datascientest.com\/en\/#organization"},"articleSection":["Non class\u00e9"],"inLanguage":"en-GB","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/datascientest.com\/en\/all-about-genetic-algorithms#respond"]}],"copyrightYear":"2025","copyrightHolder":{"@id":"https:\/\/datascientest.com\/#organization"}},{"@type":"WebPage","@id":"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms","url":"https:\/\/datascientest.com\/en\/all-about-genetic-algorithms","name":"Optimizing a tourist route with a genetic algorithm: use case in the Morvan","isPartOf":{"@id":"https:\/\/datascientest.com\/en\/#website"},"datePublished":"2025-10-10T05:08:00+00:00","dateModified":"2025-09-23T17:09:00+00:00","description":"Discover how a genetic algorithm can optimize a tourist route in the Morvan region by combining points of interest, distances, and accommodation constraints.","inLanguage":"en-GB","potentialAction":[{"@type":"ReadAction","target":["https:\/\/datascientest.com\/en\/all-about-genetic-algorithms"]}]},{"@type":"WebSite","@id":"https:\/\/datascientest.com\/en\/#website","url":"https:\/\/datascientest.com\/en\/","name":"DataScientest","description":"Leader in Data Science Courses","publisher":{"@id":"https:\/\/datascientest.com\/en\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/datascientest.com\/en\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-GB"},{"@type":"Organization","@id":"https:\/\/datascientest.com\/en\/#organization","name":"DataScientest","url":"https:\/\/datascientest.com\/en\/","logo":{"@type":"ImageObject","inLanguage":"en-GB","@id":"https:\/\/datascientest.com\/en\/#\/schema\/logo\/image\/","url":"https:\/\/datascientest.com\/en\/wp-content\/blogs.dir\/9\/files\/2024\/02\/DataScientest_icon_blue-2.png","contentUrl":"https:\/\/datascientest.com\/en\/wp-content\/blogs.dir\/9\/files\/2024\/02\/DataScientest_icon_blue-2.png","width":301,"height":301,"caption":"DataScientest"},"image":{"@id":"https:\/\/datascientest.com\/en\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/DataScientestEN","https:\/\/twitter.com\/DataScientest__","https:\/\/www.linkedin.com\/school\/datascientest\/mycompany\/","https:\/\/www.tiktok.com\/@datascientest"]},{"@type":"Person","@id":"https:\/\/datascientest.com\/en\/#\/schema\/person\/5a86e30c5090234fb43dd8baa83c44b0","name":"Daniel","image":{"@type":"ImageObject","inLanguage":"en-GB","@id":"https:\/\/datascientest.com\/en\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/837acad4f2dc47e85d81cce837261670?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/837acad4f2dc47e85d81cce837261670?s=96&d=mm&r=g","caption":"Daniel"},"sameAs":["https:\/\/www.linkedin.com\/school\/datascientest\/","user"],"jobTitle":"ing\u00e9nieur logiciel","worksFor":"DataScientest","url":"https:\/\/datascientest.com\/en\/author\/team-redac"}]}},"_links":{"self":[{"href":"https:\/\/datascientest.com\/en\/wp-json\/wp\/v2\/posts\/198108"}],"collection":[{"href":"https:\/\/datascientest.com\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/datascientest.com\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/datascientest.com\/en\/wp-json\/wp\/v2\/users\/45"}],"replies":[{"embeddable":true,"href":"https:\/\/datascientest.com\/en\/wp-json\/wp\/v2\/comments?post=198108"}],"version-history":[{"count":12,"href":"https:\/\/datascientest.com\/en\/wp-json\/wp\/v2\/posts\/198108\/revisions"}],"predecessor-version":[{"id":199391,"href":"https:\/\/datascientest.com\/en\/wp-json\/wp\/v2\/posts\/198108\/revisions\/199391"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/datascientest.com\/en\/wp-json\/wp\/v2\/media\/198110"}],"wp:attachment":[{"href":"https:\/\/datascientest.com\/en\/wp-json\/wp\/v2\/media?parent=198108"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/datascientest.com\/en\/wp-json\/wp\/v2\/categories?post=198108"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/datascientest.com\/en\/wp-json\/wp\/v2\/tags?post=198108"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}