Search results for " algorithm"
showing 10 items of 2538 documents
Algorithms for transforming an integral photography into a plenoptic picture
2013
We report a simple algorithm for transforming the set of elemental images captured with an integral-photography set up, into the set of micro-images ready to be projected into an integral-imaging monitor. The method is based in the transposing relation between an integral photography and a plenoptic picture. The reported technique permits to adapt the integral images to the resolution and size of the monitor.
Automating the Parameter Selection in VRP: An Off-line Parameter Tuning Tool Comparison
2014
Vehicle route optimization is an important application of combinatorial optimization. Therefore, a variety of methods has been proposed to solve different challenging vehicle routing problems. An important step in adopting these methods to solve real-life problems is to find appropriate parameters for the routing algorithms. In this chapter, we show how this task can be automated using parameter tuning by presenting a set of comparative experiments on seven state-of-the-art tuning methods. We analyze the suitability of these methods in configuring routing algorithms, and give the first critical comparison of automated parameter tuners in vehicle routing. Our experimental results show that t…
On WQO Property for Different Quasi Orderings of the Set of Permutations
2013
The property of certain sets being well quasi ordered (WQO) has several useful applications in computer science – it can be used to prove the existence of efficient algorithms and also in certain cases to prove that a specific algorithm terminates.
A Hierarchy of Twofold Resource Allocation Automata Supporting Optimal Sampling
2009
We consider the problem of allocating limited sampling resources in a "real-time" manner with the purpose of estimating multiple binomial proportions. More specifically, the user is presented with `n ' sets of data points, S 1 , S 2 , ..., S n , where the set S i has N i points drawn from two classes {*** 1 , *** 2 }. A random sample in set S i belongs to *** 1 with probability u i and to *** 2 with probability 1 *** u i , with {u i }. i = 1, 2, ...n , being the quantities to be learnt. The problem is both interesting and non-trivial because while both n and each N i are large, the number of samples that can be drawn is bounded by a constant, c . We solve the problem by first modelling it a…
A Maximal-Space Algorithm for the Container Loading Problem
2008
In this paper, a greedy randomized adaptive search procedure (GRASP) for the container loading problem is presented. This approach is based on a constructive block heuristic that builds upon the concept of maximal space, a nondisjoint representation of the free space in a container. This new algorithm is extensively tested over the complete set of Bischoff and Ratcliff problems [Bischoff, E. E., M. S. W. Ratcliff. 1995. Issues in the development of approaches to container loading. Omega 23 377–390], ranging from weakly heterogeneous to strongly heterogeneous cargo, and outperforms all the known nonparallel approaches that, partially or completely, have used this set of test problems. When …
A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem
2008
In this chapter we present a metaheuristic procedure constructed for the special case of the Vehicle Routing Problem in which the demands of clients can be split, i.e., any client can be serviced by more than one vehicle. The proposed algorithm, based on the scatter search methodology, produces a feasible solution using the minimum number of vehicles. The quality of the obtained results is comparable to the best results known up to date on a set of instances previously published in the literature.
Efficient Local Search Limitation Strategies for Vehicle Routing Problems
2008
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with the assignment of a set of transportation orders to a fleet of vehicles, and the sequencing of stops for each vehicle to minimize transportation costs. The examined strategies are applied to three standard neighborhoods and implemented in a recently suggested powerful memetic algorithm. Experimental results on 26 well-known benchmark problems indicate significant speedups of almost 80% without worsening the solution quality. On the contrary, in 12 cases new best solutions were obtained.
Efficient evolutionary approach to approximate the Pareto-optimal set in multiobjective optimization, UPS-EMOA
2010
Solving real-life engineering problems requires often multiobjective, global, and efficient (in terms of objective function evaluations) treatment. In this study, we consider problems of this type by discussing some drawbacks of the current methods and then introduce a new population-based multiobjective optimization algorithm UPS-EMOA which produces a dense (not limited to the population size) approximation of the Pareto-optimal set in a computationally effective manner.
<strong>New tool useful for drug discovery validated through benchmark datasets</strong>
2018
Atomic Weighted Vectors (AWVs) are vectors that contain the codified information of molecular structures, which can apply to a set of Aggregation Operators (AOs) to calculate total and local molecular descriptors (MDs). This article presents an exploratory study of a new tool useful for drug discovery using different datasets, such as DRAGON and Sutherland’s datasets, as well as their comparison with other well-known approaches. In order to evaluate the performance of the tool, several statistics and QSAR/QSPR experiments were performed. Variability analyses are used to quantify the information content of the AWVs obtained from the tool, by the way of an information theory-based algorithm. …
The DrosDel Collection
2004
Abstract We describe a collection of P-element insertions that have considerable utility for generating custom chromosomal aberrations in Drosophila melanogaster. We have mobilized a pair of engineered P elements, p{RS3} and p{RS5}, to collect 3243 lines unambiguously mapped to the Drosophila genome sequence. The collection contains, on average, an element every 35 kb. We demonstrate the utility of the collection for generating custom chromosomal deletions that have their end points mapped, with base-pair resolution, to the genome sequence. The collection was generated in an isogenic strain, thus affording a uniform background for screens where sensitivity to genetic background is high. The…