Filters








1,000 Hits in 9.1 sec

Nature-Inspired Metaheuristic Techniques for Combinatorial Optimization Problems: Overview and Recent Advances

Md Ashikur Rahman, Rajalingam Sokkalingam, Mahmod Othman, Kallol Biswas, Lazim Abdullah, Evizal Abdul Kadir
<span title="2021-10-19">2021</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ye33srllvnanjouxn4tmrfgjsq" style="color: black;">Mathematics</a> </i> &nbsp;
as vehicle routing problems, traveling salesman problems, and supply chain network design problems.  ...  As there is a growing interest in incorporating necessary methods to develop metaheuristics, there is a need to rediscover the recent advancement of metaheuristics in combinatorial optimization.  ...  Acknowledgments: The authors would like to thank the Center of Graduate Studies of Universiti Teknologi PETRONAS and the YUTP research fund (015LCO-296) for the funding of this research.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/math9202633">doi:10.3390/math9202633</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tk2ymswg4fau3bpx2kxmcmmyoi">fatcat:tk2ymswg4fau3bpx2kxmcmmyoi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20211028012946/https://mdpi-res.com/d_attachment/mathematics/mathematics-09-02633/article_deploy/mathematics-09-02633-v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/67/48/674823a8296dfaf2df839355fb90a65669894170.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/math9202633"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Evolutionary multiobjective combinatorial optimization (EMCO)

Rajeev Kumar
<span title="">2008</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fdhfwmjdwjbvxo6zc7cdt5hi7q" style="color: black;">Proceedings of the 2008 GECCO conference companion on Genetic and evolutionary computation - GECCO &#39;08</a> </i> &nbsp;
Since the problem is hard, most researchers have hybridized the evolutionary methods with local search heuristics to obtain good results. 45 Traveling Salesman Problem . . .  ...  In the literature, we did not come across any solution of biobjective TSP using Pareto-ranking based Multi-Objective Evolutionary Algorithm (MOEA) hybridized with local search. 50 Traveling Salesman Problem  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1388969.1389079">doi:10.1145/1388969.1389079</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/gecco/Kumar08.html">dblp:conf/gecco/Kumar08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/acsog2ea35eijaww2ai7ozm4qi">fatcat:acsog2ea35eijaww2ai7ozm4qi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811214008/http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p3366.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fe/cf/fecf7f8dd75b1049ba312cae812f0bdfb22db90f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1388969.1389079"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Lifting the Performance of a Heuristic for the Time-Dependent Travelling Salesman Problem through Machine Learning

Gianpaolo Ghiani, Tommaso Adamo, Pierpaolo Greco, Emanuela Guerriero
<span title="2020-12-14">2020</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/63zsvf7vxzfznojpqgfvpyk2lu" style="color: black;">Algorithms</a> </i> &nbsp;
Along this line of research, the present paper shows how supervised and unsupervised techniques can be used to improve the quality of the solutions generated by a heuristic for the Time-Dependent Travelling  ...  In recent years, there have been several attempts to use machine learning techniques to improve the performance of exact and approximate optimization algorithms.  ...  The authors also thank Federico Liquori and Marco D'Amato for their help with programming. Conflicts of Interest: The authors declare no conflict of interest.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/a13120340">doi:10.3390/a13120340</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bibypg24w5hixmubgrovcqc2p4">fatcat:bibypg24w5hixmubgrovcqc2p4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201218192137/https://res.mdpi.com/d_attachment/algorithms/algorithms-13-00340/article_deploy/algorithms-13-00340.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/44/d0/44d0d80e8d631d4bb221fb41de62419e8636acf1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/a13120340"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

A Multi-objective Version of the Lin-Kernighan Heuristic for the Traveling Salesman Problem

Emerson Bezerra De Carvalho, Elizabeth Ferreira Gouvêa Goldbarg, Marco Cesar Goldbarg
<span title="2018-02-18">2018</span> <i title="Universidade Federal do Rio Grande do Sul"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ymnupu7idvhmrhqmaciag4jtea" style="color: black;">Revista de Informática Teórica e Aplicada</a> </i> &nbsp;
The Lin and Kernighan's algorithm for the single objective Traveling Salesman Problem (TSP) is one of the most efficient heuristics for the symmetric case.  ...  Although many algorithms for the TSP were extended to the multi-objective version of the problem (MTSP), the Lin and Kernighan's algorithm was still not fully explored.  ...  Acknowledgements The research reported in this paper was partially supported by CAPES, Coordenação de Aperfeiçoamento de Pessoal de Nível Superior, and CNPq, Conselho Nacional de Desenvolvimento Científico  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.22456/2175-2745.76452">doi:10.22456/2175-2745.76452</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lnkaaax5lra6vjiab3ehqeds5m">fatcat:lnkaaax5lra6vjiab3ehqeds5m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180502232345/http://seer.ufrgs.br/index.php/rita/article/download/RITA_VOL25_NR1_48/pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a8/3f/a83f4ee5578093393d548ad2e08c5aa0f9ab777b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.22456/2175-2745.76452"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Improved discrete plant propagation algorithm for solving the traveling salesman problem

Hussein Fouad Almazini, Salah Mortada, Hassan Fouad Abbas Al-Mazini, Hayder Naser Khraibet AL-Behadili, Jawad Alkenani
<span title="2022-03-01">2022</span> <i title="Institute of Advanced Engineering and Science"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3egptraynbg7xelu7qh6lwtd6i" style="color: black;">IAES International Journal of Artificial Intelligence (IJ-AI)</a> </i> &nbsp;
The primary goal of traveling salesman problem (TSP) is for a salesman to visit many cities and return to the starting city via a sequence of potential shortest paths.  ...  Although PPA is claimed to be successful, it suffers from the slow convergence problem, which significantly impedes its applicability for getting good solution.  ...  Nonetheless, several methods have been used in the proposed algorithm which affects to take additional time to get the best improvement.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.11591/ijai.v11.i1.pp13-22">doi:10.11591/ijai.v11.i1.pp13-22</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/azi3qkfpqfhpbif7ag7icfgs2i">fatcat:azi3qkfpqfhpbif7ag7icfgs2i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220127092107/http://ijai.iaescore.com/index.php/IJAI/article/download/20867/13272" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c8/6c/c86cf0006c0c184006e493457cc99097db9d5499.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.11591/ijai.v11.i1.pp13-22"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Smart Solution for STSP Semantic Traveling Salesman Problem via Hybrid Ant Colony System with Genetic Algorithm

Eman Elsayed, Al-Azhar University (Girls Branch), Asmaa Omar, Khadija Elsayed, Al-Azhar University (Girls Branch), Al-Azhar University (Girls Branch)
<span title="2020-10-31">2020</span> <i title="The Intelligent Networks and Systems Society"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hxhhpqr6nrfs5eblsflinrd2wa" style="color: black;">International Journal of Intelligent Engineering and Systems</a> </i> &nbsp;
Travelling Salesman Problem (TSP) is one of the main and famous problems in finding the shortest path.  ...  That is to speed-up convergence and finds an effective path of a Semantic Travelling Salesman Problem STSP.  ...  Conflicts of Interest The authors declare no conflict of interest. Author Contributions Conceptualization, Eman K. Elsayed  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.22266/ijies2020.1031.42">doi:10.22266/ijies2020.1031.42</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b4ysps2tizeutlms6vipewfs64">fatcat:b4ysps2tizeutlms6vipewfs64</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200828094308/http://www.inass.org/2020/2020103142.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.22266/ijies2020.1031.42"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

DiverGene: Experiments on Controlling Population Diversity in Genetic Algorithm with a Dispersion Operator

Anna Strzeżek, Ludwik Trammer, Marcin Sydow
<span title="2015-10-11">2015</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zbznsfsymfchdlmdsmo2bglth4" style="color: black;">Proceedings of the 2015 Federated Conference on Computer Science and Information Systems</a> </i> &nbsp;
Genetic algorithm is one of the most known evolutionary algorithms for solving hard optimisation problems. Many attempts have been made to improve its convergence rate and quality of the result.  ...  The approach is implemented and tested on three hard optimisation problems: Knapsack Problem, Travelling Salesman Problem and a relatively new Travelling Thief Problem that might be viewed as the composition  ...  It would be also interesting to introduce the self-adaptation mechanism to our approach.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.15439/2015f411">doi:10.15439/2015f411</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/fedcsis/StrzezekTS15.html">dblp:conf/fedcsis/StrzezekTS15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vgcbskl4lbgljoouyvir37kyaa">fatcat:vgcbskl4lbgljoouyvir37kyaa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180424093821/https://annals-csis.org/Volume_5/pliks/411.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/55/ca/55ca5fb6bd28f896b9cfb29c36f210635cded8f7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.15439/2015f411"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

On parallel local search for permutations

Atle Riise, Edmund K Burke
<span title="">2015</span> <i title="Informa UK Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fq4jrflj6zesjk7f4nb4otuwwy" style="color: black;">Journal of the Operational Research Society</a> </i> &nbsp;
We also demonstrate how an exchange of good partial solutions between the incumbent and best found solutions improves the efficiency of the Iterated Local Search algorithm.  ...  Our experiments demonstrate a total speed-up of up to several hundred times compared to a classical, sequential best improvement search.  ...  This work is supported by the Research Council of Norway and the UK Engineering and Physical Sciences Research Council (EPSRC).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1057/jors.2014.29">doi:10.1057/jors.2014.29</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mue4mggn2rcaxpmj3rnabxlazu">fatcat:mue4mggn2rcaxpmj3rnabxlazu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170814000142/https://www.duo.uio.no/bitstream/handle/10852/48346/1697_Riise_paperII.pdf?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d5/fd/d5fdfca4fd0a92a3d7419f3f094555973723d658.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1057/jors.2014.29"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Hybridizing exact methods and metaheuristics: A taxonomy

L. Jourdan, M. Basseur, E.-G. Talbi
<span title="">2009</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2fqqu5s6wbgk5gcucpt3wqm3gy" style="color: black;">European Journal of Operational Research</a> </i> &nbsp;
In this paper, we propose to extend an existing taxonomy for hybrid methods involving heuristic approaches in order to consider cooperative schemes between exact methods and metaheuristics.  ...  First, we propose some natural approaches for the different schemes of cooperation encountered, and we analyse, for each model, some examples taken from the literature.  ...  ., propose different hybridizations between genetic algorithms and exact methods applied to the Travelling Salesman Problem (TSP) [45, 46] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ejor.2007.07.035">doi:10.1016/j.ejor.2007.07.035</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uq3aphcfqbgujf5idpcdqxd66i">fatcat:uq3aphcfqbgujf5idpcdqxd66i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808232115/http://www.info.univ-angers.fr/pub/basseur/papers/EJOR09.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c3/12/c31233681fe257a940292cd58ae8e7097695ca77.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ejor.2007.07.035"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Mapping of Real World Problems to Nature Inspired Algorithm using Goal based Classification and TRIZ [article]

Palak Sukharamwala, Manojkumar Parmar
<span title="2020-10-08">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
A novel method based on TRIZ to map the real-world problems to nature problems is explained here.TRIZ is a Theory of inventive problem solving.  ...  Using the proposed framework, best NIA can be identified to solve the real-world problems.  ...  The traditional methods of software programming and solutions are already proven inadequate to manage complexity [5] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2010.03795v1">arXiv:2010.03795v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jdqak4mdnffgvbznv4dfpwvzsi">fatcat:jdqak4mdnffgvbznv4dfpwvzsi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201021135039/https://arxiv.org/pdf/2010.03795v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7c/2d/7c2d1d91dfd547505e1fb1a8a8fe14eb394f7fe8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2010.03795v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches [chapter]

Rajesh Matai, Surya Singh, Murari Lal
<span title="2010-11-30">2010</span> <i title="InTech"> Traveling Salesman Problem, Theory and Applications </i> &nbsp;
Tour improvement After generating the tour using any tour construction heuristic, an improvment heuristic can be further applied to improve the quality of the tour generated.  ...  Simulated annealing Simulated Annealing (SA) has been successfully applied and adapted to give an approximate solutions for the TSP.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5772/12909">doi:10.5772/12909</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bshtupwnsrfvfdndndrrbgqwai">fatcat:bshtupwnsrfvfdndndrrbgqwai</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180727114303/https://api.intechopen.com/chapter/pdf-download/12736" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cc/27/cc27c6c4118c572f023acf7bf878ba4374c57f66.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5772/12909"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Reducing Efficiency of Connectivity-Splitting Attack on Newscast via Limited Gossip [chapter]

Jakub Muszyński, Sébastien Varrette, Pascal Bouvry
<span title="">2016</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The Traveling Thief Problem (TTP) is a recent benchmark that results from the combination of the Traveling Salesman Problem (TSP) and the Knapsack Problem (KP).  ...  An Evolutionary Approach to the Full Optimization of the Traveling Thief Problem Nuno Lourenço, Francisco B.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-31204-0_20">doi:10.1007/978-3-319-31204-0_20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/27rnwllk75cv5kncys2u7utreq">fatcat:27rnwllk75cv5kncys2u7utreq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721234210/http://www.evostar.org/2016/pdfs/EvoStarHandbook2016reduced.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/21/a4/21a48efe1ee8df4df78d82ddedb5178bfc0a81a2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-31204-0_20"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Putting Continuous Metaheuristics to Work in Binary Search Spaces

Broderick Crawford, Ricardo Soto, Gino Astorga, José García, Carlos Castro, Fernando Paredes
<span title="">2017</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/y3fh56bfunh5fgneywwba6d4ke" style="color: black;">Complexity</a> </i> &nbsp;
These algorithms must be adapted to solve binary problems. This paper surveys articles focused on the binarization of metaheuristics designed for continuous optimization.  ...  In the real world, there are a number of optimization problems whose search space is restricted to take binary values; however, there are many continuous metaheuristics with good results in continuous  ...  (ii) The goal is to efficiently explore the search space to find (quasi)optimal solutions. (iii) Metaheuristic algorithms are approximate and generally nondeterministic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2017/8404231">doi:10.1155/2017/8404231</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/33rjurqib5gifjkophd3nboyey">fatcat:33rjurqib5gifjkophd3nboyey</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190223053514/http://pdfs.semanticscholar.org/4299/a63d8408028234087b108ed3072ed460a77d.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/42/99/4299a63d8408028234087b108ed3072ed460a77d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2017/8404231"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

High Performance Immune Clonal Algorithm for Solving Large Scale TSP [chapter]

Fang Liu, Yutao Qi, Jingjing Ma, Maoguo Gong, Ronghua Shang, Yangyang Li, Licheng Jiao
<span title="2010-11-30">2010</span> <i title="InTech"> Traveling Salesman Problem, Theory and Applications </i> &nbsp;
The solution space of TSP problem increases rapidly as the size of the problem increases, as a result, traditional methods (such as the exhaustive method, dynamic programming, branch and bound, etc.) have  ...  Introduction Traveling Salesman Problem (TSP) is one of the most challenging combinatorial optimization problems.  ...  This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5772/13034">doi:10.5772/13034</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hpzuqvzlq5ce3kid3e2om6zcsm">fatcat:hpzuqvzlq5ce3kid3e2om6zcsm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180727120040/https://api.intechopen.com/chapter/pdf-download/12407" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f4/b7/f4b7aa78e3c7c3d3582ecb3629fce947cf51f6a1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5772/13034"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A Hybrid Water Flow-Like Algorithm and Variable Neighbourhood Search for Traveling Salesman Problem

Mohamed Rafique Othman, Zulaiha Ali Othman, Ayman Ibraheem Srour, Nor Samsiah Sani
<span title="2019-10-23">2019</span> <i title="Insight Society"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/micztizddff3zji5xocudzzx64" style="color: black;">International Journal on Advanced Science, Engineering and Information Technology</a> </i> &nbsp;
Various metaheuristic methods have been proposed earlier and applied for solving the Travelling Salesman Problem (TSP).  ...  Selected neighborhood structures obtained in pre-experiment are applied and generated randomly to intensify the initial solution achieved at an earlier stage of hybrid WFA-VNS.  ...  It is an efficient method for searching approximated solutions [20] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18517/ijaseit.9.5.7957">doi:10.18517/ijaseit.9.5.7957</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2v4cgficqvea5jw4f4zfsg7owa">fatcat:2v4cgficqvea5jw4f4zfsg7owa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191116032805/http://www.insightsociety.org/ojaseit/index.php/ijaseit/article/download/7957/2078" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c0/dd/c0dd6dd7150fd0bd9d27d30793d7f68f8936a42a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18517/ijaseit.9.5.7957"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 1,000 results