Filters








1,159 Hits in 7.2 sec

On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem [chapter]

Denis Pankratov, Allan Borodin
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In the first part of the paper, we build on Mastrolilli and Gambardella's work [14] and present a worst-case analysis of tabu search for the MAX-k-SAT problem.  ...  Finally, on benchmark instances, it appears that simulated annealing and tabu search initialized with non oblivious local search outperform the other methods on most instances.  ...  Simulated Annealing We present a version of simulated annealing (SA) that appears in [17] and was found to work well for the satisfiability problem. a randomized algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-14186-7_19">doi:10.1007/978-3-642-14186-7_19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rcse7yohjfennnpepnx2vbkofe">fatcat:rcse7yohjfennnpepnx2vbkofe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150418014014/http://www.cs.toronto.edu:80/~bor/Papers/SAT-localsearch.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/78/59/7859810ffca5c6bdc4bb233c0973504ef69ec255.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-642-14186-7_19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Multi-atomic Annealing Heuristic for Static Dial-a-ride Problem [article]

Song Guang Ho, Ramesh Ramasamy Pandi, Sarat Chandra Nagavarapu and Justin Dauwels
<span title="2018-06-29">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This paper proposes a novel algorithm called multi-atomic annealing (MATA) to solve static dial-a-ride problem.  ...  Dial-a-ride problem (DARP) deals with the transportation of users between pickup and drop-off locations associated with specified time windows.  ...  ACKNOWLEDGMENT The research was partially supported by the ST Engineering-NTU Corporate Lab through the National Research Foundation (NRF) corporate lab@university scheme.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1807.02406v1">arXiv:1807.02406v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h3xynvpc7bfh5h252bmww7zkpi">fatcat:h3xynvpc7bfh5h252bmww7zkpi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191025114441/https://arxiv.org/pdf/1807.02406v1.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/87/42874f1b83ff3717dfaafea8f7ebfe7ba9a06d27.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1807.02406v1" 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>

A Parallel Multilevel Metaheuristic for Graph Partitioning

R. Baños, C. Gil, J. Ortega, F.G. Montoya
<span title="">2004</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/recosugx7nevfmgxg6453uyd3a" style="color: black;">Journal of Heuristics</a> </i> &nbsp;
It is able to obtain very high quality partitions and improvement on those obtained by other algorithms previously put forward.  ...  Multilevel schemes can in fact improve the quality of the solutions. However, the size of the graphs is very large in many applications, making it impossible to effectively explore the search space.  ...  Acknowledgments The authors would like to thank anonymous referees for their helpful comments. This work was supported by project TIC2002-00228 (CICYT, Spain).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1023/b:heur.0000026898.11874.e7">doi:10.1023/b:heur.0000026898.11874.e7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hkfajcve2ncidir67b5brxuave">fatcat:hkfajcve2ncidir67b5brxuave</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809143031/http://hera.ugr.es/doi/15058256.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/c2/c7/c2c74cf7eee3cd02e9a441a19dd75e41240d9203.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1023/b:heur.0000026898.11874.e7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Problems of discrete optimization: Challenges and main approaches to solve them

I. V. Sergienko, V. P. Shylo
<span title="">2006</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/agq6m4rvh5b2rkn6ebycwiubau" style="color: black;">Cybernetics and Systems Analysis</a> </i> &nbsp;
We successfully used such an approach to develop an approximate branch-and-cut algorithm for the multidimensional knapsack problem with Boolean variables and an exact algorithm for finding a maximum-size  ...  The combination of the branch-and-bound algorithm with the cut method allows us to speed up problem solution. Efficient sets of cuts are presented in [44] .  ...  These approaches include the simulated annealing method [52, 55, 85] and tabu search [69, 70, 72] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10559-006-0086-3">doi:10.1007/s10559-006-0086-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/eabgekxv25hs7ka63prruyiioy">fatcat:eabgekxv25hs7ka63prruyiioy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171114122525/http://publisher-connector.core.ac.uk/resourcesync/data/Springer-OA/pdf/ef7/aHR0cDovL2xpbmsuc3ByaW5nZXIuY29tLzEwLjEwMDcvczEwNTU5LTAwNi0wMDg2LTMucGRm.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/6a/19/6a19cb0f56e6a67f13e91d46e6afeb17187edda9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10559-006-0086-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

The unconstrained binary quadratic programming problem: a survey

Gary Kochenberger, Jin-Kao Hao, Fred Glover, Mark Lewis, Zhipeng Lü, Haibo Wang, Yang Wang
<span title="2014-04-18">2014</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tsm6lnbvf5ahzjp7czojbjig5i" style="color: black;">Journal of combinatorial optimization</a> </i> &nbsp;
Research on UBQP has generated a wide range of solution techniques for this basic model that encompasses a rich collection of problem types.  ...  In this paper we survey the literature on this important model, providing an overview of the applications and solution methods.  ...  Beasley (1998) adapts tabu search and simulated annealing to solving UBQP.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10878-014-9734-0">doi:10.1007/s10878-014-9734-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/327tskcshbdz3bzt6j4ijkgx7e">fatcat:327tskcshbdz3bzt6j4ijkgx7e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190225070418/http://pdfs.semanticscholar.org/5c8f/0499c682e947ab52d434e84da79d734eab52.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/5c/8f/5c8f0499c682e947ab52d434e84da79d734eab52.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10878-014-9734-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Survey of Metaheuristic Algorithms for Combinatorial Optimization

Malti Baghel, Shikha Agrawal, Sanjay Silakari
<span title="2012-11-15">2012</span> <i title="Foundation of Computer Science"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b637noqf3vhmhjevdfk3h5pdsu" style="color: black;">International Journal of Computer Applications</a> </i> &nbsp;
These include simulated annealing, tabu search, variable neighborhood search and greedy randomized adaptive search procedure. Population based methods deal with a set of solutions.  ...  This paper aims to present a brief survey of different metaheuristic algorithms for solving the combinatorial optimization problems.  ...  In order to improve the performance simulated annealing is merged with a tabu search algorithm [4] . Huajin jang et al (2006) proposed a simulated annealing for solving traveling salesman problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/9391-3813">doi:10.5120/9391-3813</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7ur2f64xvvb6jc4ojsd5jujfeq">fatcat:7ur2f64xvvb6jc4ojsd5jujfeq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809133440/http://research.ijcaonline.org/volume58/number19/pxc3883813.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/3c/d0/3cd04e1118acc64efd8f0136726c1d2f4b8fcbd9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/9391-3813"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A simulated annealing hyper-heuristic methodology for flexible decision support

Ruibin Bai, Jacek Blazewicz, Edmund K. Burke, Graham Kendall, Barry McCollum
<span title="2011-11-23">2011</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/a7azxtgamnavvcktn5y7xrjas4" style="color: black;">4OR</a> </i> &nbsp;
Most of the current search techniques represent approaches that are largely adapted for specific search problems.  ...  In this paper, we investigate a simulated annealing hyperheuristic methodology which operates on a search space of heuristics and which employs a stochastic heuristic selection strategy and a short-term  ...  To demonstrate the increased level of generality and competitive performance of the proposed simulated annealing hyper-heuristic, we have applied the algorithm to two very different and challenging search  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10288-011-0182-8">doi:10.1007/s10288-011-0182-8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7suq7sq5yvdndmdrinhi74jxby">fatcat:7suq7sq5yvdndmdrinhi74jxby</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120712144355/http://www.cs.qub.ac.uk/~B.McCollum/publications/Bmcc_HH.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/c2/f3/c2f301c458037f1948f3386df65ce7a3d1a0f63d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10288-011-0182-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A new hybrid ant colony algorithm for scheduling of no-wait flowshop

Vahid Riahi, Morteza Kazemi
<span title="2016-07-04">2016</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/sh6aepylxbavnbldkgyydpl6ri" style="color: black;">Operational Research</a> </i> &nbsp;
Owing to the problem is known to be NP-hard for more than two machines, a hybrid meta-heuristic algorithm based on ant colony optimization (ACO) and simulated annealing (SA) algorithm is improved.  ...  The reported results show that the proposed algorithms are effective and the new approach for local search in ACO algorithm is efficient for solving the no-wait flow shop problem.  ...  simulated annealing method has a better performance than VNS algorithm for a local search.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s12351-016-0253-x">doi:10.1007/s12351-016-0253-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/f3rvp6hkojb3pcp3ysxhxrbuu4">fatcat:f3rvp6hkojb3pcp3ysxhxrbuu4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200509215621/https://research-repository.griffith.edu.au/bitstream/handle/10072/99685/RiahiPUB1620.pdf;jsessionid=94F1CEA7568F701B6EA48A7E1BE91183?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/88/65/886599da342056ea0f98a70f0ef7bb499a6d4898.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s12351-016-0253-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

SOLVING THE DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM USING TABU AND MODIFIED PENALTY SEARCH METHODS

Wamiliana Wamiliana
<span title="">2004</span> <i title="Petra Christian University"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ouqxlj3h3zdxzlpsmibq472zgu" style="color: black;">Jurnal Teknik Industri</a> </i> &nbsp;
In this paper we propose two new search methods: one based on the method of Tabu search and the other based on a penalty function approach.  ...  For comparative analysis, we test our methods on some benchmark problems. The computational results support our methods.  ...  Algorithm by Zhou and Gen (1997) ; Simulated Annealing by Krishnamoorthy et al. (2001) ; Iterative Refinement by Boldon et al. (1996) and Deo and Kumar (1997) ; Tabu Search (CW1) by Caccetta and  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://doaj.org/article/c8a5887ace154b67b93ccd56d22ada23">doaj:c8a5887ace154b67b93ccd56d22ada23</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5ucgsjsm6zhuno3uzu6zy7rgli">fatcat:5ucgsjsm6zhuno3uzu6zy7rgli</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200128070549/http://jurnalindustri.petra.ac.id:80/index.php/ind/article/download/16216/16208" 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/6d/17/6d1775cbaec298d9ad69538df476fdc0a7169808.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Applications of modern heuristic search methods to pattern sequencing problems

Andreas Fink, Stefan Voß
<span title="">1999</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zfqmu5yfvjbg3f4h6f7a5j3jr4" style="color: black;">Computers &amp; Operations Research</a> </i> &nbsp;
Abstract-This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with respect to some  ...  We discuss the application of several modern heuristic search methods and present computational results.  ...  Simple tabu search approaches by itself are not competitive, even the application of simulated annealing leads to better results at an average.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0305-0548(98)80001-4">doi:10.1016/s0305-0548(98)80001-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ligwzkia4nggpico7pcvdowuiy">fatcat:ligwzkia4nggpico7pcvdowuiy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809120444/https://www.bwl.uni-hamburg.de/iwi/forschung/projekte/psp.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/da/16/da16a598cfdf1dc15e299d679db57a815aa3eb33.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0305-0548(98)80001-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A priority list based heuristic for the job shop problem

P M E Shutler
<span title="">2003</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;
Schedule based tabu search usually produces significantly better makespans than any simulated annealing, but for certain problem types priority list based annealing is competitive with tabu search.  ...  is competitive with tabu search.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1057/palgrave.jors.2601481">doi:10.1057/palgrave.jors.2601481</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hwqimuh5tjbsjlo5zs45awgjym">fatcat:hwqimuh5tjbsjlo5zs45awgjym</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_journal-of-the-operational-research-society_2003-06_54_6/page/571" title="read fulltext microfilm" 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> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_journal-of-the-operational-research-society_2003-06_54_6/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1057/palgrave.jors.2601481"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Hyper-heuristics: a survey of the state of the art

Edmund K Burke, Michel Gendreau, Matthew Hyde, Graham Kendall, Gabriela Ochoa, Ender Özcan, Rong Qu
<span title="">2013</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;
The definition of hyper-heuristics has been recently extended to refer to a search method or learning mechanism for selecting or generating heuristics to solve computational search problems.  ...  Current research trends and directions for future research are also discussed.  ...  Bhanu and Gopalan (2008) combined a genetic algorithm, and a set of its hybrids with simulated annealing, tabu search and hill climbing, respectively under a Greedy-Great Deluge hyper-heuristic to schedule  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1057/jors.2013.71">doi:10.1057/jors.2013.71</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wgusktpk4fau3lg22smrby4k4y">fatcat:wgusktpk4fau3lg22smrby4k4y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705114114/http://www.cs.stir.ac.uk/~goc/papers/HHSurveyJORS2013.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/11/3c/113c8deb5c4ff0e5724502062c868e9c67057ac5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1057/jors.2013.71"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

An Efficient Memetic Algorithm for the Minimum Load Coloring Problem

Zhang, Li, Qiao, Wang
<span title="2019-05-25">2019</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ye33srllvnanjouxn4tmrfgjsq" style="color: black;">Mathematics</a> </i> &nbsp;
This paper proposes a memetic algorithm for MLCP based on an improved K-OPT local search and an evolutionary operation.  ...  Experiments are carried out on the benchmark DIMACS to compare the searching results from memetic algorithm and the proposed algorithms.  ...  We compared the search results by using memetic algorithm, simulated annealing algorithm, and greedy algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/math7050475">doi:10.3390/math7050475</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n7ih3kixpzgh7nw6apvhswxwqe">fatcat:n7ih3kixpzgh7nw6apvhswxwqe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200213142652/https://res.mdpi.com/d_attachment/mathematics/mathematics-07-00475/article_deploy/mathematics-07-00475-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/a6/9a/a69a027ed17ad3ce5b6694643e519703c955b1ab.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/math7050475"> <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 survey on pickup and delivery problems

Sophie N. Parragh, Karl F. Doerner, Richard F. Hartl
<span title="2008-05-16">2008</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4sdnxwsvnvdnno4e2ycjb6wfgq" style="color: black;">Journal für Betriebswirtschaft</a> </i> &nbsp;
Single as well as multi vehicle mathematical problem formulations for all three VRPPD types are given, and the respective exact, heuristic, and metaheuristic solution methods are discussed.  ...  These are the Pickup and Delivery Vehicle Routing Problem (PDVRP -unpaired pickup and delivery points), the classical Pickup and Delivery Problem (PDP -paired pickup and delivery points), and the Dial-A-Ride  ...  Special thanks go to Michel Gendreau and Jacques Desrosiers for their kind support as well as to two anonymous referees for their valuable comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11301-008-0036-4">doi:10.1007/s11301-008-0036-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wv5idhicxvdvvmntj36f5mnpqq">fatcat:wv5idhicxvdvvmntj36f5mnpqq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812013537/http://prolog.univie.ac.at/research/surveyPDP/PDPsurveyPart2_web.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/d9/21d93bf267d38bdc175fc6dba15aa27f16bf1e71.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11301-008-0036-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Multiple Search Operator Heuristic for the Max-k-cut Problem [article]

Fuda Ma, Jin-Kao Hao
<span title="2015-10-30">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The problem is referred as the max-cut problem when k=2. In this work, we present a multiple operator heuristic (MOH) for the general max-k-cut problem.  ...  Experiments on two sets of 91 well-known benchmark instances show that the proposed algorithm is highly effective on the max-k-cut problem and improves the current best known results (new lower bounds)  ...  In particular, for the very popular max-cut problem, many heuristic algorithms have been proposed, including simulated annealing and tabu search [1] , breakout local search [3] , projected gradient approach  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1510.09156v1">arXiv:1510.09156v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/eaeecavmf5byzggdickrfu5fse">fatcat:eaeecavmf5byzggdickrfu5fse</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200901092809/https://arxiv.org/pdf/1510.09156v1.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/9d/a4/9da496a0ec8e44727d2aa1c6e400d384c210b266.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1510.09156v1" 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>
&laquo; Previous Showing results 1 &mdash; 15 out of 1,159 results