The Joint Fires Element: An Initial Solution

2003 ◽  
Author(s):  
Thomas M. Kastner
Keyword(s):  
Initial Solution

Treatment of As(V) and As(III) by electrocoagulation using Al and Fe electrode

2009 ◽  
Vol 60 (5) ◽  
pp. 1341-1346 ◽  
Author(s):  
W. H. Kuan ◽  
C. Y. Hu ◽  
M. C. Chiang
Keyword(s):  
Passive Film ◽  
Potentiodynamic Polarization ◽  
Electrode Materials ◽  
Initial Period ◽  
Electrode System ◽  
Initial Solution ◽  
Alkaline Condition ◽  
Bipolar Electrode ◽  
Pitting Potential ◽  
Fe Hydroxide

A batch electrocoagulation (EC) process with bipolar electrode and potentiodynamic polarization tests with monopolar systems were investigated as methods to explore the effects of electrode materials and initial solution pH on the As(V) and As(III) removal. The results displayed that the system with Al electrode has higher reaction rate during the initial period from 0 to 25 minutes than that of Fe electrode for alkaline condition. The pH increased with the EC time because the As(V) and As(III) removal by either co-precipitation or adsorption resulted in that the OH positions in Al-hydroxide or Fe-hydroxide were substituted by As(V) and As(III). The pH in Fe electrode system elevate higher than that in Al electrode because the As(V) removal substitutes more OH position in Fe-hydroxide than that in Al-hydroxide. EC system with Fe electrode can successfully remove the As(III) but system with Al electrode cannot because As(III) can strongly bind to the surface of Fe-hydroxide with forming inner-sphere species but weakly adsorb to the Al-hydroxide surface with forming outer-sphere species. The acidic solution can destroy the deposited hydroxide passive film then allow the metallic ions liberate into the solution, therefore, the acidic initial solution can enhance the As(V) and As(III) removal. The over potential calculation and potentiodynamic polarization tests reveal that the Fe electrode systems possess higher over potential and pitting potential than that of Al electrode system due to the fast hydrolysis of and the occurrence of Fe-hydroxide passive film.

Study on Tabu Search Algorithm for Multi-Cargo Loading Problem

2012 ◽  
Vol 178-181 ◽  
pp. 1802-1805
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Initial Solution ◽  
Neighborhood Search ◽  
Tabu Search Algorithm ◽  
Search Efficiency ◽  
Speed Of Convergence ◽  
Neighborhood Structure ◽  
Loading Problem

The paper is focused on the Multi-cargo Loading Problem (MCLP). Tabu search algorithm is an algorithm based on neighborhood search. According to the features of the problem, the essay centered the construct initial solution to construct neighborhood structure. For the operation, 1-move and 2-opt were applied, it can also fasten the speed of convergence, and boost the search efficiency. Finally, the good performance of this algorithm can be proved by experiment calculation and concrete examples.

A Mesh Adaptive Procedure for Large Increment Method

2015 ◽  
Vol 07 (04) ◽  
pp. 1550061 ◽  
Author(s):  
Zaoyang Guo ◽  
Yujie Zhao ◽  
Zhaohui Chen ◽  
Minmao Liao ◽  
Zhengliang Li ◽  
...  
Keyword(s):  
Adaptive Mesh Refinement ◽  
Adaptive Mesh ◽  
Adaptive Strategy ◽  
Original Method ◽  
Initial Solution ◽  
Error Estimator ◽  
Adaptive Procedure ◽  
Minimum Norm Solution ◽  
Large Increment ◽  
Refinement Procedure

A posteriorih-version mesh adaptive procedure is presented in the framework of large increment method (LIM) for elastic problems. In this mesh adaptive strategy, the classical Zienkiewicz–Zhu (ZZ) error estimator is adopted and a first class h-adaptive mesh refinement procedure is implemented. A major advantage of the proposed mesh adaptive procedure is that the numerical results from the previous mesh can be utilized to obtain the initial solution for the new mesh. Two-dimensional (2D) examples show that this initial solution is much closer to the real solution than the minimum norm solution used in the original LIM and the revised method can converge faster than the original method.

scholarly journals InterRC: An Inter-Resources Collaboration Heuristic for Scheduling Independent Tasks on Heterogeneous Distributed Environments

MENDEL ◽  
2019 ◽  
Vol 25 (1) ◽  
pp. 179-188
Author(s):  
Abdelhamid Khiat ◽  
Abdelkamel Tari
Keyword(s):  
Task Scheduling ◽  
Initial Solution ◽  
Distributed Environments ◽  
Scheduling Problem ◽  
Reasonable Time ◽  
Independent Task ◽  
Np Hard Problem ◽  
Computing Environments ◽  
Scheduling Heuristic ◽  
Independent Tasks

The independent task scheduling problem in distributed computing environments with makespan optimization as an objective is an NP-Hard problem. Consequently, an important number of approaches looking to approximate the optimal makespan in reasonable time have been proposed in the literature. In this paper, a new independent task scheduling heuristic called InterRC is presented. The proposed InterRC solution is an evolutionary approach, which starts with an initial solution, then executes a set of iterations, for the purpose of improving the initial solution and close the optimal makespan as soon as possible. Experiments show that InterRC obtains a better makespan compared to the other efficient algorithms.

scholarly journals The Modified Sadik Decomposition Method to Solve a System of Nonlinear Fractional Volterra Integro-Differential Equations of Convolution type

2021 ◽  
Vol 20 ◽  
pp. 335-343
Author(s):  
Prapart Pue-On
Keyword(s):  
Power Series ◽  
Differential Equations ◽  
Explicit Form ◽  
Decomposition Method ◽  
Adomian Decomposition Method ◽  
Initial Solution ◽  
Convolution Type ◽  
Adomian Decomposition

In this work, an incorporated form of Sadik transform and Adomian decomposition method which is called the Sadik decomposition method is presented. The method is applied to solve a system of nonlinear fractional Volterra integro-differential equations in the convolution form. To avoid collecting the noise terms that lead the method to fail for seeking the solution, the proposed method is modified by selecting a suitable initial solution. The obtained results are expressed in the explicit form of a power series with easily computable terms. In addition, illustrative examples are shown to demonstrate the effectiveness of the method.

scholarly journals PENDISTRIBUSIAN PRODUK DENGAN VOGEL ‘S APPROXIMATION METHOD (VAM) DAN MODIFIED DISTRIBUTION METHOD (MODI) PENDISTRIBUSIAN PRODUK DENGAN VOGEL ‘S (VAM) DAN MODIFIED DISTRIBUTION METHOD (MODI)

2017 ◽  
Author(s):  
Tri Tri Hernawati
Keyword(s):  
Approximation Method ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Initial Solution ◽  
Final Solution ◽  
Distribution Method ◽  
Initial Cost ◽  
Cost Distribution ◽  
Distribution Cost

AbstractThe research is aimed at analyzing the implementation of distribution transportation method and finding out the saving of distribution transportation cost by using Vogel’s Approximation Method and Modified Distribution Method (MODI). The research used Vogel’s Approximation Method as the initial solution and Modified Distribution Method as the final solution to save distribution transportation cost. Implementation of combination, Vogel’s Approximation Method and Modified Distribution Method is a system will be develop to find the results of calculation of the initial cost of distribution, a minimum cost distribution, and allocation of items to be distributed from the origin place to the destination place. Entry data by user is origin place (many place and name of place), destination place (many place and name of place), amount of supply from the each origin, amount of demand from the each destination, and distribution cost from the each origin to the each destination. The result of the research shows minimalizing total distribution cost about 10,7%

Sign in / Sign up

Export Citation Format

Share Document