Log in

Relevant bibliographies by topics / Heuristics and Metaheuristics approaches

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Heuristics and Metaheuristics approaches'

Author: Grafiati

Published: 4 June 2021

Last updated: 14 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Heuristics and Metaheuristics approaches.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Heuristics and Metaheuristics approaches"

1

Bhanu, S. Mary Saira, and N. P. Gopalan. "A Hyper-Heuristic Approach for Efficient Resource Scheduling in Grid." International Journal of Computers Communications & Control 3, no. 3 (2008): 249. http://dx.doi.org/10.15837/ijccc.2008.3.2393.

Full text

Abstract:

Efficient execution of computations in grid can require mapping of tasks to processors whose performance is both irregular and time varying because of dynamic nature. The task of mapping jobs to the available computing nodes or scheduling of the jobs on the grid is a NP complete problem. The NP-hard problem is often solved using heuristics techniques. Heuristic and metaheuristic approaches tend to be knowledge rich, requiring substantial expertise in both the problem domain and appropriate heuristics techniques. To alleviate this problem the concept of Hyperheuristic was introduced. They opera

APA, Harvard, Vancouver, ISO, and other styles

2

Cruz-Duarte, Jorge M., José C. Ortiz-Bayliss, Iván Amaya, Yong Shi, Hugo Terashima-Marín, and Nelishia Pillay. "Towards a Generalised Metaheuristic Model for Continuous Optimisation Problems." Mathematics 8, no. 11 (2020): 2046. http://dx.doi.org/10.3390/math8112046.

Full text

Abstract:

Metaheuristics have become a widely used approach for solving a variety of practical problems. The literature is full of diverse metaheuristics based on outstanding ideas and with proven excellent capabilities. Nonetheless, oftentimes metaheuristics claim novelty when they are just recombining elements from other methods. Hence, the need for a standard metaheuristic model is vital to stop the current frenetic tendency of proposing methods chiefly based on their inspirational source. This work introduces a first step to a generalised and mathematically formal metaheuristic model, which can be u

APA, Harvard, Vancouver, ISO, and other styles

3

Colak, Selcuk, Anurag Agarwal, and Selcuk Erenguc. "Multi-Mode Resource-Constrained Project-Scheduling Problem With Renewable Resources: New Solution Approaches." Journal of Business & Economics Research (JBER) 11, no. 11 (2013): 455. http://dx.doi.org/10.19030/jber.v11i11.8193.

Full text

Abstract:

We consider the multi-mode resource-constrained project scheduling problem (MRCPSP) with renewable resources. In MRCPSP, an activity can be executed in one of many possible modes; each mode having different resource requirements and accordingly different activity durations. We assume that all resources are renewable from period to period, such as labor and machines. A solution to this problem basically involves two decisions (i) The start time for each activity and (ii) the mode for each activity. Given the NP-Hard nature of the problem, heuristics and metaheuristics are used to solve larger i

APA, Harvard, Vancouver, ISO, and other styles

4

XU, YONG, SANCHO SALCEDO-SANZ, and XIN YAO. "METAHEURISTIC APPROACHES TO TRAFFIC GROOMING IN WDM OPTICAL NETWORKS." International Journal of Computational Intelligence and Applications 05, no. 02 (2005): 231–49. http://dx.doi.org/10.1142/s1469026805001593.

Full text

Abstract:

The widespread deployment of WDM optical networks posts lots of new challenges for network designers. Traffic grooming is one of the most common problems. Efficient grooming of traffic can effectively reduce the overall cost of the network. But unfortunately, traffic grooming problems have been shown to be NP-hard. Therefore, new heuristics must be devised to tackle them. Among these approaches, metaheuristics are among the most promising ones. In this paper, we present a thorough and comprehensive survey on various metaheuristic approaches to the grooming of traffic in both static and dynamic

APA, Harvard, Vancouver, ISO, and other styles

5

Belabid, Jabrane, Said Aqil, and Karam Allali. "Solving Permutation Flow Shop Scheduling Problem with Sequence-Independent Setup Time." Journal of Applied Mathematics 2020 (January 22, 2020): 1–11. http://dx.doi.org/10.1155/2020/7132469.

Full text

Abstract:

In this paper, we study the resolution of a permutation flow shop problem with sequence-independent setup time. The objective is to minimize the maximum of job completion time, also called the makespan. In this contribution, we propose three methods of resolution, a mixed-integer linear programming (MILP) model; two heuristics, the first based on Johnson’s rule and the second based on the NEH algorithm; and finally two metaheuristics, the iterative local search algorithm and the iterated greedy algorithm. A set of test problems is simulated numerically to validate the effectiveness of our reso

APA, Harvard, Vancouver, ISO, and other styles

6

Santiago, Alejandro, Mirna Ponce-Flores, J. David Terán-Villanueva, et al. "Energy Idle Aware Stochastic Lexicographic Local Searches for Precedence-Constraint Task List Scheduling on Heterogeneous Systems." Energies 14, no. 12 (2021): 3473. http://dx.doi.org/10.3390/en14123473.

Full text

Abstract:

The use of parallel applications in High-Performance Computing (HPC) demands high computing times and energy resources. Inadequate scheduling produces longer computing times which, in turn, increases energy consumption and monetary cost. Task scheduling is an NP-Hard problem; thus, several heuristics methods appear in the literature. The main approaches can be grouped into the following categories: fast heuristics, metaheuristics, and local search. Fast heuristics and metaheuristics are used when pre-scheduling times are short and long, respectively. The third is commonly used when pre-schedul

APA, Harvard, Vancouver, ISO, and other styles

7

Kovac, Natasa. "Metaheuristic approaches for the Berth Allocation Problem." Yugoslav Journal of Operations Research 27, no. 3 (2017): 265–89. http://dx.doi.org/10.2298/yjor160518001k.

Full text

Abstract:

Berth Allocation Problem incorporates some of the most important decisions that have to be made in order to achieve maximum efficiency in a port. Terminal manager of a port has to assign incoming vessels to the available berths, which need to be loaded/unloaded in such a way that some objective function is optimized. It is well known that even simpler variants of Berth Allocation Problem are NP-hard, and thus, metaheuristic approaches are more convenient than exact methods since they provide high quality solutions in reasonable computational time. Metaheuristics are general frameworks used to

APA, Harvard, Vancouver, ISO, and other styles

8

Hifi, Mhand, and Rym M'Hallah. "A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies." Advances in Operations Research 2009 (2009): 1–22. http://dx.doi.org/10.1155/2009/150624.

Full text

Abstract:

This paper reviews the most relevant literature on efficient models and methods for packing circular objects/items into Euclidean plane regions where the objects/items and regions are either two- or three-dimensional. These packing problems are NP hard optimization problems with a wide variety of applications. They have been tackled using various approaches-based algorithms ranging from computer-aided optimality proofs, to branch-and-bound procedures, to constructive approaches, to multi-start nonconvex minimization, to billiard simulation, to multiphase heuristics, and metaheuristics.

APA, Harvard, Vancouver, ISO, and other styles

9

Saravanan, M., and K.A.Sundararaman. "Metaheuristic Approaches for Vehicle Routing Problems." International Journal of Information Systems and Supply Chain Management 6, no. 2 (2013): 17–32. http://dx.doi.org/10.4018/jisscm.2013040102.

Full text

Abstract:

Routing of service vehicles are the heart of many service operations. Exclusively vehicle routing problem (VRP) plays a central role in the optimization of distribution networks. The routing of service vehicles has a major impact on the quality of the service provided. In distribution of goods and services, it is time and again required to determine a combination of least cost vehicle routes through a set of geographically scattered customers, subject to side constraints. The case most commonly studied is where all vehicles are identical. Due to the complexity involved in solving the VRP, most

APA, Harvard, Vancouver, ISO, and other styles

10

BERRETTA, REGINA, PAULO M. FRANÇA, and VINÍCIUS A. ARMENTANO. "METAHEURISTIC APPROACHES FOR THE MULTILEVEL RESOURCE-CONSTRAINED LOT-SIZING PROBLEM WITH SETUP AND LEAD TIMES." Asia-Pacific Journal of Operational Research 22, no. 02 (2005): 261–86. http://dx.doi.org/10.1142/s0217595905000510.

Full text

Abstract:

We propose the use of metaheuristics for the resource-capacitated multilevel lot-sizing problem with general product structures, setup costs, setup times, and lead times. Initially, we develop a heuristic which moves production in time in order to obtain feasible solutions with good quality. Strategies for the short-term memory and long-term memory of tabu search are then included to guide the search of the subordinate heuristic for new, feasible, and better solutions. Simulated annealing components are embedded into tabu search in order to improve its performance. For small problems, the solu

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Heuristics and Metaheuristics approaches"

1

Arbaoui, Taha. "Modeling and solving university timetabling." Thesis, Compiègne, 2014. http://www.theses.fr/2014COMP2167/document.

Full text

Abstract:

Cette thèse s’intéresse aux problèmes d’emploi du temps d’universités. Ces problèmes sont rencontrés chaque année par les utilisateurs. Nous proposons des bornes inférieures, des méthodes heuristiques et des modèles de programmation mixte en nombres entiers et de programmation par contraintes. Nous traitons le problème d’emploi du temps d’examens et celui d’affectation des étudiants. Nous proposons de nouvelles méthodes et formulations et les comparons aux approches existantes. Nous proposons, pour le problème d’emploi du temps d’examens, une amélioration d’un modèle mathématique en nombres en

APA, Harvard, Vancouver, ISO, and other styles

2

Whitwell, Glenn. "Novel heuristic and metaheuristic approaches to cutting and packing." Thesis, University of Nottingham, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.416726.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Whitford, Angela Tracy. "Heuristic approaches to solve the frequency assignment problem." Thesis, Goldsmiths College (University of London), 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.321956.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Coles, Andrew Ian. "Heuristics and metaheuristics in forward-chaining planning." Thesis, University of Strathclyde, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.438160.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Curtois, Timothy. "Novel heuristic and metaheuristic approaches to the automated scheduling of healthcare personnel." Thesis, University of Nottingham, 2008. http://eprints.nottingham.ac.uk/28309/.

Full text

Abstract:

This thesis is concerned with automated personnel scheduling in healthcare organisations; in particular, nurse rostering. Over the past forty years the nurse rostering problem has received a large amount of research. This can be mostly attributed to its practical applications and the scientific challenges of solving such a complex problem. The benefits of automating the rostering process include reducing the planner’s workload and associated costs and being able to create higher quality and more flexible schedules. This has become more important recently in order to retain nurses and attract m

APA, Harvard, Vancouver, ISO, and other styles

6

Hiremath, Chaitr. "New Heuristic And Metaheuristic Approaches Applied To The Multiple-choice Multidimensional Knapsack Problem." Wright State University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=wright1203960454.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Urlings, Thijs. "Heuristics and metaheuristics for heavily constrained hybrid flowshop problems." Doctoral thesis, Universitat Politècnica de València, 2010. http://hdl.handle.net/10251/8439.

Full text

Abstract:

Due to the current trends in business as the necessity to have a large catalogue of products, orders that increase in frequency but not in size, globalisation and a market that is increasingly competitive, the production sector faces an ever harder economical environment. All this raises the need for production scheduling with maximum efficiency and effectiveness. The first scientific publications on production scheduling appeared more than half a century ago. However, many authors have recognised a gap between the literature and the industrial problems. Most of the research concentrates on o

APA, Harvard, Vancouver, ISO, and other styles

8

Ayechew, Mossie A. "Genetic algorithms and Lagrangean based heuristics for vehicle routing." Thesis, Coventry University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.324142.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Venter, Lieschen. "Metaheuristics for petrochemical blending problems." Thesis, Stellenbosch : University of Stellenbosch, 2010. http://hdl.handle.net/10019.1/4180.

Full text

Abstract:

ENGLISH ABSTRACT: The main aim in blending problems is to determine the best blend of available ingredients to form a certain quantity of product(s). This product should adhere to strict speci cations. In this study the best blend means the least-cost blend of ingredients (input) required to meet a minimum level of product (output) speci cations. The most prevalent tools to solve blending problems in the industry are by means of spreadsheets, simulators and mathematical programming. While there may be considerable bene t in using these types of tools to identify potential opportunities

APA, Harvard, Vancouver, ISO, and other styles

10

Souza, Neto José Ferreira de. "Modelagem e meta-heurísticas para o problema de roteamento de veículos com janelas de tempo, múltiplos entregadores e múltiplas viagens em uma empresa de distribuição de bebidas." Universidade Federal de São Carlos, 2016. https://repositorio.ufscar.br/handle/ufscar/7942.

Full text

Abstract:

Submitted by Izabel Franco (izabel-franco@ufscar.br) on 2016-10-06T17:59:08Z No. of bitstreams: 1 DissJFSN.pdf: 5729965 bytes, checksum: 946688f479f7780db197fa49b4b4c853 (MD5)<br>Approved for entry into archive by Marina Freitas (marinapf@ufscar.br) on 2016-10-20T13:51:08Z (GMT) No. of bitstreams: 1 DissJFSN.pdf: 5729965 bytes, checksum: 946688f479f7780db197fa49b4b4c853 (MD5)<br>Approved for entry into archive by Marina Freitas (marinapf@ufscar.br) on 2016-10-20T13:51:14Z (GMT) No. of bitstreams: 1 DissJFSN.pdf: 5729965 bytes, checksum: 946688f479f7780db197fa49b4b4c853 (MD5)<br>Made availa

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Heuristics and Metaheuristics approaches"

1

Heuristics and metaheuristics for heavily constrained hybrid flowshop problems. IOS Press, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Rabadi, Ghaith, ed. Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-26024-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ling, Ling. Computer based approaches to managerial decision making: Optimisation, heuristics, and simulation. Aston University. Aston Business School, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Yin, Peng-Yeng. Trends in developing metaheuristics, algorithms, and optimization approaches. 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Christian, Blum, ed. Hybrid metaheuristics: An emerging approach to optimization. Springer, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Rabadi, Ghaith. Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling. Springer, 2016.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Rabadi, Ghaith. Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling. Springer, 2018.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Doverspike, Robert, and Iraj Saniee. Heuristic Approaches for Telecommunications Network Management, Planning and Expansion: A Special Issue of the Journal of Heuristics. Springer, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Cappelen, Herman, Tamar Szabó Gendler, and John Hawthorne, eds. The Oxford Handbook of Philosophical Methodology. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780199668779.001.0001.

Full text

Abstract:

This book examines the nature of philosophical methodology, defined as the study of philosophical method: how to do philosophy well. It considers a number of hypotheses that explain the nature of philosophical methodology, including eliminativism, epistemologism, theory selectionism, necessary preconditionalism, and hierarchicalism. It also tackles a range of topics such as ‘ordinary language philosophy’, the role of logic in philosophical methodology, phenomenology, philosophical heuristics, and methods in the philosophy of literature and film. Other chapters discuss the method of reflective

APA, Harvard, Vancouver, ISO, and other styles

10

Gerken, Mikkel. On Folk Epistemology. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198803454.001.0001.

Full text

Abstract:

On Folk Epistemology is a book about how we ascribe knowledge to ourselves and others. Empirical evidence suggests that we do so early and often in thought as well as in talk. Since such knowledge ascriptions are central to how we navigate social life, it is important to understand our basis for making them. A central claim of the book is that factors that have nothing to do with knowledge may lead to systematic mistakes in everyday ascriptions of knowledge. These mistakes are explained by an empirically informed account of how ordinary knowledge ascriptions are the product of cognitive heuris

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Heuristics and Metaheuristics approaches"

1

Burke, Edmund K., Matthew Hyde, Graham Kendall, Gabriela Ochoa, Ender Özcan, and John R. Woodward. "A Classification of Hyper-heuristic Approaches." In Handbook of Metaheuristics. Springer US, 2010. http://dx.doi.org/10.1007/978-1-4419-1665-5_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Burke, Edmund K., Matthew R. Hyde, Graham Kendall, Gabriela Ochoa, Ender Özcan, and John R. Woodward. "A Classification of Hyper-Heuristic Approaches: Revisited." In Handbook of Metaheuristics. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-91086-4_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Galán, Ricardo. "Hybrid Heuristic Approaches for Scheduling in Reconfigurable Manufacturing Systems." In Metaheuristics for Scheduling in Industrial and Manufacturing Applications. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-78985-7_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Pérez Castaño, Arnaldo. "Heuristics & Metaheuristics." In Practical Artificial Intelligence. Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3357-3_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Crainic, Teodor Gabriel, and Michel Toulouse. "Parallel Meta-heuristics." In Handbook of Metaheuristics. Springer US, 2010. http://dx.doi.org/10.1007/978-1-4419-1665-5_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Elgers, Niels, Nguyen Dang, and Patrick De Causmaecker. "A Metaheuristic Approach to Compute Pure Nash Equilibria." In Bioinspired Heuristics for Optimization. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-95104-1_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Charon, Irène, and Olivier Hudry. "Mixing Different Components of Metaheuristics." In Meta-Heuristics. Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1361-8_35.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Sevaux, Marc, Kenneth Sörensen, and Nelishia Pillay. "Adaptive and Multilevel Metaheuristics." In Handbook of Heuristics. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-07124-4_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Sevaux, Marc, Kenneth Sörensen, and Nelishia Pillay. "Adaptive and Multilevel Metaheuristics." In Handbook of Heuristics. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-07153-4_16-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Sörensen, Kenneth, Marc Sevaux, and Fred Glover. "A History of Metaheuristics." In Handbook of Heuristics. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-07153-4_4-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Heuristics and Metaheuristics approaches"

1

Kurniasih, Julia, Ema Utami, and Suwanto Raharjo. "Heuristics and Metaheuristics Approach for Query Optimization Using Genetics and Memetics Algorithm." In 2019 1st International Conference on Cybernetics and Intelligent System (ICORIS). IEEE, 2019. http://dx.doi.org/10.1109/icoris.2019.8874909.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

De Souza, Italos Estilon Da Silva, Mauro Roberto Costa Da Silva, Welverton Rodrigues Da Silva, and Rafael C. S. Schoeury. "Exact and Heuristic Approaches to the Maximum Capacity Representatives Problem." In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3164.

Full text

Abstract:

This paper approaches the problem of finding the system of representatives of a family of disjoint sets. To solve this problem, three methods were used: integer programming, branch-and-bound, and the BRKGA metaheuristic. We observed that, in randomly generated instances, the branch-and-bound algorithm was the best exact method but it was surpassed by BRKGA for large instances.

APA, Harvard, Vancouver, ISO, and other styles

3

Mhadhbi, Imene, Slim Ben Othman, and Slim Ben Saoud. "Hardware/software partitioning heuristics approaches." In 2017 International Conference on Advanced Systems and Electric Technologies (IC_ASET). IEEE, 2017. http://dx.doi.org/10.1109/aset.2017.7983684.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Cruz-Duarte, Jorge M., Ivan Amaya, Jose Carlos Ortiz-Bayliss, Santiago Enrique Conant-Pablos, and Hugo Terashima-Marin. "A Primary Study on Hyper-Heuristics to Customise Metaheuristics for Continuous optimisation." In 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2020. http://dx.doi.org/10.1109/cec48606.2020.9185591.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Garbelini, Jader M. Caldonazzo, Andre Yoshiaki Kashiwabara, and Danilo Sipoli Sanches. "Discovery Biological Motifs Using Heuristics Approaches." In 2016 5th Brazilian Conference on Intelligent Systems (BRACIS). IEEE, 2016. http://dx.doi.org/10.1109/bracis.2016.041.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Mezghani, Salma, and Ahmed Frikha. "Heuristics approaches for the industrial Storage Problem." In 2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO 2013). IEEE, 2013. http://dx.doi.org/10.1109/icmsao.2013.6552561.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Sul, Seung-Jin, Suzanne Matthews, and Tiffani L. Williams. "New Approaches to Compare Phylogenetic Search Heuristics." In 2008 IEEE International Conference on Bioinformatics and Biomedicine. IEEE, 2008. http://dx.doi.org/10.1109/bibm.2008.81.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Venkata, Ramana Murthy V., and Alok Singh. "Solving the min-degree constrained minimum spanning tree problem using heuristic and metaheuristic approaches." In 2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing (PDGC). IEEE, 2012. http://dx.doi.org/10.1109/pdgc.2012.6449909.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Farea, Afrah, and Ali Karci. "Towards association rule hiding heuristics vs border-based approaches." In 2015 9th International Conference on Electrical and Electronics Engineering (ELECO). IEEE, 2015. http://dx.doi.org/10.1109/eleco.2015.7394529.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Yokoyama, André, Antonio Mury, Mariza Ferro, and Bruno Schulze. "Evaluation of Nature Inspired Metaheuristics for Search and Reconnaissance Operations by Rotary-wing Aircrafts." In XI Brazilian e-Science Workshop. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/bresci.2017.9918.

Full text

Abstract:

The main objective of this work is the evaluation of two nature inspired meta-heuristics, Genetic Algorithms and Ant Colony, for the development of an application that can generate optimized routes for aircraft, attending the requirements of the Brazilian Navy. This work presents the methods developed, complying with two main constraints: checkpoints mobility and limited aircraft autonomy. It also presents the results of tests performed with the methods developed and an evaluation of their performances.

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Heuristics and Metaheuristics approaches"

1

Yan, Yujie, and Jerome F. Hajjar. Automated Damage Assessment and Structural Modeling of Bridges with Visual Sensing Technology. Northeastern University, 2021. http://dx.doi.org/10.17760/d20410114.

Full text

Abstract:

Recent advances in visual sensing technology have gained much attention in the field of bridge inspection and management. Coupled with advanced robotic systems, state-of-the-art visual sensors can be used to obtain accurate documentation of bridges without the need for any special equipment or traffic closure. The captured visual sensor data can be post-processed to gather meaningful information for the bridge structures and hence to support bridge inspection and management. However, state-of-the-practice data postprocessing approaches require substantial manual operations, which can be time-c

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!