Literatura académica sobre el tema "Local search heuristics"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Local search heuristics".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Local search heuristics"
Veerapaneni, Rishi, Muhammad Suhail Saleem y Maxim Likhachev. "Learning Local Heuristics for Search-Based Navigation Planning". Proceedings of the International Conference on Automated Planning and Scheduling 33, n.º 1 (1 de julio de 2023): 634–38. http://dx.doi.org/10.1609/icaps.v33i1.27245.
Texto completoWilt, Christopher y Wheeler Ruml. "Speedy Versus Greedy Search". Proceedings of the International Symposium on Combinatorial Search 5, n.º 1 (1 de septiembre de 2021): 184–92. http://dx.doi.org/10.1609/socs.v5i1.18320.
Texto completoHASEGAWA, Manabu. "Potentially Local Search in Local Search Heuristics". Proceedings of The Computational Mechanics Conference 2004.17 (2004): 403–4. http://dx.doi.org/10.1299/jsmecmd.2004.17.403.
Texto completoSoria-Alcaraz, Jorge A., Gabriela Ochoa, Andres Espinal, Marco A. Sotelo-Figueroa, Manuel Ornelas-Rodriguez y Horacio Rostro-Gonzalez. "A Methodology for Classifying Search Operators as Intensification or Diversification Heuristics". Complexity 2020 (13 de febrero de 2020): 1–10. http://dx.doi.org/10.1155/2020/2871835.
Texto completoAdubi, Stephen A., Olufunke O. Oladipupo y Oludayo O. Olugbara. "Evolutionary Algorithm-Based Iterated Local Search Hyper-Heuristic for Combinatorial Optimization Problems". Algorithms 15, n.º 11 (31 de octubre de 2022): 405. http://dx.doi.org/10.3390/a15110405.
Texto completoDavidov, D. y S. Markovitch. "Multiple-Goal Heuristic Search". Journal of Artificial Intelligence Research 26 (25 de agosto de 2006): 417–51. http://dx.doi.org/10.1613/jair.1940.
Texto completoAbdul-Razaq, Tariq, Hanan Chachan y Faez Ali. "Modified Heuristics for Scheduling in Flow Shop to Minimize Makespan". Journal of Al-Rafidain University College For Sciences ( Print ISSN: 1681-6870 ,Online ISSN: 2790-2293 ), n.º 2 (19 de octubre de 2021): 1–20. http://dx.doi.org/10.55562/jrucs.v30i2.361.
Texto completoSobrino, D. R. Delgado, Oliver Moravčik, D. Caganová y P. Kostal. "Hybrid Iterative Local Search Heuristic with a Multiple Criteria Approach for the Vehicle Routing Problem". Advanced Materials Research 383-390 (noviembre de 2011): 4560–67. http://dx.doi.org/10.4028/www.scientific.net/amr.383-390.4560.
Texto completoNakhost, Hootan, Jörg Hoffmann y Martin Müller. "Improving Local Search for Resource-Constrained Planning". Proceedings of the International Symposium on Combinatorial Search 1, n.º 1 (25 de agosto de 2010): 81–82. http://dx.doi.org/10.1609/socs.v1i1.18166.
Texto completoLissovoi, Andrei, Pietro S. Oliveto y John Alasdair Warwicker. "Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes". Evolutionary Computation 28, n.º 3 (septiembre de 2020): 437–61. http://dx.doi.org/10.1162/evco_a_00258.
Texto completoTesis sobre el tema "Local search heuristics"
Shatabda, Swakkhar. "Local Search Heuristics for Protein Structure Prediction". Thesis, Griffith University, 2014. http://hdl.handle.net/10072/365446.
Texto completoThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Science, Environment, Engineering and Technology
Full Text
Carson, Ted. "Empirical and analytic approaches to understanding local search heuristics /". Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2001. http://wwwlib.umi.com/cr/ucsd/fullcit?p9995987.
Texto completoMagaji, Amina Sambo-Muhammad. "Combining search strategies for distributed constraint satisfaction". Thesis, Robert Gordon University, 2015. http://hdl.handle.net/10059/1374.
Texto completoHenderson, Darrall. "Assessing the Finite-Time Performance of Local Search Algorithms". Diss., Virginia Tech, 2001. http://hdl.handle.net/10919/26926.
Texto completoPh. D.
Santiago, Rafael de. "Efficient modularity density heuristics in graph clustering and their applications". reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/164066.
Texto completoAlratrout, Serein Abdelmonam. "A hybrid multi-agent architecture and heuristics generation for solving meeting scheduling problem". Thesis, De Montfort University, 2009. http://hdl.handle.net/2086/2409.
Texto completoRosin, Rafael Alzuguir. "Heurística com busca local para solução do problema de cobertura de rotas com cardinalidade restrita". Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/3/3148/tde-30032012-122542/.
Texto completoThe growing need to seek more efficient, lower cost and more sustainable operations has caused industries to seek opportunities in which these objectives could be achieved. In the area of transportation, collaboration is an opportunity for that. This work deals with the cardinality constrained lane covering problem (CCLCP), where companies who uses full truck loads join efforts in order to reduce empty vehicle travel through closed cycle formation. It is known as cardinality constraint problem as the maximum number of trips in the cycle is limited to an integer number, which makes this problem NP-Hard. There are two heuristics in the literature (constructive) and an integer linear programming model for solving this problem. This work presents a heuristic based on a local search method that reduced an average of 3.19% the better results in the literature. It also presents the execution times of each algorithm and the importance of choosing a good initial solution when you want to create a Local Search Heuristic.
Pehlivanoglu, Osman. "An Algorithm For The Capacitated Vehicle Routing Problem With Time Windows". Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/2/12606657/index.pdf.
Texto completos and Homberger and Gehring (1999)&rsquo
s problem sets in order to test the performance of the proposed algorithm. From the computational results encouraging results are obtained in terms of solution quality.
Sullivan, Kelly Ann. "A Convergence Analysis of Generalized Hill Climbing Algorithms". Diss., Virginia Tech, 1999. http://hdl.handle.net/10919/27027.
Texto completoPh. D.
Campos, Danilo da Silva. "Integração dos problemas de carregamento e roteamento de veículos com janela de tempo e frota heterogênea". Universidade de São Paulo, 2008. http://www.teses.usp.br/teses/disponiveis/3/3136/tde-30052008-111539/.
Texto completoThis work presents a problem not treated yet on the literature referenced as 3L-FSMVRPTW (three-dimensional loading fleet sizing and mix vehicle routing problem with time windows), which deals simultaneously with vehicle routing and its three-dimensional loading considering heterogeneous fleet and time windows. The algorithm developed for the specific problem is called 3DC. This algorithm introduces a new local search operator called k-IntensiveSwap and a new container loading heuristic. The results are compared with the best-known results from literature for particular problems embeeded on the general problem presented. The quality of solution was good in comparison other methods for CLP (container loading problem), it has good results in terms of reduction fleet sizing in the case of 3L-VRP (three-dimensional loading vehicle routing problem) and as for 3L-VRPTW (threedimensional loading vehicle routing problem with time windows) the performance was very superior. Finally, it is presented a solution set as benchmark for future comparison with the general problem, with heterogeneous fleet.
Libros sobre el tema "Local search heuristics"
Voß, Stefan, Silvano Martello, Ibrahim H. Osman y Catherine Roucairol, eds. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5775-3.
Texto completoStützle, Thomas, Mauro Birattari y Holger H. Hoos, eds. Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-74446-7.
Texto completoStützle, Thomas, Mauro Birattari y Holger H. Hoos, eds. Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03751-1.
Texto completoVo€, Stefan. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Boston, MA: Springer US, 1999.
Buscar texto completoStefan, Voss y Meta-Heuristics International Conference (2nd : 1997 : Sophia-Antipolis, France), eds. Meta-heuristics: Advances and trends in local search paradigms for optimization. Boston, Mass: Kluwer Academic Publishers, 1999.
Buscar texto completoThomas, Stützle, Birattari Mauro y Hoos Holger H, eds. Engineering stochastic local search algorithms: Designing, implementing and analyzing effective heuristics : international workshop, SLS 2007, Brussels, Belgium, September 6-8, 2007 : proceedings. Berlin: Springer, 2007.
Buscar texto completoH, Hoos Holger, Birattari Mauro y SpringerLink (Online service), eds. Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics: Second International Workshop, SLS 2009, Brussels, Belgium, September 3-4, 2009. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.
Buscar texto completoL, Aarts E. H. y Lenstra J. K, eds. Local search in combinatorial optimization. Princeton: Princeton University Press, 2003.
Buscar texto completoL, Aarts E. H. y Lenstra J. K, eds. Local search in combinatorial optimization. Chichester [England]: Wiley, 1997.
Buscar texto completo(Editor), Stefan Voß, Silvano Martello (Editor), Ibrahim H. Osman (Editor) y Cathérine Roucairol (Editor), eds. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Springer, 1998.
Buscar texto completoCapítulos de libros sobre el tema "Local search heuristics"
Alsheddy, Abdullah, Christos Voudouris, Edward P. K. Tsang y Ahmad Alhindi. "Guided Local Search". En Handbook of Heuristics, 261–97. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-07124-4_2.
Texto completoStützle, Thomas y Rubén Ruiz. "Iterated Local Search". En Handbook of Heuristics, 579–605. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-07124-4_8.
Texto completoAlsheddy, Abdullah, Christos Voudouris, Edward P. K. Tsang y Ahmad Alhindi. "Guided Local Search". En Handbook of Heuristics, 1–37. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-07153-4_2-1.
Texto completoStützle, Thomas y Rubén Ruiz. "Iterated Local Search". En Handbook of Heuristics, 1–27. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-07153-4_8-1.
Texto completoMichiels, W., E. H. L. Aarts y J. Korst. "Theory of Local Search". En Handbook of Heuristics, 299–339. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-07124-4_6.
Texto completoMichel, Laurent y Pascal Van Hentenryck. "Constraint-Based Local Search". En Handbook of Heuristics, 223–60. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-07124-4_7.
Texto completoMichiels, W., E. H. L. Aarts y J. Korst. "Theory of Local Search". En Handbook of Heuristics, 1–41. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-07153-4_6-1.
Texto completoMichel, Laurent y Pascal Van Hentenryck. "Constraint-Based Local Search". En Handbook of Heuristics, 1–38. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-07153-4_7-1.
Texto completoten Eikelder, H. M. M., M. G. A. Verhoeven, T. W. M. Vossen y E. H. L. Aarts. "A Probabilistic Analysis of Local Search". En Meta-Heuristics, 605–18. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1361-8_36.
Texto completoBrucker, Peter y Johann Hurink. "Complex Sequencing Problems and Local Search Heuristics". En Meta-Heuristics, 151–66. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1361-8_10.
Texto completoActas de conferencias sobre el tema "Local search heuristics"
Lasisi, Ramoni O. y Robert DuPont. "Augmenting Stochastic Local Search with Heuristics". En 2018 9th IEEE Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON). IEEE, 2018. http://dx.doi.org/10.1109/uemcon.2018.8796721.
Texto completoCurran, Dara, Eugene Freuder y Thomas Jansen. "Incremental evolution of local search heuristics". En the 12th annual conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1830483.1830660.
Texto completoInterian, Yannet y Sara Bernardini. "Learning Interpretable Heuristics for WalkSAT". En 20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/36.
Texto completoDevarenne, Isabelle, Hakim Mabed y Alexandre Caminada. "Intelligent Neighborhood Exploration in Local Search Heuristics". En 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06). IEEE, 2006. http://dx.doi.org/10.1109/ictai.2006.68.
Texto completo"Session details: Meta-heuristics and local search". En GECCO05: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2005. http://dx.doi.org/10.1145/3249410.
Texto completo"Session details: Meta-heuristics and local search". En GECCO05: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2005. http://dx.doi.org/10.1145/3249411.
Texto completoHu, Qifu, Ruyang Li, Qi Deng, Yaqian Zhao y Rengang Li. "Enhancing Network by Reinforcement Learning and Neural Confined Local Search". En Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/236.
Texto completoMarek, J., P. Holub y H. Rudova. "Local Search Heuristics for Media Streams Planning Problem". En 2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA). IEEE, 2013. http://dx.doi.org/10.1109/aina.2013.132.
Texto completoBurke, Edmund, Tim Curtois, Matthew Hyde, Graham Kendall, Gabriela Ochoa, Sanja Petrovic, Jose A. Vazquez-Rodriguez y Michel Gendreau. "Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms". En 2010 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2010. http://dx.doi.org/10.1109/cec.2010.5586064.
Texto completoLv, Yuanhua, Dimitrios Lymberopoulos y Qiang Wu. "An exploration of ranking heuristics in mobile local search". En the 35th international ACM SIGIR conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2348283.2348325.
Texto completo