Filters








20,851 Hits in 11.3 sec

A Parallel Genetic Algorithm for the Set Partitioning Problem [chapter]

David Levine
1996 Meta-Heuristics  
CHAPTER II SEQUENTIAL GENETIC ALGORITHM The motivation for the work presented in this chapter was to develop a sequential genetic algorithm that worked well on the set partitioning problem.  ...  Genetic algorithms can provide flexibility in handling variations of the model that may be useful.  ... 
doi:10.1007/978-1-4613-1361-8_2 fatcat:y3r4lvwrkve7tbduh3i46aitvy

The Fleet Size and Mix Vehicle Routing Problem with Backhauls: Formulation and Set Partitioning-based Heuristics

Said Salhi, Niaz Wassan, Mutaz Hajarat
2013 Transportation Research Part E: Logistics and Transportation Review  
In this paper we also propose a Set Partitioning Problem (SPP) based heuristic. Three frameworks are developed and tested on a set of new FSMVRPB data instances which we generated.  ...  In this paper we present a new variant of the classical Vehicle Routing Problemthe Fleet Size and Mix Vehicle Routing Problem with Backhauls (FSMVRPB). An ILP formulation of the FSMVRPB is presented.  ...  Acknowledgments-We would like to thank the editor and the referees for their valuable comments and suggestions that improved both the content as well as the presentation of the paper.  ... 
doi:10.1016/j.tre.2013.05.005 fatcat:wqkxiryoi5by3doibzwyzbzh7q

Normalization in Genetic Algorithms [chapter]

Sung-Soon Choi, Byung-Ro Moon
2003 Lecture Notes in Computer Science  
It is a method for alleviating difficulties caused by redundant encodings in genetic algorithms. We show that normalization plays a role of reducing the search space to another one of less size.  ...  Normalization is an approach that transforms the genotype of one parent to be consistent with that of the other parent.  ...  The authors thank Jong-Pil Kim and Yong-Hyuk Kim for insightful discussions about graph partitioning problem.  ... 
doi:10.1007/3-540-45105-6_99 fatcat:5bbgdqyazvdzllrq54tq4l73zy

Memetic Algorithms for Nurse Rostering [chapter]

Ender Özcan
2005 Lecture Notes in Computer Science  
In this paper, a real case of a nurse rostering problem is introduced.  ...  The goal is finding high quality shift and resource assignments, satisfying the needs and requirements of employees as well as the employers in healthcare institutions.  ...  Acknowledgement Author thanks Özgür Kelemci for modifying GAlib and obtaining the real data.  ... 
doi:10.1007/11569596_51 fatcat:46vxqvvlqfd6tecoz2pvajyu24

Graph partitioning through a multi-objective evolutionary algorithm

Dilip Datta, Jose Rui Figueira, Carlos M. Fonseca, Fernando Tavares-Pereira
2008 Proceedings of the 10th annual conference on Genetic and evolutionary computation - GECCO '08  
In the present work, a multi-objective evolutionary algorithm (MOEA), a kind of heuristic techniques, is developed for partitioning a graph under multiple objectives and constraints.  ...  The graph partitioning problem has numerous applications in various scientific fields.  ...  NSGA-II FOR THE GRAPH PARTITION-ING PROBLEM The Non-dominated Sorting Genetic Algorithm-II [9, 10], or NSGA-II in short, which is a very popular MOEA because of its successful application to a wide range  ... 
doi:10.1145/1389095.1389222 dblp:conf/gecco/DattaFFT08 fatcat:kqhwdi7k5nhrzbhwxqrszgiqiy

Scalable Graph Algorithms [article]

Christian Schulz
2019 arXiv   pre-print
Designing and evaluating scalable graph algorithms to handle these data sets is a crucial task on the road to understanding the underlying systems.  ...  In general, this research is based on four pillars: multilevel algorithms, practical kernelization, parallelization and memetic algorithms that are highly interconnected.  ...  While the grants are acknowledged in the individual papers, we also acknowledge them here.  ... 
arXiv:1912.00245v1 fatcat:mop2e6pqtnbr7irkrakraael6a

Optimizing cluster-head selection in Wireless Sensor Networks using Genetic Algorithm and Harmony Search Algorithm

Mohammad Karimi, Hamid Reza Naji, Shahrzad Golestani
2012 20th Iranian Conference on Electrical Engineering (ICEE2012)  
We improved the energy consumption by partitioning the network and using the evolutionary algorithms for optimized cluster head selection considering WSN nodes' position information and residual energy  ...  The simulation results performed in MATLAB shows that our proposed algorithms are more efficient and they increased the lifetime of the network.  ...  The problem must be represented in a suitable form to be handled by the GA. Thus, the problem is described in terms of genetic code, like DNA chromosomes [14] .  ... 
doi:10.1109/iraniancee.2012.6292445 fatcat:2ga2vuh6gff4vlfzbmcim556ay

Towards hybrid evolutionary algorithms

P. Preux, E.-G. Talbi
1999 International Transactions in Operational Research  
We wish to explain the behavior of search algorithms with this knowledge and provide guidelines in the design of hybrid algorithms.  ...  In order to add some rational to these issues, we study the structure of search spaces and attempt to relate it to the performance of algorithms.  ...  In [5] , a PSH algorithm has been used for the multi-constraint knapsack problem and the set covering problem.  ... 
doi:10.1111/j.1475-3995.1999.tb00173.x fatcat:axqcpomtujcx5fd23rsnwqo54m

Towards hybrid evolutionary algorithms

P Preux
1999 International Transactions in Operational Research  
We wish to explain the behavior of search algorithms with this knowledge and provide guidelines in the design of hybrid algorithms.  ...  In order to add some rational to these issues, we study the structure of search spaces and attempt to relate it to the performance of algorithms.  ...  In [5] , a PSH algorithm has been used for the multi-constraint knapsack problem and the set covering problem.  ... 
doi:10.1016/s0969-6016(99)00019-2 fatcat:cr525zd6hvgg3gfe55642t5jsi

A Survey Of Various Algorithms For Vlsi Physical Design

Rajine Swetha R, B. Shekar Babu, Sumithra Devi K.A
2011 Zenodo  
The objective of the Genetic Algorithms (GA) is to find an optimal solution to a problem .Since GA-s are heuristic procedures that can function as optimizers, they are not guaranteed to find the optimum  ...  Physical design problems are combinatorial in nature and of large problem sizes.  ...  GENETIC PARTITIONING ALGORITHMS Problem of VLSI circuit partitioning is non polynomial, hard and cannot be effectively solved by deterministic algorithms.  ... 
doi:10.5281/zenodo.1072432 fatcat:27mlwxiy4zhkteeml6vimmus7a

Evolutionary algorithms for constrained engineering problems

Zbigniew Michalewicz, Dipankar Dasgupta, Rodolphe G. Le Riche, Marc Schoenauer
1996 Computers & industrial engineering  
In this paper we concentrate on constraint handling heuristics for evolutionary computation techniques.  ...  Industrial engineering problems usually are quite hard to solve due to a high complexity of the objective functions and a signicant number of problem-specic constraints; often an algorithm to solve such  ...  The segregated genetic algorithm 4.2.1 Motivations As it was seen in Section 2, a general approach to handling constraints in evolutionary computation techniques is the use of penalty functions.  ... 
doi:10.1016/0360-8352(96)00037-x fatcat:aimimi6atre73ngphoqcjjh23e

Scaling Genetic Algorithms Using MapReduce

Abhishek Verma, Xavier Llorà, David E. Goldberg, Roy H. Campbell
2009 2009 Ninth International Conference on Intelligent Systems Design and Applications  
In this paper, we mould genetic algorithms into the the MapReduce model. We describe the algorithm design and implementation of GAs on Hadoop, the open source implementation of MapReduce.  ...  Adding more resources would enable us to solve even larger problems without any changes in the algorithms and implementation.  ...  Acknowledgments This work was funded, in part, by NSF IIS Grant #0841765.  ... 
doi:10.1109/isda.2009.181 dblp:conf/isda/VermaLGC09 fatcat:c3ik5hnnh5ghvfveeb5fz4flxm

A Research on Different Clustering Algorithms and Techniques

M. Pavithra, P. Nandhini, R. Suganya
2018 International Journal of Trend in Scientific Research and Development  
This survey mainly focuses on partition based clustering algorithms namely k k-Medoids and Fuzzy c-Means In particular; they applied mostly in medical data sets.  ...  In this paper, the partitioning clustering method is introduced, the procedure of t algorithms is described, and finally the new improved methods and the proposed solutions to solve these challenges are  ...  This survey mainly focuses on partition based clustering algorithms namely k-Means, Means In particular; they applied mostly in medical data sets.  ... 
doi:10.31142/ijtsrd15899 fatcat:g6gbugoa7ze3rg3cggscjwshy4

Parallel genetic algorithm implementation in multidisciplinary rotor blade design

Jongsoo Lee, Prabhat Hajela
1996 Journal of Aircraft  
Also, let the design constraints g,(X) belong to the global constraint set G. The vector X and constraint set G are said to define a system level problem.  ...  A total of only seven constraints was considered in the optimal problem partitioning, as constraints for local buckling were arbitrarily assigned to the same set of design variables that LEE AND HAJELA  ... 
doi:10.2514/3.47042 fatcat:kbi6ygkx2vayldmbbd3l4ygr6a

Efficient Algorithms for General Isotone Optimization

Xiwen Wang, Jiaxi Ying, José Vinícius de M. Cardoso, Daniel P. Palomar
2022 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
The proposed algorithm is general in the sense that it can handle any arbitrary isotonic constraints and a wide range of objective functions.  ...  In this paper, we develop an efficient, provable convergent algorithm for solving isotone optimization problems.  ...  Acknowledgments This work was supported by the Hong Kong GRF 16207820 research grant. We are appreciative of the feedback provided by reviewers and many of our colleagues.  ... 
doi:10.1609/aaai.v36i8.20835 fatcat:37f2wycyhvbr3fomkcnei2xopa
« Previous Showing results 1 — 15 out of 20,851 results