Search results for: Replacement Problem
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 3743

Search results for: Replacement Problem

3683 Optimization by Ant Colony Hybryde for the Bin-Packing Problem

Authors: Ben Mohamed Ahemed Mohamed, Yassine Adnan

Abstract:

The problem of bin-packing in two dimensions (2BP) consists in placing a given set of rectangular items in a minimum number of rectangular and identical containers, called bins. This article treats the case of objects with a free orientation of 90Ôùª. We propose an approach of resolution combining optimization by colony of ants (ACO) and the heuristic method IMA to resolve this NP-Hard problem.

Keywords: Ant colony algorithm, bin-packing problem, heuristics methods.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1784
3682 The Effect of Press Fit on Osseointegration of Acetabular Cup

Authors: Nor Azali Azmir, Iskhrizat Taib, Mohammed Rafiq Abdul Kadir

Abstract:

The primary cause of Total Hip Replacement (THR) failure for younger patients is aseptic loosening. This complication is twice more likely to happen in acetabular cup than in femoral stem. Excessive micromotion between bone and implant will cause loosening and it depends in patient activities, age and bone. In this project, the effects of different metal back design of press fit on osseointegration of the acetabular cup are carried out. Commercial acetabular cup designs, namely Spiked, Superfix and Quadrafix are modelled and analyzed using commercial finite element software. The diameter of acetabular cup is based on the diameter of acetabular rim to make sure the component fit to the acetabular cavity. A new design of acetabular cup are proposed and analyzed to get better osseointegration between the bones and implant interface. Results shows that the proposed acetabular cup designs are more stable compared to other designs with respect to stress and displacement aspects.

Keywords: Finite element analysis, total hip replacement, acetabular cup, loosening.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1946
3681 Optimal Facility Layout Problem Solution Using Genetic Algorithm

Authors: Maricar G. Misola, Bryan B. Navarro

Abstract:

Facility Layout Problem (FLP) is one of the essential problems of several types of manufacturing and service sector. It is an optimization problem on which the main objective is to obtain the efficient locations, arrangement and order of the facilities. In the literature, there are numerous facility layout problem research presented and have used meta-heuristic approaches to achieve optimal facility layout design. This paper presented genetic algorithm to solve facility layout problem; to minimize total cost function. The performance of the proposed approach was verified and compared using problems in the literature.

Keywords: Facility Layout Problem, Genetic Algorithm, Material Handling Cost, Meta-heuristic Approach.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 4678
3680 Solving the Teacher Assignment-Course Scheduling Problem by a Hybrid Algorithm

Authors: Aldy Gunawan, Kien Ming Ng, Kim Leng Poh

Abstract:

This paper presents a hybrid algorithm for solving a timetabling problem, which is commonly encountered in many universities. The problem combines both teacher assignment and course scheduling problems simultaneously, and is presented as a mathematical programming model. However, this problem becomes intractable and it is unlikely that a proven optimal solution can be obtained by an integer programming approach, especially for large problem instances. A hybrid algorithm that combines an integer programming approach, a greedy heuristic and a modified simulated annealing algorithm collaboratively is proposed to solve the problem. Several randomly generated data sets of sizes comparable to that of an institution in Indonesia are solved using the proposed algorithm. Computational results indicate that the algorithm can overcome difficulties of large problem sizes encountered in previous related works.

Keywords: Timetabling problem, mathematical programming model, hybrid algorithm, simulated annealing.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 4518
3679 Stochastic Programming Model for Power Generation

Authors: Takayuki Shiina

Abstract:

We consider power system expansion planning under uncertainty. In our approach, integer programming and stochastic programming provide a basic framework. We develop a multistage stochastic programming model in which some of the variables are restricted to integer values. By utilizing the special property of the problem, called block separable recourse, the problem is transformed into a two-stage stochastic program with recourse. The electric power capacity expansion problem is reformulated as the problem with first stage integer variables and continuous second stage variables. The L-shaped algorithm to solve the problem is proposed.

Keywords: electric power capacity expansion problem, integerprogramming, L-shaped method, stochastic programming

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1778
3678 On Optimum Stratification

Authors: M. G. M. Khan, V. D. Prasad, D. K. Rao

Abstract:

In this manuscript, we discuss the problem of determining the optimum stratification of a study (or main) variable based on the auxiliary variable that follows a uniform distribution. If the stratification of survey variable is made using the auxiliary variable it may lead to substantial gains in precision of the estimates. This problem is formulated as a Nonlinear Programming Problem (NLPP), which turn out to multistage decision problem and is solved using dynamic programming technique.

Keywords: Auxiliary variable, Dynamic programming technique, Nonlinear programming problem, Optimum stratification, Uniform distribution.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2060
3677 Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA)

Authors: Buthainah Fahran Al-Dulaimi, Hamza A. Ali

Abstract:

The well known NP-complete problem of the Traveling Salesman Problem (TSP) is coded in genetic form. A software system is proposed to determine the optimum route for a Traveling Salesman Problem using Genetic Algorithm technique. The system starts from a matrix of the calculated Euclidean distances between the cities to be visited by the traveling salesman and a randomly chosen city order as the initial population. Then new generations are then created repeatedly until the proper path is reached upon reaching a stopping criterion. This search is guided by a solution evaluation function.

Keywords: Genetic algorithms, traveling salesman problem solving, optimization.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2499
3676 Laboratory Investigations on Mechanical Properties of High Volume Fly Ash Concrete and Composite Sections

Authors: Aravindkumar B. Harwalkar, S. S. Awanti

Abstract:

Use of fly ash as a supplementary cementing material in large volumes can bring both technological and economic benefits for concrete industry. In this investigation mix proportions for high volume fly ash concrete were determined at cement replacement levels of 50%, 55%, 60% and 65% with low calcium fly ash. Flexural and compressive strengths of different mixes were measured at ages of 7, 28 and 90 days. Flexural strength of composite section prepared from pavement quality and lean high volume fly ash concrete was determined at the age of 28 days. High volume fly ash concrete mixes exhibited higher rate of strength gain and age factors than corresponding reference concrete mixes. The optimum cement replacement level for pavement quality concrete was found to be 60%. The consideration of bond between pavement quality and lean of high volume fly ash concrete will be beneficial in design of rigid pavements.

Keywords: Keywords—Composite section, Compressive strength, Flexural strength, Fly ash.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1912
3675 A Study on Cement-Based Composite Containing Polypropylene Fibers and Finely Ground Glass Exposed to Elevated Temperatures

Authors: O. Alidoust, I. Sadrinejad, M. A. Ahmadi

Abstract:

High strength concrete has been used in situations where it may be exposed to elevated temperatures. Numerous authors have shown the significant contribution of polypropylene fiber to the spalling resistance of high strength concrete. When cement-based composite that reinforced by polypropylene fibers heated up to 170 °C, polypropylene fibers readily melt and volatilize, creating additional porosity and small channels in to the matrix that cause the poor structure and low strength. This investigation develops on the mechanical properties of mortar incorporating polypropylene fibers exposed to high temperature. Also effects of different pozzolans on strength behaviour of samples at elevated temperature have been studied. To reach this purpose, the specimens were produced by partial replacement of cement with finely ground glass, silica fume and rice husk ash as high reactive pozzolans. The amount of this replacement was 10% by weight of cement to find the effects of pozzolans as a partial replacement of cement on the mechanical properties of mortars. In this way, lots of mixtures with 0%, 0.5%, 1% and 1.5% of polypropylene fibers were cast and tested for compressive and flexural strength, accordance to ASTM standard. After that specimens being heated to temperatures of 300, 600 °C, respectively, the mechanical properties of heated samples were tested. Mechanical tests showed significant reduction in compressive strength which could be due to polypropylene fiber melting. Also pozzolans improve the mechanical properties of sampels.

Keywords: Mechanical properties, compressive strength, Flexural strength, pozzolanic behavior.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2127
3674 Two-Stage Approach for Solving the Multi-Objective Optimization Problem on Combinatorial Configurations

Authors: Liudmyla Koliechkina, Olena Dvirna

Abstract:

The statement of the multi-objective optimization problem on combinatorial configurations is formulated, and the approach to its solution is proposed. The problem is of interest as a combinatorial optimization one with many criteria, which is a model of many applied tasks. The approach to solving the multi-objective optimization problem on combinatorial configurations consists of two stages; the first is the reduction of the multi-objective problem to the single criterion based on existing multi-objective optimization methods, the second stage solves the directly replaced single criterion combinatorial optimization problem by the horizontal combinatorial method. This approach provides the optimal solution to the multi-objective optimization problem on combinatorial configurations, taking into account additional restrictions for a finite number of steps.

Keywords: Discrete set, linear combinatorial optimization, multi-objective optimization, multipermutation, Pareto solutions, partial permutation set, permutation, structural graph.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 609
3673 Effectiveness of Natural Zeolite in Mitigating Alkali Silica Reaction Expansions

Authors: Esma Gizem Daskiran, Mehmet Mustafa Daskiran

Abstract:

This paper investigates the effectiveness of two natural zeolites in reducing expansion of concrete due to alkali-silica reaction. These natural zeolites have different reactive silica content. Three aggregates; two natural sands and one crushed stone aggregate were used while preparing mortar bars in accordance with accelerated mortar bar test method, ASTM C1260. Performances of natural zeolites are compared by examining the expansions due to alkali silica reaction. Natural zeolites added to the mixtures at 10% and 20% replacement levels by weight of cement. Natural zeolite with high reactive silica content had better performance on reducing expansions due to ASR. In this research, using high reactive zeolite at 20% replacement levels was effective in mitigating expansions.

Keywords: Alkali silica reaction, natural zeolite, durability, expansion.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2552
3672 P-ACO Approach to Assignment Problem in FMSs

Authors: I. Mahdavi, A. Jazayeri, M. Jahromi, R. Jafari, H. Iranmanesh

Abstract:

One of the most important problems in production planning of flexible manufacturing system (FMS) is machine tool selection and operation allocation problem that directly influences the production costs and times .In this paper minimizing machining cost, set-up cost and material handling cost as a multi-objective problem in flexible manufacturing systems environment are considered. We present a 0-1 integer linear programming model for the multiobjective machine tool selection and operation allocation problem and due to the large scale nature of the problem, solving the problem to obtain optimal solution in a reasonable time is infeasible, Paretoant colony optimization (P-ACO) approach for solving the multiobjective problem in reasonable time is developed. Experimental results indicate effectiveness of the proposed algorithm for solving the problem.

Keywords: Flexible manufacturing system, Production planning, Machine tool selection, Operation allocation, Multiobjective optimization, Metaheuristic.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1863
3671 A Comparison of Exact and Heuristic Approaches to Capital Budgeting

Authors: Jindřiška Šedová, Miloš Šeda

Abstract:

This paper summarizes and compares approaches to solving the knapsack problem and its known application in capital budgeting. The first approach uses deterministic methods and can be applied to small-size tasks with a single constraint. We can also apply commercial software systems such as the GAMS modelling system. However, because of NP-completeness of the problem, more complex problem instances must be solved by means of heuristic techniques to achieve an approximation of the exact solution in a reasonable amount of time. We show the problem representation and parameter settings for a genetic algorithm framework.

Keywords: Capital budgeting, knapsack problem, GAMS, heuristic method, genetic algorithm.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1696
3670 Transfer Knowledge from Multiple Source Problems to a Target Problem in Genetic Algorithm

Authors: Tami Alghamdi, Terence Soule

Abstract:

To study how to transfer knowledge from multiple source problems to the target problem, we modeled the Transfer Learning (TL) process using Genetic Algorithms as the model solver. TL is the process that aims to transfer learned data from one problem to another problem. The TL process aims to help Machine Learning (ML) algorithms find a solution to the problems. The Genetic Algorithms (GA) give researchers access to information that we have about how the old problem is solved. In this paper, we have five different source problems, and we transfer the knowledge to the target problem. We studied different scenarios of the target problem. The results showed that combined knowledge from multiple source problems improves the GA performance. Also, the process of combining knowledge from several problems results in promoting diversity of the transferred population.

Keywords: Transfer Learning, Multiple Sources, Knowledge Transfer, Domain Adaptation, Source, Target.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 270
3669 Optimization Using Simulation of the Vehicle Routing Problem

Authors: Nayera E. El-Gharably, Khaled S. El-Kilany, Aziz E. El-Sayed

Abstract:

A key element of many distribution systems is the routing and scheduling of vehicles servicing a set of customers. A wide variety of exact and approximate algorithms have been proposed for solving the vehicle routing problems (VRP). Exact algorithms can only solve relatively small problems of VRP, which is classified as NP-Hard. Several approximate algorithms have proven successful in finding a feasible solution not necessarily optimum. Although different parts of the problem are stochastic in nature; yet, limited work relevant to the application of discrete event system simulation has addressed the problem. Presented here is optimization using simulation of VRP; where, a simplified problem has been developed in the ExtendSimTM simulation environment; where, ExtendSimTM evolutionary optimizer is used to minimize the total transportation cost of the problem. Results obtained from the model are very satisfactory. Further complexities of the problem are proposed for consideration in the future.

Keywords: Discrete event system simulation, optimization using simulation, vehicle routing problem.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 5792
3668 Partial Replacement of Lateritic Soil with Crushed Rock Sand (Stone Dust) in Compressed Earth Brick Production

Authors: A. M. Jungudo, M. A. Lasan

Abstract:

Affordable housing has long been one of the basic necessities of life to man. The ever rising prices of building materials are one of the major causes of housing shortage in many developing countries. Breaching the gap of housing needs in developing countries like Nigeria is an awaiting task longing for attention. This is due to lack of research in the development of local materials that will suit the troubled economies of these countries. The use of earth material to meet the housing needs is a sustainable option and its material is freely available universally. However, people are doubtful of using the earth material due to its modest outlook and uncertain durability. This research aims at enhancing the durability of Compressed Earth Bricks (CEBs) using stone dust as a stabilizer. The result indicates that partial replacement of lateritic soil with stone dust at 30% improves its compressive strength along with abrasive resistance.

Keywords: Laterite, stone dust, compressed earth bricks, durability.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 489
3667 Tabu Search to Draw Evacuation Plans in Emergency Situations

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.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1760
3666 Avoiding Pin Ball Routing Problem in Network Mobility Hand-Off Management

Authors: M. Dinakaran, P. Balasubramanie

Abstract:

With the demand of mobility by users, wireless technologies have become the hotspot developing arena. Internet Engineering Task Force (IETF) working group has developed Mobile IP to support node mobility. The concept of node mobility indicates that in spite of the movement of the node, it is still connected to the internet and all the data transactions are preserved. It provides location-independent access to Internet. After the incorporation of host mobility, network mobility has undergone intense research. There are several intricacies faced in the real world implementation of network mobility significantly the problem of nested networks and their consequences. This article is concerned regarding a problem of nested network called pinball route problem and proposes a solution to eliminate the above problem. The proposed mechanism is implemented using NS2 simulation tool and it is found that the proposed mechanism efficiently reduces the overload caused by the pinball route problem.

Keywords: Mobile IP, Pinball routing problem, NEMO

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1806
3665 Optimal Capacitor Placement in Distribution Feeders

Authors: N. Rugthaicharoencheep, S. Auchariyamet

Abstract:

Optimal capacitor allocation in distribution systems has been studied for a long times. It is an optimization problem which has an objective to define the optimal sizes and locations of capacitors to be installed. In this works, an overview of capacitor placement problem in distribution systems is briefly introduced. The objective functions and constraints of the problem are listed and the methodologies for solving the problem are summarized.

Keywords: Capacitor Placement, Distribution Systems, Optimization Techniques

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2379
3664 The Development of a Low Carbon Cementitious Material Produced from Cement, Ground Granulated Blast Furnace Slag and High Calcium Fly Ash

Authors: Ali Shubbar, Hassnen M. Jafer, Anmar Dulaimi, William Atherton, Ali Al-Rifaie

Abstract:

This research represents experimental work for investigation of the influence of utilising Ground Granulated Blast Furnace Slag (GGBS) and High Calcium Fly Ash (HCFA) as a partial replacement for Ordinary Portland Cement (OPC) and produce a low carbon cementitious material with comparable compressive strength to OPC. Firstly, GGBS was used as a partial replacement to OPC to produce a binary blended cementitious material (BBCM); the replacements were 0, 10, 15, 20, 25, 30, 35, 40, 45 and 50% by the dry mass of OPC. The optimum BBCM was mixed with HCFA to produce a ternary blended cementitious material (TBCM). The replacements were 0, 10, 15, 20, 25, 30, 35, 40, 45 and 50% by the dry mass of BBCM. The compressive strength at ages of 7 and 28 days was utilised for assessing the performance of the test specimens in comparison to the reference mixture using 100% OPC as a binder. The results showed that the optimum BBCM was the mix produced from 25% GGBS and 75% OPC with compressive strength of 32.2 MPa at the age of 28 days. In addition, the results of the TBCM have shown that the addition of 10, 15, 20 and 25% of HCFA to the optimum BBCM improved the compressive strength by 22.7, 11.3, 5.2 and 2.1% respectively at 28 days. However, the replacement of optimum BBCM with more than 25% HCFA have showed a gradual drop in the compressive strength in comparison to the control mix. TBCM with 25% HCFA was considered to be the optimum as it showed better compressive strength than the control mix and at the same time reduced the amount of cement to 56%. Reducing the cement content to 56% will contribute to decrease the cost of construction materials, provide better compressive strength and also reduce the CO2 emissions into the atmosphere.

Keywords: Cementitious material, compressive strength, GGBS, HCFA, OPC.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 954
3663 Reconstruction of Binary Matrices Satisfying Neighborhood Constraints by Simulated Annealing

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.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2414
3662 Vibration Base Identification of Impact Force Using Genetic Algorithm

Authors: R. Hashemi, M.H.Kargarnovin

Abstract:

This paper presents the identification of the impact force acting on a simply supported beam. The force identification is an inverse problem in which the measured response of the structure is used to determine the applied force. The identification problem is formulated as an optimization problem and the genetic algorithm is utilized to solve the optimization problem. The objective function is calculated on the difference between analytical and measured responses and the decision variables are the location and magnitude of the applied force. The results from simulation show the effectiveness of the approach and its robustness vs. the measurement noise and sensor location.

Keywords: Genetic Algorithm, Inverse problem, Optimization, Vibration.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1504
3661 Solving the Set Covering Problem Using the Binary Cat Swarm Optimization Metaheuristic

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, set covering problem, metaheuristic, binarization methods.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2290
3660 Use of Green Coconut Pulp as Cream, Milk, Stabilizer and Emulsifier Replacer in Germinated Brown Rice Ice Cream

Authors: Naruemon Prapasuwannakul, Supitcha Boonchai, Nawapat Pengpengpit

Abstract:

The aim of this study was to determine physicochemical and sensory properties of germinated brown rice ice cream as affected by replacement of cream, milk, stabilizer, and emulsifier with green coconut pulp. Five different formulations of ice cream were performed. Regular formulation of ice cream consisted of GBR juice, milk cream, milk powder, stabilizer, emulsifier, sucrose and salt. Replacing of cream, milk, stabilizer, and emulsifier with coconut pulp resulted in an increase in viscosity and overrun, but a decrease in hardness, melting rate, lightness (l*) and redness (a*). However, there was no significant difference among all formulations on any sensory attributes. The results also showed that the ice cream with replacement of coconut pulp contained less fat and protein than those of the regular ice cream. The findings suggested that green coconut pulp can be used as alternative ingredient to replace fat, milk stabilizer and emulsifier even in a high carbohydrate ice cream formulation.

Keywords: Ice cream, germinated brown rice, coconut pulp, milk, cream.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3276
3659 An Effective Algorithm for Minimum Weighted Vertex Cover Problem

Authors: S. Balaji, V. Swaminathan, K. Kannan

Abstract:

The Minimum Weighted Vertex Cover (MWVC) problem is a classic graph optimization NP - complete problem. Given an undirected graph G = (V, E) and weighting function defined on the vertex set, the minimum weighted vertex cover problem is to find a vertex set S V whose total weight is minimum subject to every edge of G has at least one end point in S. In this paper an effective algorithm, called Support Ratio Algorithm (SRA), is designed to find the minimum weighted vertex cover of a graph. Computational experiments are designed and conducted to study the performance of our proposed algorithm. Extensive simulation results show that the SRA can yield better solutions than other existing algorithms found in the literature for solving the minimum vertex cover problem.

Keywords: Weighted vertex cover, vertex support, approximation algorithms, NP-complete problem.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3835
3658 Creative Thinking Skill Approach Through Problem-Based Learning: Pedagogy and Practice in the Engineering Classroom

Authors: Halizah Awang, Ishak Ramly

Abstract:

Problem-based learning (PBL) is one of the student centered approaches and has been considered by a number of higher educational institutions in many parts of the world as a method of delivery. This paper presents a creative thinking approach for implementing Problem-based Learning in Mechanics of Structure within a Malaysian Polytechnics environment. In the learning process, students learn how to analyze the problem given among the students and sharing classroom knowledge into practice. Further, through this course-s emphasis on problem-based learning, students acquire creative thinking skills and professional skills as they tackle complex, interdisciplinary and real-situation problems. Once the creative ideas are generated, there are useful additional techniques for tender ideas that will grow into a productive concept or solution. The combination of creative skills and technical abilities will enable the students to be ready to “hit-the-ground-running" and produce in industry when they graduate.

Keywords: Creative Thinking Skills, Problem-based Learning, Problem Solving.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 7211
3657 Oil Palm Shell Ash - Cement Mortar Mixture and Modification of Mechanical Properties

Authors: Abdoullah Namdar, Fadzil Mat Yahaya

Abstract:

The waste agriculture materials cause environment pollution, recycle of these materials help sustainable development. This study focused on the impact of used oil palm shell ash on the compressive and flexural strengths of cement mortar. Two different cement mortar mixes have been designed to investigate the impact of oil palm shell ash on strengths of cement mortar. Quantity of 4% oil palm shell ash has been replaced in cement mortar. The main objective of this paper is, to modify mechanical properties of cement mortar by replacement of oil palm ash in it at early age of 7 days. The results have been revealed optimum quantity of oil palm ash for replacement in cement mortar. The deflection, load to failure, time to failure of compressive strength and flexural strength of all specimens have significantly been improved. The stress-strain behavior has been indicated ability of modified cement mortar in control stress path and strain. The micro property of cement paste has not been investigated.

Keywords: Minerals, additive, flexural strength, compressive strength, modulus of elasticity.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2667
3656 The Algorithm to Solve the Extend General Malfatti’s Problem in a Convex Circular Triangle

Authors: Ching-Shoei Chiang

Abstract:

The Malfatti’s problem solves the problem of fitting three circles into a right triangle such that these three circles are tangent to each other, and each circle is also tangent to a pair of the triangle’s sides. This problem has been extended to any triangle (called general Malfatti’s problem). Furthermore, the problem has been extended to have 1 + 2 + … + n circles inside the triangle with special tangency properties among circles and triangle sides; it is called the extended general Malfatti’s problem. In the extended general Malfatti’s problem, call it Tri(Tn), where Tn is the triangle number, there are closed-form solutions for the Tri(T₁) (inscribed circle) problem and Tri(T₂) (3 Malfatti’s circles) problem. These problems become more complex when n is greater than 2. In solving the Tri(Tn) problem, n > 2, algorithms have been proposed to solve these problems numerically. With a similar idea, this paper proposed an algorithm to find the radii of circles with the same tangency properties. Instead of the boundary of the triangle being a straight line, we use a convex circular arc as the boundary and try to find Tn circles inside this convex circular triangle with the same tangency properties among circles and boundary as in Tri(Tn) problems. We call these problems the Carc(Tn) problems. The algorithm is a mO(Tn) algorithm, where m is the number of iterations in the loop. It takes less than 1000 iterations and less than 1 second for the Carc(T16) problem, which finds 136 circles inside a convex circular triangle with specified tangency properties. This algorithm gives a solution for circle packing problem inside convex circular triangle with arbitrarily-sized circles. Many applications concerning circle packing may come from the result of the algorithm, such as logo design, architecture design, etc.

Keywords: Circle packing, computer-aided geometric design, geometric constraint solver, Malfatti’s problem.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 48
3655 The Effects of SCMs on the Mechanical Properties and Durability of Fibre Cement Plates

Authors: Ceren Ince, Berkay Z. Erdem, Shahram Derogar, Nabi Yuzer

Abstract:

Fibre cement plates, often used in construction, generally are made using quartz as an inert material, cement as a binder and cellulose as a fibre. This paper, first of all, investigates the mechanical properties and durability of fibre cement plates when quartz is both partly and fully replaced with diatomite. Diatomite does not only have lower density compared to quartz but also has high pozzolanic activity. The main objective of this paper is the investigation of the effects of supplementary cementing materials (SCMs) on the short and long term mechanical properties and durability characteristics of fibre cement plates prepared using diatomite. Supplementary cementing materials such as ground granulated blast furnace slug (GGBS) and fly ash (FA) are used in this study. Volume proportions of 10, 20, 30 and 40% of GGBS and FA are used as partial replacement materials to cement. Short and long term mechanical properties such as compressive and flexural strengths as well as sorptivity characteristics and mass were investigated. Consistency and setting time at each replacement levels of SCMs were also recorded. The effects of using supplementary cementing materials on the carbonation and sulphate resistance of fibre cement plates were then experimented. The results, first of all, show that the use of diatomite as a full or partial replacement to quartz resulted in a systematic decrease in total mass of the fibre cement plates. The reduction of mass was largely due to the lower density and finer particle size of diatomite compared to quartz. The use of diatomite did not only reduce the mass of these plates but also increased the compressive strength significantly as a result of its high pozzolanic activity. The replacement levels of both GGBS and FA resulted in a systematic decrease in short term compressive strength with increasing replacement levels. This was essentially expected as the total rate of hydration is much lower in GGBS and FA than that of cement. Long term results however, indicated that the compressive strength of fibre cement plates prepared using both GGBS and FA increases with time and hence the compressive strength of plates prepared using SCMs is either equivalent or more than the compressive strength of plates prepared using cement alone. Durability characteristics of fibre cement plates prepared using SCMs were enhanced significantly. Measurements of sopritivty characteristics were also indicated that the plates prepared using SCMs has much lower water absorption capacities compared to plates prepared cement alone. Much higher resistance to carbonation and sulphate attach were observed with plates prepared using SCMs. The results presented in this paper show that the use of SCMs does not only support the production of more sustainable construction materials but also enhances the mechanical properties and durability characteristics of fibre cement plates.

Keywords: Diatomite, fibre, strength, supplementary cementing materials.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2193
3654 Implementation of Heuristics for Solving Travelling Salesman Problem Using Nearest Neighbour and Minimum Spanning Tree Algorithms

Authors: Fatma A. Karkory, Ali A. Abudalmola

Abstract:

The travelling salesman problem (TSP) is a combinatorial optimization problem in which the goal is to find the shortest path between different cities that the salesman takes. In other words, the problem deals with finding a route covering all cities so that total distance and execution time is minimized. This paper adopts the nearest neighbor and minimum spanning tree algorithm to solve the well-known travelling salesman problem. The algorithms were implemented using java programming language. The approach is tested on three graphs that making a TSP tour instance of 5-city, 10 –city, and 229–city. The computation results validate the performance of the proposed algorithm.

Keywords: Heuristics, minimum spanning tree algorithm, Nearest Neighbor, Travelling Salesman Problem (TSP).

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 7758