Search results for: hard problem

Authors: Francis Ogonyi Ekaya

Abstract:

In modern cognitive science and philosophy, the study of consciousness continues to be one of the most profound and mysterious fields. The aim of this study is to attempt a move away from David Chalmers' "hard problem" of consciousness, which is a theory that focuses on the question of how subjective experience results from physical processes and instead offers a framework for comprehending consciousness from a quantum mechanical perspective. Though informative, classical models of the brain and cognition might not have adequately captured the intricacies of conscious experience. Therefore, by invoking quantum consciousness, the study aims to investigate how phenomena such as superposition, entanglement, and non-locality may offer a more nuanced explanation of consciousness beyond classical constraints, which could also potentially serve as a new diversion from the hard problem. Relying on textual and contextual analysis, the study contends that Chalmers's hard problem only arises when consciousness is limited to personal subjective experiences. In contrast, when viewed through a quantum lens, individual experiences, including emotions, feelings, and even pain, are only a small portion of a greater pool of consciousness that permeates reality as a whole. This further suggests that a quantum perspective on consciousness could provide a fresh framework that looks beyond the conventional limitations of Chalmers' hard problem in the direction of a more comprehensive explanation of conscious experience.

Keywords: consciousness, entanglement, hard problem, quantum mechanics

Procedia PDF Downloads 0

Authors: Gurjinder Singh Randhawa, Jonny Garg, Sukhraj Singh, Gurmeet Singh Cheema

Abstract:

A major problem related to the use of rotavator is wear of rotavator blades due to abrasion by soil hard particles, as it seriously affects tillage quality and agricultural production economy. The objective of this study was to increase the wear resistance by covering the rotavator blades with two different hard facing electrodes. These blades are generally produced from low carbon or low alloy steel. During the field work i.e. preparing land for the cultivation these blades are subjected to severe wear conditions. Comparative wear tests on a regular rotavator blade and two kinds of hardfacing with electrodes were conducted in the field. These two different hardfacing electrodes, which are designated HARD ALLOY-400 and HARD ALLOY-650, were used for hardfacing. The wear rate in the field tests was found to be significantly different statistically. When the cost is taken into consideration; HARD ALLOY-650 and HARD ALLOY-400 have been found to be the best hardfacing electrodes.

Keywords: hardfacing, rotavator blades, hard alloy-400, abrasive wear

Procedia PDF Downloads 431

Authors: Imen Boudali, Marwa Ragmoun

Abstract:

The Vehicle Routing Problem with Hard Time Windows (VRPHTW) is a basic distribution management problem that models many real-world problems. The objective of the problem is to deliver a set of customers with known demands on minimum-cost vehicle routes while satisfying vehicle capacity and hard time windows for customers. In this paper, we propose to deal with our optimization problem by using a new hybrid stochastic algorithm based on two metaheuristics: Chemical Reaction Optimization (CRO) and Greedy Randomized Adaptive Search Procedure (GRASP). The first method is inspired by the natural process of chemical reactions enabling the transformation of unstable substances with excessive energy to stable ones. During this process, the molecules interact with each other through a series of elementary reactions to reach minimum energy for their existence. This property is embedded in CRO to solve the VRPHTW. In order to enhance the population diversity throughout the search process, we integrated the GRASP in our method. Simulation results on the base of Solomon’s benchmark instances show the very satisfactory performances of the proposed approach.

Keywords: Benchmark Problems, Combinatorial Optimization, Vehicle Routing Problem with Hard Time Windows, Meta-heuristics, Hybridization, GRASP, CRO

Procedia PDF Downloads 416

Authors: P. Parthiban, Sonu Rajak, R. Dhanalakshmi

Abstract:

This paper presents an Ant Colony Optimization (ACO) approach, combined with a Speed Optimization Algorithm (SOA) to solve the Vehicle Routing Problem (VRP) with environmental considerations, which is well known as Pollution-Routing Problem (PRP). It consists of routing a number of vehicles to serve a set of customers, and determining fuel consumption, driver wages and their speed on each route segment, while respecting the capacity constraints and time windows. Since VRP is NP-hard problem, so PRP also a NP-hard problem, which requires metaheuristics to solve this type of problems. The proposed solution method consists of two stages. Stage one is to solve a Vehicle Routing Problem with Time Window (VRPTW) using ACO and in the second stage, a SOA is run on the resulting VRPTW solution. Given a vehicle route, the SOA consists of finding the optimal speed on each arc of the route to minimize an objective function comprising fuel consumption costs and driver wages. The proposed algorithm tested on benchmark problem, the preliminary results show that the proposed algorithm can provide good solutions within reasonable computational time.

Keywords: ant colony optimization, CO2 emissions, speed optimization, vehicle routing

Procedia PDF Downloads 365

Authors: Kenza Aida Amara, Bachir Djebbar

Abstract:

We treat the two-dimensional bin packing problem which involves packing a given set of rectangles into a minimum number of larger identical rectangles called bins. This combinatorial problem is NP-hard. We propose a pretreatment for the oriented version of the problem that allows the valorization of the lost areas in the bins and the reduction of the size problem. A heuristic method based on the strategy first-fit adapted to this problem is presented. We present an approach of resolution by bee colony optimization. Computational results express a comparison of the number of bins used with and without pretreatment.

Keywords: bee colony optimization, bin packing, heuristic algorithm, pretreatment

Procedia PDF Downloads 640

Authors: Miroslav Čulík, Petr Gurný

Abstract:

This paper is aimed at the financial assessment of the hard coal mining in a given region by real option methodology application. Hard coal mining in this mine makes net loss for the owner during the last years due to the long-term unfavourable mining conditions and significant drop in the coal prices during the last years. Management is going to shut down the operation and abandon the project to reduce the loss of the company. The goal is to assess whether the shutting down the operation is the only and correct solution of the problem. Due to the uncertainty in the future hard coal price evolution, the production might be again restarted if the price raises enough to cover the cost of the production. For the assessment, real option methodology is applied, which captures two important aspect of the financial decision-making: risk and flexibility. The paper is structured as follows: first, current state is described and problem is analysed. Next, methodology of real options is described. At last, project is evaluated by applying real option methodology. The results are commented and recommendations are provided.

Keywords: real option, investment, option to abandon, option to shut down and restart, risk, flexibility

Procedia PDF Downloads 552

Authors: Divyesh Patel, Tanuja Srivastava

Abstract:

This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results are presented.

Keywords: discrete tomography, exactly-1-4-adjacency, simulated annealing, binary matrices

Procedia PDF Downloads 410

Authors: H. R. Kamali, A. Sadegheih, M. A. Vahdat-Zad, H. Khademi-Zare

Abstract:

In this paper, a single product, multi-echelon, multi-period closed loop supply chain is surveyed, including a variety of costs, time conditions, and capacities, to plan and determine the values and time of the components procurement, production, distribution, recycling and disposal specially for high-tech products that undergo a decreasing production cost and sale price over time. For this purpose, the mathematic model of the problem that is a kind of mixed integer linear programming is presented, and it is finally proved that the problem belongs to the category of NP-hard problems.

Keywords: closed loop supply chain, continuous price decrease, NP-hard, planning

Procedia PDF Downloads 367

Authors: Guilherme Baldo Carlos

Abstract:

The flexible job-shop scheduling problem (FJSP) is an NP-hard combinatorial optimization problem, which can be applied to model several applications in a wide array of industries. This problem will have its importance increase due to the shift in the production mode that modern society is going through. The demands are increasing and for products personalized and customized. This work aims to apply a meta-heuristic called a genetic algorithm (GA) to solve this problem. A GA is a meta-heuristic inspired by the natural selection of Charles Darwin; it produces a population of individuals (solutions) and selects, mutates, and mates the individuals through generations in order to find a good solution for the problem. The results found indicate that the GA is suitable for FJSP solving.

Keywords: genetic algorithm, evolutionary algorithm, scheduling, flexible job-shop scheduling

Procedia PDF Downloads 151

Authors: Rupan Das Chakraborty, Surendra K. Martha

Abstract:

Hard carbons (HCs) are extensively used as anode materials for sodium-ion batteries due to their availability, low cost, and ease of synthesis. It possesses the ability to store Na ion between stacked sp2 carbon layers and micropores. In this work, hard carbons are synthesized from different concentrations (0.5M to 5M) of dextrose solutions by hydrothermal synthesis followed by high-temperature calcination at 1100 ⁰C in an inert atmosphere. Dextrose has been chosen as a precursor material as it is a eco-friendly and renewable source. Among all hard carbon derived from different concentrations of dextrose solutions, hard carbon derived from 3M dextrose solution delivers superior electrochemical performance compared to other hard carbons. Hard carbon derived from 3M dextrose solution (Dextrose derived Hard Carbon-3M) provides an initial reversible capacity of 257 mAh g-1 with a capacity retention of 83 % at the end of 100 cycles at 30 mA g-1). The carbons obtained from different dextrose concentration show very similar Cyclic Voltammetry and chargedischarging behavior at a scan rate of 0.05 mV s-1 the Cyclic Voltammetry curve indicate that solvent reduction and the solid electrolyte interface (SEI) formation start at E < 1.2 V (vs Na/Na+). Among all 3M dextrose derived electrode indicate as a promising anode material for Sodium-ion batteries (SIBs).

Keywords: dextrose derived hard carbon, anode, sodium-ion battery, electrochemical performance

Procedia PDF Downloads 121

Authors: Antonin Ponsich, Eric Alfredo Rincon Garcia, Roman Anselmo Mora Gutierrez, Miguel Angel Gutierrez Andrade, Sergio Gerardo De Los Cobos Silva, Pedro Lara Velzquez

Abstract:

The electoral zone design problem consists in redrawing the boundaries of legislative districts for electoral purposes in such a way that federal or state requirements are fulfilled. In Mexico, this process has been historically carried out by the National Electoral Institute (INE), by optimizing an integer nonlinear programming model, in which population equality and compactness of the designed districts are considered as two conflicting objective functions, while contiguity is included as a hard constraint. The solution technique used by the INE is a Simulated Annealing (SA) based algorithm, which handles the multi-objective nature of the problem through an aggregation function. The present work represents the first intent to apply a classical Multi-Objective Evolutionary Algorithm (MOEA), the second version of the Non-dominated Sorting Genetic Algorithm (NSGA-II), to this hard combinatorial problem. First results show that, when compared with the SA algorithm, the NSGA-II obtains promising results. The MOEA manages to produce well-distributed solutions over a wide-spread front, even though some convergence troubles for some instances constitute an issue, which should be corrected in future adaptations of MOEAs to the redistricting problem.

Keywords: multi-objective optimization, NSGA-II, redistricting, zone design problem

Procedia PDF Downloads 371

Authors: Sautma Ronni Basana, Zeplin Jiwa Husada Tarigan, Widjojo Suprapto

Abstract:

Companies have already implemented the Enterprise Resource Planning (ERP) system to increase the data integration so that they can improve their business performance. Although some companies have managed to implement the ERP well, they still need to improve gradually so that the ERP functions can be optimized. To obtain a faster and more accurate data, the key users and IT department have to customize the process to suit the needs of the company. In reality, sustaining the ERP technology system requires soft and hard ERP so it enables to improve the business performance of the company. Soft and hard ERP are needed to build a tough system to ensure the integration among departments running smoothly. This research has three questions. First, is the soft ERP bringing impacts to the hard ERP and system integration. Then, is the hard ERP having impacts to the system integration. Finally, is the business performance of the manufacturing companies is affected by the soft ERP, hard ERP, and system integration. The questionnaires are distributed to 100 manufacturing companies in East Java, and are collected from 90 companies which have implemented the ERP, with the response rate of 90%. From the data analysis using PLS program, it is obtained that the soft ERP brings positive impacts to the hard ERP and system integration for the companies. Then, the hard ERP brings also positive impacts to the system integration. Finally, the business process performance of the manufacturing companies is affected by the system integration, soft ERP, and hard ERP simultaneously.

Keywords: soft ERP, hard ERP, system integration, business performance

Procedia PDF Downloads 409

Authors: Mahnaz Hosseinzadeh, Mohammad Reza Mehregan

Abstract:

In this paper, we have developed a morphological field to assist multi- methodology (combining methodologies together in whole or part) in Operations Research (OR) for the problem contexts in Iranian organizations. So, we have attempted to identify some dimensions for problem context according to Iranian organizational problems. Then, a general morphological program is designed which helps the OR practitioner to determine the suitable OR methodology as output for any configuration of conditions in a problem context as input and to reveal the fields necessary to be improved in OR. Applying such a program would have interesting results for OR practitioners.

Keywords: hard, soft and emancipatory operations research, General Morphological Analysis (GMA), multi-methodology, problem context

Procedia PDF Downloads 303

Authors: Derkaoui Orkia, Lehireche Ahmed

Abstract:

The topic of this article is to exploring the potentialities of a powerful optimization technique, namely Semidefinite Programming, for solving NP-hard problems. This approach provides tight relaxations of combinatorial and quadratic problems. In this work, we solve the maximum clique problem using this relaxation. The clique problem is the computational problem of finding cliques in a graph. It is widely acknowledged for its many applications in real-world problems. The numerical results show that it is possible to find a maximum clique in polynomial time, using an algorithm based on semidefinite programming. We implement a primal-dual interior points algorithm to solve this problem based on semidefinite programming. The semidefinite relaxation of this problem can be solved in polynomial time.

Keywords: semidefinite programming, maximum clique problem, primal-dual interior point method, relaxation

Procedia PDF Downloads 224

Authors: Broderick Crawford, Ricardo Soto, Natalia Berrios, Eduardo Olguin

Abstract:

In this paper, we present a binary cat swarm optimization for solving the Set covering problem. The set covering problem is a well-known NP-hard problem with many practical applications, including those involving scheduling, production planning and location problems. Binary cat swarm optimization is a recent swarm metaheuristic technique based on the behavior of discrete cats. Domestic cats show the ability to hunt and are curious about moving objects. The cats have two modes of behavior: seeking mode and tracing mode. We illustrate this approach with 65 instances of the problem from the OR-Library. Moreover, we solve this problem with 40 new binarization techniques and we select the technical with the best results obtained. Finally, we make a comparison between results obtained in previous studies and the new binarization technique, that is, with roulette wheel as transfer function and V3 as discretization technique.

Keywords: binary cat swarm optimization, binarization methods, metaheuristic, set covering problem

Procedia PDF Downloads 400

Authors: S. Nasri, H. Bouziri

Abstract:

Disasters are quite experienced in our days. They are caused by floods, landslides, and building fires that is the main objective of this study. To cope with these unexpected events, precautions must be taken to protect human lives. The emphasis on disposal work focuses on the resolution of the evacuation problem in case of no-notice disaster. The problem of evacuation is listed as a dynamic network flow problem. Particularly, we model the evacuation problem as an earliest arrival flow problem with load dependent transit time. This problem is classified as NP-Hard. Our challenge here is to propose a metaheuristic solution for solving the evacuation problem. We define our objective as the maximization of evacuees during earliest periods of a time horizon T. The objective provides the evacuation of persons as soon as possible. We performed an experimental study on emergency evacuation from the tunisian children’s hospital. This work prompts us to look for evacuation plans corresponding to several situations where the network dynamically changes.

Keywords: dynamic network flow, load dependent transit time, evacuation strategy, earliest arrival flow problem, tabu search metaheuristic

Procedia PDF Downloads 374

Authors: Zaid Jamal Saeed Almahmoud

Abstract:

Smart grid is emerging as the future power grid, with smart techniques to optimize power consumption and electricity generation. Minimizing peak power consumption under a fixed delay requirement is a significant problem in the smart grid.For this problem, all appliances must be scheduled within a given finite time duration. We consider the problem of minimizing the peak demand under appliances constraints by scheduling power jobs with uniform release dates and deadlines. As the problem is known to be NP-hard, we analyze the performance of a version of the natural greedy heuristic for solving this problem. Our theoretical analysis and experimental results show that the proposed heuristic outperforms existing methods by providing a better approximation to the optimal solution.

Keywords: peak demand scheduling, approximation algorithms, smart grid, heuristics

Procedia PDF Downloads 101

Authors: Kaewkarn Phuangsombat, Arthit Phuangsombat, Anupun Terdwongworakul

Abstract:

Hard seeds will not grow and can cause mold in sprouting process. Thus, the hard seeds need to be separated from the normal seeds. Near infrared hyperspectral imaging in a range of 900 to 1700 nm was implemented to develop a model by partial least squares discriminant analysis to discriminate the hard seeds from the normal seeds. The orientation of the seeds was also studied to compare the performance of the models. The model based on hilum-up orientation achieved the best result giving the coefficient of determination of 0.98, and root mean square error of prediction of 0.07 with classification accuracy was equal to 100%.

Keywords: mung bean, near infrared, germinatability, hard seed

Procedia PDF Downloads 309

Authors: Tarek Aboueldahab, Hanan Farag

Abstract:

Cost minimization of Multiple Vehicle Routing Problem becomes a critical issue in the field of transportation because it is NP-hard optimization problem and the search space is complex. Many researches use the hybridization of artificial intelligence (AI) models to solve this problem; however, it can not guarantee to reach the best solution due to the difficulty of searching the whole search space. To overcome this problem, we introduce the hybrid model of Discrete Particle Swarm Optimization (DPSO) with a passive congregation which enable searching the whole search space to compromise between both local and global search. The practical experiment shows that our model obviously outperforms other hybrid models in cost minimization.

Keywords: cost minimization, multi-vehicle routing problem, passive congregation, discrete swarm, passive congregation

Procedia PDF Downloads 103

Authors: Nor Wahiza Abdul Wahat, Nor Haniza Abdul Wahat, Siti Noormi Alias, Mohamad Sazali Shaari

Abstract:

This study prepares the groundwork for the development of a strategic model and instrument for workplace inclusivity for deaf and hard-of-hearing employees in Malaysia. In the past, scholars have discussed inclusivity of workplaces to the extent to which employees feel they are significantly part of the organizational processes. Such processes include access to information, connectedness to colleagues and team members as well as their ability to participate in and influence decision-making processes. A qualitative study was conducted to explore on experiences of employed deaf and hard-of-hearing employees in a few Malaysian organizations. Data were collected from two focus group discussions involving male and female deaf and hard of hearing employees. Three in-depth interviews were also conducted with employer representatives. Generated themes highlighted individual, and team approaches towards crafting workplace inclusivity for deaf and hard of hearing employees in Malaysia. The adaptiveness of deaf and hard-of-hearing employees and social inclusion by colleagues were among the emerged sub-themes. This study allowed the researchers to further develop workplace inclusivity instruments and models for the benefit of deaf and hard of hearing Malaysian employees, as well as their employers.

Keywords: deaf, hard of hearing, workplace inclusivity, disabilities

Procedia PDF Downloads 178

Authors: F. Debbat, F. T. Bendimerad

Abstract:

The efficient frequency assignment for radio communications becomes more and more crucial when developing new information technologies and their applications. It is consists in defining an assignment of frequencies to radio links, to be established between base stations and mobile transmitters. Separation of the frequencies assigned is necessary to avoid interference. However, unnecessary separation causes an excess requirement for spectrum, the cost of which may be very high. This problem is NP-hard problem which cannot be solved by conventional optimization algorithms. It is therefore necessary to use metaheuristic methods to solve it. This paper proposes Hybrid approach based on simulated annealing (SA) and Tabu Search (TS) methods to solve this problem. Computational results, obtained on a number of standard problem instances, testify the effectiveness of the proposed approach.

Keywords: cellular mobile communication, frequency assignment problem, optimization, tabu search, simulated annealing

Procedia PDF Downloads 392

Authors: Majid Abdolrazzagh-Nezhad, Salwani Abdullah

Abstract:

The job-shop scheduling problem (JSSP) is an important decision facing those involved in the fields of industry, economics and management. This problem is a class of combinational optimization problem known as the NP-hard problem. JSSPs deal with a set of machines and a set of jobs with various predetermined routes through the machines, where the objective is to assemble a schedule of jobs that minimizes certain criteria such as makespan, maximum lateness, and total weighted tardiness. Over the past several decades, interest in meta-heuristic approaches to address JSSPs has increased due to the ability of these approaches to generate solutions which are better than those generated from heuristics alone. This article provides the classification, constraints and objective functions imposed on JSSPs that are available in the literature.

Keywords: job-shop scheduling, classification, constraints, objective functions

Procedia PDF Downloads 451

Authors: Gülşah Çelik Gül, Figen Kurtuluş

Abstract:

The first laboratory synthesis of hard materials such as diamond proceeded to attack of developing materials with high hardness to compete diamond. Boron rich solids are good candidates owing to their short interatomic bond lengths and strong covalent character. Boron containing hard material was synthesized by modified-microwave method under nitrogen atmosphere by using a fuel (glycine or urea), amorphous boron and/or boric acid in appropriate molar ratio. Characterizations were done by x-ray diffraction (XRD), fourier transform infrared (FTIR) spectroscopy, scanning electron microscopy/energy dispersive analyze (SEM/EDS), thermo gravimetric/differantial thermal analysis (TG/DTA).

Keywords: boron containing materials, hard materials, microwave synthesis, powder X-ray diffraction

Procedia PDF Downloads 597

Authors: Elham Kazemi

Abstract:

Quadratic Assignment Problem (QAP) is one the combinatorial optimization problems about which research has been done in many companies for allocating some facilities to some locations. The issue of particular importance in this process is the costs of this allocation and the attempt in this problem is to minimize this group of costs. Since the QAP’s are from NP-hard problem, they cannot be solved by exact solution methods. Cuckoo Optimization Algorithm is a Meta-heuristicmethod which has higher capability to find the global optimal points. It is an algorithm which is basically raised to search a continuous space. The Quadratic Assignment Problem is the issue which can be solved in the discrete space, thus the standard arithmetic operators of Cuckoo Optimization Algorithm need to be redefined on the discrete space in order to apply the Cuckoo Optimization Algorithm on the discrete searching space. This paper represents the way of discretizing the Cuckoo optimization algorithm for solving the quadratic assignment problem.

Keywords: Quadratic Assignment Problem (QAP), Discrete Cuckoo Optimization Algorithm (DCOA), meta-heuristic algorithms, optimization algorithms

Procedia PDF Downloads 524

Authors: Norhayati Mohd Rasip, Abd. Samad Hasan Basari , Nuzulha Khilwani Ibrahim, Burairah Hussin

Abstract:

The allocation of working schedule especially for shift environment is hard to fulfill its fairness among them. In the case of nurse scheduling, to set up the working time table for them is time consuming and complicated, which consider many factors including rules, regulation and human factor. The scenario is more complicated since most nurses are women which have personnel constraints and maternity leave factors. The undesirable schedule can affect the nurse productivity, social life and the absenteeism can significantly as well affect patient's life. This paper aimed to enhance the scheduling process by utilizing the particle swarm optimization in order to solve nurse scheduling problem. The result shows that the generated multiple initial schedule is fulfilled the requirements and produces the lowest cost of constraint violation.

Keywords: nurse scheduling, particle swarm optimisation, nurse rostering, hard and soft constraint

Procedia PDF Downloads 380

Authors: Lydia Wahid, Mona F. Ahmed, Nevin Darwish

Abstract:

The vehicle routing problem (VRP) consists of a group of customers that needs to be served. Each customer has a certain demand of goods. A central depot having a fleet of vehicles is responsible for supplying the customers with their demands. The problem is composed of two subproblems: The first subproblem is an assignment problem where the number of vehicles that will be used as well as the customers assigned to each vehicle are determined. The second subproblem is the routing problem in which for each vehicle having a number of customers assigned to it, the order of visits of the customers is determined. Optimal number of vehicles, as well as optimal total distance, should be achieved. In this paper, an approach for solving the first subproblem (the assignment problem) is presented. In the approach, a clustering algorithm is proposed for finding the optimal number of vehicles by grouping the customers into clusters where each cluster is visited by one vehicle. Finding the optimal number of clusters is NP-hard. This work presents a polynomial time clustering algorithm for finding the optimal number of clusters and solving the assignment problem.

Keywords: vehicle routing problems, clustering algorithms, Clarke and Wright Saving Method, agglomerative hierarchical clustering

Procedia PDF Downloads 398

Authors: Wuthichai Wongthatsanekorn, Nuntana Matheekrieangkrai

Abstract:

This research proposes Bee Algorithm (BA) to optimize Ready Mixed Concrete (RMC) truck scheduling problem from single batch plant to multiple construction sites. This problem is considered as an NP-hard constrained combinatorial optimization problem. This paper provides the details of the RMC dispatching process and its related constraints. BA was then developed to minimize total waiting time of RMC trucks while satisfying all constraints. The performance of BA is then evaluated on two benchmark problems (3 and 5construction sites) according to previous researchers. The simulation results of BA are compared in term of efficiency and accuracy with Genetic Algorithm (GA) and all problems show that BA approach outperforms GA in term of efficiency and accuracy to obtain optimal solution. Hence, BA approach could be practically implemented to obtain the best schedule.

Keywords: bee colony optimization, ready mixed concrete problem, ruck scheduling, multiple construction sites

Procedia PDF Downloads 388

Authors: R. Fernandez-Saavedra, M. B. Gomez-Mancebo, D. Gomez-Briceno

Abstract:

The gradual corrosion of PWR (Pressurized Water Reactor) feedwater, condensate and drain systems results in the inevitable liberation of corrosion products, principally metallic oxides, to the secondary circuit. In addition, other contaminants and impurities are introduced into the makeup water, auxiliary feedwater and by condenser leaks. All these compounds circulating in the secondary flow can eventually be transported to steam generators and be transformed into deposits on their surfaces. Deposits that accumulate on the tube sheet are known as sludge piles and when they consolidate and harden become into hard sludge. Hard sludge is especially detrimental because it favors tube deformation or denting at the top of tube sheet and further stress corrosion cracking (SCC). These failures affect the efficiency of nuclear power plants. In a recent work, a model for the formation and consolidation of hard sludge has been formulated, highlighting the influence of aluminum and silicon compounds in the initial formation of hard sludge. In this work, an experimental study has been performed in order to get a deeper understanding of the behavior of Al and Si species in hard sludge formation and consolidation. For this purpose, the key components of hard sludge (magnetite, aluminum and/or silicon sources) have been isothermally autoclaved in representative secondary circuit conditions during one week, and the resulting products have been chemically and structurally characterized by XRF and XRD techniques, respectively.

Keywords: consolidation, hard sludge, secondary circuit, steam generator

Procedia PDF Downloads 194

Authors: N. Kekelidze, B. Kvirkvelia, E. Khutsishvili, T. Qamushadze, D. Kekelidze, R. Kobaidze, Z. Chubinishvili, N. Qobulashvili, G. Kekelidze

Abstract:

On the basis of InAs, InP and their InP_xAs_1-x solid solutions, the technologies were developed and materials were created where the electron concentration and optical and thermoelectric properties do not change under the irradiation with Ф = 2∙10¹⁸ n/cm² fluences of fast neutrons high-energy electrons (50 MeV, Ф = 6·10¹⁷ e/cm²) and 3 MeV electrons with fluence Ф = 3∙10¹⁸ e/cm². The problem of obtaining such material has been solved, in which under hard irradiation the mobility of the electrons does not decrease, but increases. This material is characterized by high thermal stability up to T = 700 °C. The complex process of defects formation has been analyzed and shown that, despite of hard irradiation, the essential properties of investigated materials are mainly determined by point type defects.

Keywords: InAs, InP, solid solutions, irradiation

Procedia PDF Downloads 186

Authors: Sukhwinder Singh Jolly

Abstract:

Metal spinning is one such process in which the stresses are localized to a small area and the material is made to flow or move over the mandrel with the help of spinning tool. Spinning of tubular products can be performed by two techniques, forward spinning and backward spinning. Many researchers have studied the process both experimentally and analytically. An effort has been made to apply the process to the spinning of thin wall, highly precision, small bore long tube in hard-to-work materials such as titanium.

Keywords: metal spinning, hard-to-work materials, roller diameter, power consumption

Procedia PDF Downloads 390