A novel memetic genetic algorithm for solving traveling salesman problem based on multi-parent crossover technique
In the present study, a Novel Memetic Genetic Algorithm (NMGA) is developed to solve the Traveling Salesman Problem (TSP). The proposed NMGA is the combination of Boltzmann probability selection and a multi-parent crossover technique with known random mutation. In the proposed multi-parent crossover...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Regional Association for Security and crisis management
2019-10-01
|
| Series: | Decision Making: Applications in Management and Engineering |
| Subjects: | |
| Online Access: | http://www.dmame.org/index.php/dmame/article/view/41 |
| _version_ | 1818150929698914304 |
|---|---|
| author | Arindam Roy Apurba Manna Samir Maity |
| author_facet | Arindam Roy Apurba Manna Samir Maity |
| author_sort | Arindam Roy |
| collection | DOAJ |
| description | In the present study, a Novel Memetic Genetic Algorithm (NMGA) is developed to solve the Traveling Salesman Problem (TSP). The proposed NMGA is the combination of Boltzmann probability selection and a multi-parent crossover technique with known random mutation. In the proposed multi-parent crossover parents and common crossing point are selected randomly. After comparing the cost/distance with the adjacent nodes (genes) of participated parents, two offspring’s are produced. To establish the efficiency of the developed algorithm standard benchmarks are solved from TSPLIB against classical genetic algorithm (GA) and the fruitfulness of the proposed algorithm is recognized. Some statistical test has been done and the parameters are studied. |
| first_indexed | 2024-12-11T13:30:44Z |
| format | Article |
| id | doaj.art-c02f71df56c641f3b9bdac057afbc78c |
| institution | Directory Open Access Journal |
| issn | 2560-6018 2620-0104 |
| language | English |
| last_indexed | 2024-12-11T13:30:44Z |
| publishDate | 2019-10-01 |
| publisher | Regional Association for Security and crisis management |
| record_format | Article |
| series | Decision Making: Applications in Management and Engineering |
| spelling | doaj.art-c02f71df56c641f3b9bdac057afbc78c2022-12-22T01:05:17ZengRegional Association for Security and crisis managementDecision Making: Applications in Management and Engineering2560-60182620-01042019-10-012210011141A novel memetic genetic algorithm for solving traveling salesman problem based on multi-parent crossover techniqueArindam Roy0Apurba Manna1Samir Maity2Deptartment of Computer Science, Prabhat Kumar College, Purba Medinipur, West Bengal, IndiaDeptartment of Computer Science, Prabhat Kumar College, Purba Medinipur, West Bengal, IndiaOperations Management Group, Indian Institute of Management, Kolkata, IndiaIn the present study, a Novel Memetic Genetic Algorithm (NMGA) is developed to solve the Traveling Salesman Problem (TSP). The proposed NMGA is the combination of Boltzmann probability selection and a multi-parent crossover technique with known random mutation. In the proposed multi-parent crossover parents and common crossing point are selected randomly. After comparing the cost/distance with the adjacent nodes (genes) of participated parents, two offspring’s are produced. To establish the efficiency of the developed algorithm standard benchmarks are solved from TSPLIB against classical genetic algorithm (GA) and the fruitfulness of the proposed algorithm is recognized. Some statistical test has been done and the parameters are studied.http://www.dmame.org/index.php/dmame/article/view/41TSP, Memetic GA, multi-parent crossover. |
| spellingShingle | Arindam Roy Apurba Manna Samir Maity A novel memetic genetic algorithm for solving traveling salesman problem based on multi-parent crossover technique Decision Making: Applications in Management and Engineering TSP, Memetic GA, multi-parent crossover. |
| title | A novel memetic genetic algorithm for solving traveling salesman problem based on multi-parent crossover technique |
| title_full | A novel memetic genetic algorithm for solving traveling salesman problem based on multi-parent crossover technique |
| title_fullStr | A novel memetic genetic algorithm for solving traveling salesman problem based on multi-parent crossover technique |
| title_full_unstemmed | A novel memetic genetic algorithm for solving traveling salesman problem based on multi-parent crossover technique |
| title_short | A novel memetic genetic algorithm for solving traveling salesman problem based on multi-parent crossover technique |
| title_sort | novel memetic genetic algorithm for solving traveling salesman problem based on multi parent crossover technique |
| topic | TSP, Memetic GA, multi-parent crossover. |
| url | http://www.dmame.org/index.php/dmame/article/view/41 |
| work_keys_str_mv | AT arindamroy anovelmemeticgeneticalgorithmforsolvingtravelingsalesmanproblembasedonmultiparentcrossovertechnique AT apurbamanna anovelmemeticgeneticalgorithmforsolvingtravelingsalesmanproblembasedonmultiparentcrossovertechnique AT samirmaity anovelmemeticgeneticalgorithmforsolvingtravelingsalesmanproblembasedonmultiparentcrossovertechnique AT arindamroy novelmemeticgeneticalgorithmforsolvingtravelingsalesmanproblembasedonmultiparentcrossovertechnique AT apurbamanna novelmemeticgeneticalgorithmforsolvingtravelingsalesmanproblembasedonmultiparentcrossovertechnique AT samirmaity novelmemeticgeneticalgorithmforsolvingtravelingsalesmanproblembasedonmultiparentcrossovertechnique |