Search results for "Optimization"
showing 10 items of 2824 documents
An efficient swap algorithm for the lattice Boltzmann method
2007
During the last decade, the lattice-Boltzmann method (LBM) as a valuable tool in computational fluid dynamics has been increasingly acknowledged. The widespread application of LBM is partly due to the simplicity of its coding. The most well-known algorithms for the implementation of the standard lattice-Boltzmann equation (LBE) are the two-lattice and two-step algorithms. However, implementations of the two-lattice or the two-step algorithm suffer from high memory consumption or poor computational performance, respectively. Ultimately, the computing resources available decide which of the two disadvantages is more critical. Here we introduce a new algorithm, called the swap algorithm, for t…
A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows
2009
This paper presents an efficient and well-scalable metaheuristic for fleet size and mix vehicle routing with time windows. The suggested solution method combines the strengths of well-known threshold accepting and guided local search metaheuristics to guide a set of four local search heuristics. The computational tests were done using the benchmarks of [Liu, F.-H., & Shen, S.-Y. (1999). The fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research Society, 50(7), 721-732] and 600 new benchmark problems suggested in this paper. The results indicate that the suggested method is competitive and scales almost linearly up to instances with 1000 custome…
Breast Ultra-Sound image segmentation: an optimization approach based on super-pixels and high-level descriptors
2015
International audience; Breast cancer is the second most common cancer and the leading cause of cancer death among women. Medical imaging has become an indispensable tool for its diagnosis and follow up. During the last decade, the medical community has promoted to incorporate Ultra-Sound (US) screening as part of the standard routine. The main reason for using US imaging is its capability to differentiate benign from malignant masses, when compared to other imaging techniques. The increasing usage of US imaging encourages the development of Computer Aided Diagnosis (CAD) systems applied to Breast Ultra-Sound (BUS) images. However accurate delineations of the lesions and structures of the b…
An optimization approach to segment breast lesions in ultra-sound images using clinically validated visual cues
2015
International audience; As long as breast cancer remains the leading cause of cancer deaths among female population world wide, developing tools to assist radiologists during the diagnosis process is necessary. However, most of the technologies developed in the imaging laboratories are rarely integrated in this assessing process, as they are based on information cues differing from those used by clinicians. In order to grant Computer Aided Diagnosis (CAD) systems with these information cues when performing non-aided diagnosis, better segmentation strategies are needed to automatically produce accurate delineations of the breast structures. This paper proposes a highly modular and flexible f…
Chebyshev’s Method on Projective Fluids
2020
We demonstrate the acceleration potential of the Chebyshev semi-iterative approach for fluid simulations in Projective Dynamics. The Chebyshev approach has been successfully tested for deformable bodies, where the dynamical system behaves relatively linearly, even though Projective Dynamics, in general, is fundamentally nonlinear. The results for more complex constraints, like fluids, with a particular nonlinear dynamical system, remained unknown so far. We follow a method describing particle-based fluids in Projective Dynamics while replacing the Conjugate Gradient solver with Chebyshev’s method. Our results show that Chebyshev’s method can be successfully applied to fluids and potentially…
Decentralized unscented Kalman filter based on a consensus algorithm for multi-area dynamic state estimation in power systems
2015
Abstract A decentralized unscented Kalman filter (UKF) method based on a consensus algorithm for multi-area power system dynamic state estimation is presented in this paper. The overall system is split into a certain number of non-overlapping areas. Firstly, each area executes its own dynamic state estimation based on local measurements by using the UKF. Next, the consensus algorithm is required to perform only local communications between neighboring areas to diffuse local state information. Finally, according to the global state information obtained by the consensus algorithm, the UKF is run again for each area. Its performance is compared with the distributed UKF without consensus algori…
A greedy perturbation approach to accelerating consensus algorithms and reducing its power consumption
2011
The average consensus is part of a family of algorithms that are able to compute global statistics by only using local data. This capability makes these algorithms interesting for applications in which these distributed philosophy is necessary. However, its iterative nature usually leads to a large power consumption due to the repetitive communications among the iterations. This drawback highlights the necessity of minimizing the power consumption until consensus is reached. In this work, we propose a greedy approach to perturbing the connectivity graph, in order to improve the convergence time of the consensus algorithm while keeping bounded the power consumption per iteration step. These …
Exact controllability to trajectories for entropy solutions to scalar conservation laws in several space dimensions
2019
We describe a new method which allows us to obtain a result of exact controllability to trajectories of multidimensional conservation laws in the context of entropy solutions and under a mere non-degeneracy assumption on the flux and a natural geometric condition.
Numerical decomposition of geometric constraints
2005
Geometric constraint solving is a key issue in CAD/CAM. Since Owen's seminal paper, solvers typically use graph based decomposition methods. However, these methods become difficult to implement in 3D and are misled by geometric theorems. We extend the Numerical Probabilistic Method (NPM), well known in rigidity theory, to more general kinds of constraints and show that NPM can also decompose a system into rigid subsystems. Classical NPM studies the structure of the Jacobian at a random (or generic) configuration. The variant we are proposing does not consider a random configuration, but a configuration similar to the unknown one. Similar means the configuration fulfills the same set of inci…
Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
1994
In this paper, we present several constraint qualifications, and we show that these conditions guarantee the nonvacuity and the boundedness of the Lagrange multiplier sets for general nondifferentiable programming problems. The relationships with various constraint qualifications are investigated.