Academic literature on the topic 'Taboo search'

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 'Taboo search.'

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 "Taboo search"

1

Wang, Jia Yang, Zuo Yong Li, Bi Zhang, and Chang Wu Zou. "Parameter Optimization of BOD Water Quality Model Based on the Immunity Taboo Search." Applied Mechanics and Materials 198-199 (September 2012): 839–42. http://dx.doi.org/10.4028/www.scientific.net/amm.198-199.839.

Full text
Abstract:
A new version of Taboo Search (TS), namely, Immunity Taboo Search (ITS) is first introduced and tried to optimize the parameters of BOD water quality model. Here, Taboo Search was improved by Immune Arithmetic (IEA). Parameters of BOD water quality model were optimized by ITS, the performance is compared with other method. Results show that ITS plays an important role in solving global optimization problem, and demonstrate the effectiveness and higher accuracy than other methods.
APA, Harvard, Vancouver, ISO, and other styles
2

Rajesh, J., V. K. Jayaraman, and B. D. Kulkarni. "Taboo Search Algorithm for Continuous Function Optimization." Chemical Engineering Research and Design 78, no. 6 (2000): 845–48. http://dx.doi.org/10.1205/026387600528049.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Amrulloh, Arif, and Enny Itje Sela. "Course scheduling optimization using genetic algorithm and tabu search." Jurnal Teknologi dan Sistem Komputer 9, no. 3 (2021): 157–66. http://dx.doi.org/10.14710/jtsiskom.2021.14137.

Full text
Abstract:
Scheduling courses in higher education often face problems, such as the clashes of teachers' schedules, rooms, and students' schedules. This study proposes course scheduling optimization using genetic algorithms and taboo search. The genetic algorithm produces the best generation of chromosomes composed of lecturer, day, and hour genes. The Tabu search method is used for the lecture rooms division. Scheduling is carried out for the Informatics faculty with four study programs, 65 lecturers, 93 courses, 265 lecturer assignments, and 65 classes. The process of generating 265 schedules took 561 s
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Jia Yang, Bi Zhang, Zuo Yong Li, and Lei Xu. "Improved Hybrid Taboo Search with its Application in Computer-Aided Optimization Problem." Advanced Materials Research 488-489 (March 2012): 1293–97. http://dx.doi.org/10.4028/www.scientific.net/amr.488-489.1293.

Full text
Abstract:
A new improved algorithm of Taboo Search (TS), namely, Hybrid Taboo Search (HTS) is first introduced and tried for several test functions having multiple local optima. Here, Taboo Search was improved by combining Immune Arithmetic (IA) and Simulated Annealing (SA). Several strategies to improve the TS have been presented before, but the focus here is on the novelty, availability and precision of algorithm. There are several optimization problems in computer-aided design, so the article used the improved HTS in computer-aided optimization problems, the performance of which is compared with the
APA, Harvard, Vancouver, ISO, and other styles
5

Taillard, E. "Robust taboo search for the quadratic assignment problem." Parallel Computing 17, no. 4-5 (1991): 443–55. http://dx.doi.org/10.1016/s0167-8191(05)80147-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Kai, Jin Xu, Xiutang Geng, Jianhua Xiao, and Linqiang Pan. "Improved taboo search algorithm for designing DNA sequences." Progress in Natural Science 18, no. 5 (2008): 623–27. http://dx.doi.org/10.1016/j.pnsc.2008.01.005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ji, Mingjun, and Jacek Klinowski. "Convergence of taboo search in continuous global optimization." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 462, no. 2071 (2006): 2077–84. http://dx.doi.org/10.1098/rspa.2006.1678.

Full text
Abstract:
While taboo search (TS), a method of global optimization, has successfully solved many optimization problems, little is known about its convergence properties, especially for continuous optimization tasks. We consider the global convergence of the original TS for solving continuous optimization problems, and give a condition which guarantees the convergence of the objective value sequence of the method. We also prove that the minimum objective value sequence converges to the vicinity of the global optimal value with probability 1.
APA, Harvard, Vancouver, ISO, and other styles
8

Zhao, Jing, Wei Shi, and Chun Xiang Xu. "Study on Electric Automation with Reactive Optimization Based on TSGA in Power System." Advanced Materials Research 738 (August 2013): 251–55. http://dx.doi.org/10.4028/www.scientific.net/amr.738.251.

Full text
Abstract:
Focusing on electric automation with the reactive optimization for power system which is a nonlinear object with multiple variables and constraint conditions, the paper presents an optimal method based on Taboo Search and Genetic Algorithm, which inherits and develops the advantages of multiple search and high robust performance of Genetic Algorithm, and the high climbing ability of Taboo Search to improve the convergence performance and speed. The simulation for IEEE30 node system proves that the method introduced in the paper is appropriate and efficient in the field of electric automation.
APA, Harvard, Vancouver, ISO, and other styles
9

Xie, Jin Bao, Ying Han, Long Han, and Rui Na Yang. "Taboo Search Algorithm for Optimizing Shunting Scheme of Through Wagon Flow Delivering and Fetching Operation." Applied Mechanics and Materials 178-181 (May 2012): 1908–14. http://dx.doi.org/10.4028/www.scientific.net/amm.178-181.1908.

Full text
Abstract:
In order to improve the efficiency of selecting the optimal scheme from the delivering and fetching shunting schemes of through wagon flow to and from the enterprise dedicated lines which are located in radial shape, the taboo search algorithm is applied in the process finding the optimal solution. The objective function is directly used as the fitness function, and the solution generated by exchanging the wagon group delivering order of one dedicated line with another is taken as the new solution; the taboo list is two-dimensional array, and a fixed value is given as the taboo length; if the
APA, Harvard, Vancouver, ISO, and other styles
10

JIANG, Dakui. "Supply Chain Scheduling Based on Hybrid Taboo Search Algorithm." Journal of Mechanical Engineering 47, no. 20 (2011): 53. http://dx.doi.org/10.3901/jme.2011.20.053.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Taboo search"

1

Kovàcs, Akos. "Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing." Thesis, Högskolan Dalarna, Datateknik, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3306.

Full text
Abstract:
This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this pro
APA, Harvard, Vancouver, ISO, and other styles
2

Agarwal, Pranab. "Conceptual design of long-span trusses using multi-stage heuristics." Thesis, Texas A&M University, 2003. http://hdl.handle.net/1969.1/3863.

Full text
Abstract:
A hybrid method that addresses the design and optimization of long-span steel trusses is presented. By utilizing advancements in present day computing and biologically inspired analysis and design, an effort has been made to automate the process of evolving optimal trusses in an unstructured problem domain. Topology, geometry and sizing optimization of trusses are simultaneously addressed using a three stage methodology. Multi-objective genetic algorithms are used to optimize the member section sizes of truss topologies and geometries. Converting constraints into additional objectives provides
APA, Harvard, Vancouver, ISO, and other styles
3

Soares, Werner Kleyson da Silva. "Heur?sticas usando constru??o de vocabuil?rio aplicadas ao problema da atribui??o de localidades a an?is em redes SONET/SDH." Universidade Federal do Rio Grande do Norte, 2009. http://repositorio.ufrn.br:8080/jspui/handle/123456789/14916.

Full text
Abstract:
Made available in DSpace on 2014-12-17T14:52:44Z (GMT). No. of bitstreams: 1 WernerKSS.pdf: 2229557 bytes, checksum: 7a64dc1b94612cd78d88c6eb822d29e6 (MD5) Previous issue date: 2009-10-31<br>Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior<br>The SONET/SDH Ring Assignment Problem (PALAS) treats to group localities in form of some rings, being respected the traffic's limitations of the equipment. Each ring uses a DXC (Digital Cross Connect) to make the communication with the others, being the DXC the equipment most expensive of the net, minimizing the number total of rings, will mi
APA, Harvard, Vancouver, ISO, and other styles
4

Ta, Quang-Chieu. "Matheuristic algorithms for minimizing total tardiness in flow shop scheduling problems." Thesis, Tours, 2015. http://www.theses.fr/2015TOUR4002/document.

Full text
Abstract:
Nous considérons dans cette thèse un problème d’ordonnancement de flow-shop de permutation où un ensemble de travaux doit être ordonnancé sur un ensemble de machines. Les travaux doivent être ordonnancés sur les machines dans le même ordre. L’objectif est de minimiser le retard total. Nous proposons des algorithmes heuristiques et des nouvelles matheuristiques pour ce problème. Les matheuristiques sont un nouveau type d’algorithmes approchés qui ont été proposés pour résoudre des problèmes d’optimisation combinatoire. Les méthodes importent de la résolution exacte au sein des approches (méta)
APA, Harvard, Vancouver, ISO, and other styles
5

Smairi, Nadia. "Optimisation par essaim particulaire : adaptation de tribes à l'optimisation multiobjectif." Phd thesis, Université Paris-Est, 2013. http://tel.archives-ouvertes.fr/tel-00981558.

Full text
Abstract:
Dans le cadre de l'optimisation multiobjectif, les métaheuristiques sont reconnues pour être des méthodes performantes mais elles ne rencontrent qu'un succès modéré dans le monde de l'industrie. Dans un milieu où seule la performance compte, l'aspect stochastique des métaheuristiques semble encore être un obstacle difficile à franchir pour les décisionnaires. Il est donc important que les chercheurs de la communauté portent un effort tout particulier sur la facilité de prise en main des algorithmes. Plus les algorithmes seront faciles d'accès pour les utilisateurs novices, plus l'utilisation d
APA, Harvard, Vancouver, ISO, and other styles
6

Ben, cheikh Sondes. "Optimisation avancée au service du covoiturage dynamique." Thesis, Ecole centrale de Lille, 2016. http://www.theses.fr/2016ECLI0002/document.

Full text
Abstract:
Le covoiturage se présente comme une solution de transport alternative qui vient soigner l’image environnementale, économique et sociétale de la voiture personnelle. Le problème du covoiturage dynamique consiste à élaborer en temps réel des tournées de véhicules optimisés, afin de répondre au mieux aux demandes instantanées de transport.C’est dans ce cadre que s’inscrivent nos travaux où l’optimisation et le temps réel sont les maître-mots. Étant donné la complexité exponentielle du problème, nous optons pour des méthodes approximatives pour le résoudre. Nous présentons notre première contribu
APA, Harvard, Vancouver, ISO, and other styles
7

Zheng, You. "Models and algorithms for the combinatorial optimization of WLAN-based indoor positioning system." Phd thesis, Université de Technologie de Belfort-Montbeliard, 2012. http://tel.archives-ouvertes.fr/tel-00827561.

Full text
Abstract:
Indoor Positioning Systems (IPS) using the existing WLAN have won growing interest in the last years, it can be a perfect supplement to provide location information of users in indoor environments where other positioning techniques such as GPS, are not much effective. The thesis manuscript proposes a new approach to define a WLAN-based indoor positioning system (WLAN-IPS) as a combinatorial optimization problem to guarantee the requested communication quality while optimizing the positioning error. This approach is characterised by several difficult issues we tackled in three steps.At first, w
APA, Harvard, Vancouver, ISO, and other styles
8

Jin, Yan. "Hybrid metaheuristic algorithms for sum coloring and bandwidth coloring." Thesis, Angers, 2015. http://www.theses.fr/2015ANGE0062/document.

Full text
Abstract:
Le problème de somme coloration minimum (MSCP) et le problème de coloration de bande passante (BCP) sont deux généralisations importantes du problème de coloration des sommets classique avec de nombreuses applications dans divers domaines, y compris la conception de circuits imprimés, la planication, l’allocation de ressource, l’affectation de fréquence dans les réseaux mobiles, etc. Les problèmes MSCP et BCP étant NP-difficiles, les heuristiques et métaheuristiques sont souvent utilisées en pratique pour obtenir des solutions de bonne qualité en un temps de calcul acceptable. Cette thèse est
APA, Harvard, Vancouver, ISO, and other styles
9

Ahmad, Maqsood. "Mathematical models and methods based on metaheuristic approach for timetabling problem." Thesis, Clermont-Ferrand 2, 2013. http://www.theses.fr/2013CLF22393/document.

Full text
Abstract:
Résumé indisponible<br>In this thesis we have concerned ourselves with university timetabling problems both course timetabling and examination timetabling problems. Most of the timetabling problems are computationally NP-complete problems, which means that the amount of computation required to find solutions increases exponentially with problem size. These are idiosyncratic nature problems, for example different universities have their own set of constraints, their own definition of good timetable, feasible timetable and their own choice about the use of constraint type (as a soft or hard const
APA, Harvard, Vancouver, ISO, and other styles
10

Karray, Asma. "Contribution à l’ordonnancement d’ateliers agroalimentaires utilisant des méthodes d’optimisation hybrides." Thesis, Ecole centrale de Lille, 2011. http://www.theses.fr/2011ECLI0024/document.

Full text
Abstract:
Nos travaux concernent la mise en œuvre de méthodologies pour la résolution de problèmes d’ordonnancement en industries agroalimentaires. Trois nouvelles approches basées sur les algorithmes génétiques, sont proposées pour la résolution de problèmes d’ordonnancement multi-objectifs : les algorithmes génétiques séquentiels (SGA), les algorithmes génétiques parallèles (PGA) et les algorithmes génétiques parallèles séquentiels (PSGA). Deux approches coopératives multi-objectifs en mode relais, SH_GA/TS et SH_GA/SA, hybridant toutes les deux des métaheuristiques de haut niveau, sont par la suite p
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Taboo search"

1

Furman, Evelyn E. Livingston. My search for Augusta Pierce Tabor, Leadville's first lady. Quality Press, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Suicide: The Last Taboo - A Professional Handbook in Search of Understanding (Rhodes-Fulbright International Library.). Wyndham Hall Pr, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Taboo search"

1

Beham, Andreas, Erik Pitzer, and Michael Affenzeller. "Fitness Landscape Based Parameter Estimation for Robust Taboo Search." In Computer Aided Systems Theory - EUROCAST 2013. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-53856-8_37.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Leon, Paul, Rony Cueva, Manuel Tupia, and Gonçalo Paiva Dias. "A Taboo-Search Algorithm for 3D-Binpacking Problem in Containers." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-16181-1_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ren, Chunyu. "Fast Taboo Search Algorithm for Solving Min-Max Vehicle Routing Problem." In Communications in Computer and Information Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24097-3_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cvijović, Djurdje, and Jacek Klinowski. "Taboo Search: An Approach to the Multiple-Minima Problem for Continuous Functions." In Nonconvex Optimization and Its Applications. Springer US, 2002. http://dx.doi.org/10.1007/978-1-4757-5362-2_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Qu, Yuan, and Zhong-ping Jiang. "Bi-Level Programming Model and Taboo Search Algorithm in Industrial Location Under the Condition of Random Price." In Emerging Technologies for Information Systems, Computing, and Management. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-7010-6_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Muñoz-César, Juan José, Luis Héctor Hernández-Gómez, Omar Ismael López-Suárez, et al. "Optimization of the Design of a Four Bar Mechanism for a Lower Limb Prosthesis Using the Taboo Search Algorithm." In Advances in Bio-Mechanical Systems and Materials. Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-00479-2_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

"Taboo Search." In Encyclopedia of Systems Biology. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4419-9863-7_101447.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

N. Degler, Carl. "The Case of the Origin of the Incest Taboo." In In Search of Human Nature. Oxford University Press, 1993. http://dx.doi.org/10.1093/acprof:oso/9780195077070.003.0010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

ATLI, OMER, and CENGIZ KAHRAMAN. "MULTI MODE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEMS WITH SOLVING TABOO SEARCH." In Uncertainty Modeling in Knowledge Engineering and Decision Making. WORLD SCIENTIFIC, 2012. http://dx.doi.org/10.1142/9789814417747_0072.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bouarara, Hadj Ahmed, Reda Mohamed Hamou, Abdelmalek Amine, and Amine Rahmani. "A Fireworks Algorithm for Modern Web Information Retrieval with Visual Results Mining." In Business Intelligence. IGI Global, 2016. http://dx.doi.org/10.4018/978-1-4666-9562-7.ch034.

Full text
Abstract:
The popularization of computers, the number of electronic documents available online /offline and the explosion of electronic communication have deeply rocked the relationship between man and information. Nowadays, we are awash in a rising tide of information where the web has impacted on almost every aspect of our life. Merely, the development of automatic tools for an efficient access to this huge amount of digital information appears as a necessity. This paper deals on the unveiling of a new web information retrieval system using fireworks algorithm (FWA-IR). It is based on a random explosion of fireworks and a set of operators (displacement, mapping, mutation, and selection). Each explosion of firework is a potential solution for the need of user (query). It generates a set of sparks (documents) with two locations (relevant and irrelevant). The authors experiments were performed on the MEDLARS dataset and using the validation measures (recall, precision, f-measure, silence, noise and accuracy) by studying the sensitive parameters of this technique (initial location number, iteration number, mutation probability, fitness function, selection method, text representation, and distance measure), aimed to show the benefit derived from using such approach compared to the results of others methods existed in literature (taboo search, simulated annealing, and naïve method). Finally, a result-mining tool was achieved for the purpose to see the outcome in graphical form (3d cub and cobweb) with more realism using the functionalities of zooming and rotation.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Taboo search"

1

Zhao, Liang-hui, and Sheng-fa Wang. "Scheduling Flexible Assembly Systems with Taboo Search Algorithm." In 2009 International Conference on Electronic Commerce and Business Intelligence, ECBI. IEEE, 2009. http://dx.doi.org/10.1109/ecbi.2009.109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rao, Yuan, Ru-chuan Wang, and Chang-an Yuan. "Improving Gene Expression Programming Using Parallel Taboo Search." In 2009 Fifth International Conference on Natural Computation. IEEE, 2009. http://dx.doi.org/10.1109/icnc.2009.124.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shuang, Han, Liu Yongqian, and Yang Yongping. "Taboo Search Algorithm Based ANN Model for Wind Speed Prediction." In 2007 2nd IEEE Conference on Industrial Electronics and Applications. IEEE, 2007. http://dx.doi.org/10.1109/iciea.2007.4318883.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Liang, Yuanhua, and Bingcheng Yuan. "Learning Algorithm with Fuzzy Petri Nets Model Based on Taboo Search." In 2009 International Conference on Information Engineering and Computer Science. IEEE, 2009. http://dx.doi.org/10.1109/iciecs.2009.5365991.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ben Mnaouer, Adel, Abdelfettah Belghith, Naouel Ben Ali, and Miklos Molnar. "TabooQMR: A Taboo-based search algorithm improving Mamcra for multicast routing." In 2008 33rd IEEE Conference on Local Computer Networks (LCN 2008). IEEE, 2008. http://dx.doi.org/10.1109/lcn.2008.4664231.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Songyan Zhong, Jizeng Wei, Wei Guo, and Zhenghua Wang. "Instruction scheduling using genetic algorithm with taboo search for TTA-like processors." In 2010 International Conference on Computer Design and Applications (ICCDA 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccda.2010.5541389.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hou, Neng, Fazhi He, Yilin Chen, and Yi Zhou. "An adaptive neighborhood taboo search on GPU for Hardware/Software Co-design." In 2016 IEEE 20th International Conference on Computer Supported Cooperative Work in Design (CSCWD). IEEE, 2016. http://dx.doi.org/10.1109/cscwd.2016.7565995.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Boughaci, Dalila, and Habiba Drias. "Solving weighted Max-Sat optimization problems using a Taboo Scatter Search metaheuristic." In the 2004 ACM symposium. ACM Press, 2004. http://dx.doi.org/10.1145/967900.967910.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Luo, Wenfeng, Jiaxiang Luo, Zijian Mo, Runpeng Liang, and Qingqiang Yang. "The Application of Taboo Search with Kick Strategy in Surface Mounting Arrangement." In 2008 Pacific-Asia Workshop on Computational Intelligence and Industrial Application (PACIIA). IEEE, 2008. http://dx.doi.org/10.1109/paciia.2008.19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ren, C., W. Lu, L. Zhao, C. Yin, and H. Wang. "Hybrid Genetic and Taboo Search Algorithm for Solving the Bus Timetable Problem." In Ninth International Conference of Chinese Transportation Professionals (ICCTP). American Society of Civil Engineers, 2009. http://dx.doi.org/10.1061/41064(358)397.

Full text
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!