Channel routing optimization using a genetic algorithm

A modified approach for the application of Genetic Algorithm (GA) to the Channel Routing Problem has been proposed. The code based on the algorithm proposed in [1] has been implemented for the GA procedures of Initial Population Generation, Crossover, Mutation and Selection. A few improvements over the existing work have been made and the results so far obtained have been encouraging. Further experimentation is being done on the algorithm and other ideas generated during the development of the code are being implemented for faster convergence of the algorithm and for generation of more efficient results. Also application of variations of the GA technique like Vector GA and even other computationally intelligent techniques like Particle Swarm Optimization to the channel routing problem is being thought of

A Parallel Genetic Algorithm for the Set Partitioning Problem

This paper describes a parallel genetic algorithm developed for the solution of the set partitioning problem- a difficult combinatorial optimization problem used by many airlines as a mathematical model for flight crew scheduling. The genetic algorithm is based on an island model where multiple independent subpopulations each run a steady-state genetic algorithm on their own subpopulation and occasionally fit strings migrate between the subpopulations. Tests on forty real-world set partitioning problems were carried out on up to 128 nodes of an IBM SP1 parallel computer. We found that performance, as measured by the quality of the solution found and the iteration on which it was found, improved as additional subpopulations were added to the computation. With larger numbers of subpopulations the genetic algorithm was regularly able to find the optimal solution to problems having up to a few thousand integer variables. In two cases, high- quality integer feasible solutions were found for problems with 36, 699 and 43,749 integer variables, respectively. A notable limitation we found was the difficulty solving problems with many constraints

Performance Analysis of Simulation-based Multi-objective Optimization of Bridge Construction Processes Using High Performance Computing

Bridges constitute a crucial component of urban highways due to the complexity and uncertain nature of their construction process. Simulation is an alternative method of analyzing and planning the construction processes, especially the ones with repetitive and cyclic nature, and it helps managers to make appropriate decisions. Furthermore, there is an inverse relationship between the cost and time of a project and finding a proper trade-off between these two key elements using optimization methods is important. Thus, the integration of simulation models with optimization techniques leads to an advancement in the decision making process. In addition, the large number of resources required in complex and large scale bridge construction projects results in a very large search space. Therefore, there is a need for using parallel computing in order to reduce the computational time of the simulation-based optimization. Most of the construction simulation tools need an integration platform to be combined with optimization techniques. Also, these simulation tools are not usually compatible with Linux environment which is used in most of the massive parallel computing systems or clusters. In this research, an integrated simulation-based optimization framework is proposed within one platform to alleviate those limitations. A master-slave (or global) parallel Genetic Algorithm (GA) is used as a parallel computing technique to decrease the computation time and to efficiently use the full capacity of the computer. In addition, sensitivity analysis is applied to identify the promising configuration for GA and analyzing the impact of GA parameters on the overall performance of the specific simulation-based optimization problem used in this research. Finally, a case study is implemented and tested on a server machine as well as a cluster to explore the feasibility of the proposed approach. The results of this research showed better performance of the proposed framework in comparison with other GA optimization techniques from the points of view of the quality of the optimum solutions and the computation time. Also, acceptable improvements in the computation time were achieved for both deterministic and probabilistic simulation models using master-salve parallel paradigm (8.32 and 20.3 times speedups were achieved using 12 cores, respectively). Moreover, performing the proposed framework on multiple nodes using a cluster system led to 31% saving on the computation time on average. Furthermore, the GA was tuned using sensitivity analyses which resulted in the best parameters (500 generations, population size of 200 and 0.7 as the crossover probability)

High-Quality Hypergraph Partitioning

This dissertation focuses on computing high-quality solutions for the NP-hard balanced hypergraph partitioning problem: Given a hypergraph and an integer $k$, partition its vertex set into $k$ disjoint blocks of bounded size, while minimizing an objective function over the hyperedges. Here, we consider the two most commonly used objectives: the cut-net metric and the connectivity metric. Since the problem is computationally intractable, heuristics are used in practice - the most prominent being the three-phase multi-level paradigm: During coarsening, the hypergraph is successively contracted to obtain a hierarchy of smaller instances. After applying an initial partitioning algorithm to the smallest hypergraph, contraction is undone and, at each level, refinement algorithms try to improve the current solution. With this work, we give a brief overview of the field and present several algorithmic improvements to the multi-level paradigm. Instead of using a logarithmic number of levels like traditional algorithms, we present two coarsening algorithms that create a hierarchy of (nearly) $n$ levels, where $n$ is the number of vertices. This makes consecutive levels as similar as possible and provides many opportunities for refinement algorithms to improve the partition. This approach is made feasible in practice by tailoring all algorithms and data structures to the $n$-level paradigm, and developing lazy-evaluation techniques, caching mechanisms and early stopping criteria to speed up the partitioning process. Furthermore, we propose a sparsification algorithm based on locality-sensitive hashing that improves the running time for hypergraphs with large hyperedges, and show that incorporating global information about the community structure into the coarsening process improves quality. Moreover, we present a portfolio-based initial partitioning approach, and propose three refinement algorithms. Two are based on the Fiduccia-Mattheyses (FM) heuristic, but perform a highly localized search at each level. While one is designed for two-way partitioning, the other is the first FM-style algorithm that can be efficiently employed in the multi-level setting to directly improve $k$-way partitions. The third algorithm uses max-flow computations on pairs of blocks to refine $k$-way partitions. Finally, we present the first memetic multi-level hypergraph partitioning algorithm for an extensive exploration of the global solution space. All contributions are made available through our open-source framework KaHyPar. In a comprehensive experimental study, we compare KaHyPar with hMETIS, PaToH, Mondriaan, Zoltan-AlgD, and HYPE on a wide range of hypergraphs from several application areas. Our results indicate that KaHyPar, already without the memetic component, computes better solutions than all competing algorithms for both the cut-net and the connectivity metric, while being faster than Zoltan-AlgD and equally fast as hMETIS. Moreover, KaHyPar compares favorably with the current best graph partitioning system KaFFPa - both in terms of solution quality and running time