AN EXACT METHOD FOR THE CAPACITATED LOCATIONROUTING PROBLEM

which treat the problem as an expectation max-imization problem (Knight et al., 2006; Knight,1999). These later algorithms are, however, highlydependent on their initial states, and require anumber of restarts in order to find the globally op-timal solution. A furth[r]

... AN INEXACT SQP NEWTON METHOD FOR CONVEX SC1 MINIMIZATION PROBLEMS CHEN YIDI NATIONAL UNIVERSITY OF SINGAPORE 2008 An Inexact SQP Newton Method for Convex SC1 Minimization Problems Chen Yidi 2008... Department: Mathematics Thesis Title: An Inexact SQP Newton Method for Convex SC Minimization Prob[r]

performance at design and off-design operating points. It has been found that essential aspects of the design (such as the required flow turning, or mechanical constraints) should not be part of the fitness function, but need to be treated as so-called "killer" criteria in th[r]

often chosen primarily on grounds of statistical convenience, with little or no referenceto the particular goals or preferences of the client.But whereas statistical science is like any other science in seeking to conduct a“search for truth” that is uninfluenced by the par[r]

cussed in many reports. Popular methods include locallinear minimum mean square error approaches [10, 11],anisotropic diffusion methods [12–15], and nonlocal means(NL-means) [16], which will not be addressed in thispaper. We will focus on the variational approach-basedmultiplicative noise remo[r]

RESEARCH Open AccessA stabilized mixed discontinuous Galerkinmethod for the incompressible miscibledisplacement problemYan Luo1, Minfu Feng2and Youcai Xu2** Correspondence: xyc@scu.edu.cn2School of Mathematics, SichuanUniversity, Chengdu, Sichuan610064, PR ChinaFull list of author info[r]

with n ≥ 1, are governed bylinear equations with homogeneous initial conditions.Remark 1. Paragraph 12.3.5-2 gives an example of solving a Cauchy problem by the method of regularexpansion for a second-order equation and also discusses characteristic features of [r]

Verlag, 1983)15. K Schittkowski, NLQPL: a FORTRAN-subroutine solving constrained nonlinearprogramming problems. Ann Oper Res. 5, 485–500 (1985)16. HW Kuhn, AW Tucker, Nonlinear programming, in Proceedings of SecondBerkeley Symposium on Mathematical Statistics and Probability, 481–492(1951)17. Z Yi,[r]

2.35where ft, u, vu2/189 1 − tv2/14  1/9, t, u, v ∈ 0, 1 × R× R−.A simple calculation shows that σ  2/3andη  3/2. Thus, if we choose k  1/3andc  1, then all the conditions of Theorem 2.3 and i of Corollary 2.4 are fulfilled. It followsfrom Corollary 2.4 that the BVP 2.35[r]

It restricts each trial solution to be radial network in distribution network reconfiguration.It can be used to determine the branches of the loop formed by closing a tie line.PARTICLE SWARM OPTIMISATIONPSO an Optimization ToolParticle swarm optimization (PSO) is a population b[r]

2.1.2 ReliabilityAssociated with each type of connection is a reliability (with an implicit mission time), orequivalently, a stationary availability. This reliability has a range from 0 (never operational)to 1 (perfectly reliable). It is assumed (with good justification) that reliability come[r]

This experiment consists of eight viewpoints to be dis-tributed among four manipulators. The viewpoints arestacked into four pairs, each pair arranged beneath one ofthe robots initial position, see Figure 9. The optimal task dis-tribution for this example can be obtained using a[r]

online training of the parameters, even givenlarge-scale datasets with high dimensionalfeatures. Compared with existing trainingmethods, our training method is an ordermagnitude faster in terms of training time, andcan achieve equal or even higher accuracies.The proposed[r]

13(2005)[6] Atici, F, Cabada, A: Existence and uniqueness results for discrete second-order peri-odic boundary value problem, Comput. Math. Appl. 45, 1417–142 (2003)[7] Cabada, A, Otero-Espinar, V: Optimal existence results for n-order periodic bound-ary value difference problems[r]

13(2005)[6] Atici, F, Cabada, A: Existence and uniqueness results for discrete second-order peri-odic boundary value problem, Comput. Math. Appl. 45, 1417–142 (2003)[7] Cabada, A, Otero-Espinar, V: Optimal existence results for n-order periodic bound-ary value difference problems[r]

is the usual finite element restriction oper-ator on Ω.The lemma below establishes a monotonicity property of the solution of (2.6)withrespect to the obstacle and the boundary condition.Lemma 2.1. Let (ψ,g); (ψ, g ) be a pair of data, and u = σ(ψ,g); u = σ(ψ, g[r]

Part 4 Numerical Methods 13 Particle Transport Monte Carlo Method for Heat Conduction Problems Nam Zin Cho Korea Advanced Institute of Science and Technology (KAIST), Daejeon, South Korea 1. Introduction Heat conduction [1] is usually modeled as a diffusion process embodied in heat co[r]

5. ConclusionsThis paper tackles the design problem of Gust Alleviation (GA) flight controllers exploitingapriorimeasured turbulence data for suppressing aircraft motions driven by turbulence. Forthis problem, a robust Model Predictive Control (MPC) considering the[r]

3 FixTFrEPF;4 EP F is closed and convex.3. Main ResultsIn this section, we will introduce a new algorithm based on hybrid and extragradient methodto find a common element of the set of solutions to a system of equilibrium problems, theset of fixed points of a nonexpansive mapping, an[r]

which is a special form of the particle transport equation. While neutron diffusion approximates the neutron transport phenomena, conversely it is applicable to solve diffusion problems by transport methods under certain conditions. Based on this idea, a new Monte Carlo method h[r]