Incorporating waiting time in competitive location models: formulations and heuristics

In this paper we propose a metaheuristic to solve a new version of the Maximum Capture Problem. In the original MCP, market capture is obtained by lower traveling distances or lower traveling time, in this new version not only the traveling time but also the waiting time will affect the market share. This problem is hard to solve using standard optimization techniques. Metaheuristics are shown to offer accurate results within acceptable computing times.

Incorporating waiting time in competitive location models: Formulations and heuristics

In this paper we propose a metaheuristic to solve a new version of the Maximum CaptureProblem. In the original MCP, market capture is obtained by lower traveling distances or lowertraveling time, in this new version not only the traveling time but also the waiting time willaffect the market share. This problem is hard to solve using standard optimization techniques.Metaheuristics are shown to offer accurate results within acceptable computing times.

Unconstrained optimization with MINTOOLKIT for GNU octave

The paper documents MINTOOLKIT for GNU Octave. MINTOOLKIT provides functions for minimization and numeric differentiation. The main algorithms are BFGS, LBFGS, and simulated annealing. Examples are given.

The Argentine ant (Linepithema humile) invasion effects on Mediterranean forests’ trophic web: blue tit (Parus caeruleus) reproduction and development

Les invasions biològiques representen una greu amenaça per al funcionament dels ecosistemes i per a la preservació de la biodiversitat.. La formiga argentina (Linepithema humile) està considerada com una de les 100 espècies invasores més nocives. Prospera en extenses àrees de clima mediterrani de regions temperades i subtropicals de tots els continents amb l’excepció de l’Antàrtida. És una formiga dominant i una competidora agressiva que mitjançant múltiples mecanismes, des de predació directe a competència, produeix efectes negatius en una amplia varietat de taxons, principalment formigues i altres artròpodes, però també vertebrats. S’ha investigat, per primera vegada, els efectes de la formiga invasiva sobre les comunitats d’artròpodes de fullatge i com aquestes pertorbacions es transmeten en la xarxa tròfica del bosc esclerofil•le mediterrani. En les suredes estudiades la invasió de formiga argentina és causa directe de la extinció local de la gran majoria de poblacions de formigues natives. En el període mostrejat s’han constatat també impactes negatius en la diversitat i en l’abundància d’artròpodes natius en les capçades dels arbres, particularment d’erugues. Una avaluació preliminar basada únicament amb dades del 2005 indica que, reduint la disponibilitat d’erugues, la formiga argentina empobreix l’hàbitat reproductiu de la mallerenga blava (Parus caeruleus). La mallerenga blava basa la dieta insectívora estricte de la seva pollada fonamentalment en les erugues. No hem detectat impactes en l’èxit reproductiu de les mallerengues blaves en zones envaïdes. Els polls crescuts en àrees envaïdes assoleixen una condició física similar als de les zones no envaïdes, però la reducció en la disponibilitat d’erugues associada a la invasió de formiga argentina es tradueix en un creixement descompassat i en una menor mida estructural del polls volanders. Així, les pertorbacions en la comunitat d’artròpodes associades a la invasió de la formiga argentina promouen efectes bottom-up que acaben perjudicant el desenvolupament dels polls de mallerenga blava.

Analysis and optimization of the satellite-to-plane link of an aeronautical global system

En aquest projecte s’ha analitzat i optimitzat l’enllaç satèl·lit amb avió per a un sistema aeronàutic global. Aquest nou sistema anomenat ANTARES està dissenyat per a comunicar avions amb estacions base mitjançant un satèl·lit. Aquesta és una iniciativa on hi participen institucions oficials en l’aviació com ara l’ECAC i que és desenvolupat en una col·laboració europea d’universitats i empreses. El treball dut a terme en el projecte compren bàsicament tres aspectes. El disseny i anàlisi de la gestió de recursos. La idoneïtat d’utilitzar correcció d’errors en la capa d’enllaç i en cas que sigui necessària dissenyar una opció de codificació preliminar. Finalment, estudiar i analitzar l’efecte de la interferència co-canal en sistemes multifeix. Tots aquests temes són considerats només per al “forward link”. L’estructura que segueix el projecte és primer presentar les característiques globals del sistema, després centrar-se i analitzar els temes mencionats per a poder donar resultats i extreure conclusions.

Line search multilevel optimization as computational methods for dense optical flow

We evaluate the performance of different optimization techniques developed in the context of optical flowcomputation with different variational models. In particular, based on truncated Newton methods (TN) that have been an effective approach for large-scale unconstrained optimization, we develop the use of efficient multilevel schemes for computing the optical flow. More precisely, we evaluate the performance of a standard unidirectional multilevel algorithm - called multiresolution optimization (MR/OPT), to a bidrectional multilevel algorithm - called full multigrid optimization (FMG/OPT). The FMG/OPT algorithm treats the coarse grid correction as an optimization search direction and eventually scales it using a line search. Experimental results on different image sequences using four models of optical flow computation show that the FMG/OPT algorithm outperforms both the TN and MR/OPT algorithms in terms of the computational work and the quality of the optical flow estimation.

An algorithm for semi-infinite polynomial optimization

"Vegeu el resum a l'inici del document del fitxer adjunt."

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.

A parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics

This paper discusses the use of probabilistic or randomized algorithms for solving combinatorial optimization problems. Our approach employs non-uniform probability distributions to add a biased random behavior to classical heuristics so a large set of alternative good solutions can be quickly obtained in a natural way and without complex conguration processes. This procedure is especially useful in problems where properties such as non-smoothness or non-convexity lead to a highly irregular solution space, for which the traditional optimization methods, both of exact and approximate nature, may fail to reach their full potential. The results obtained are promising enough to suggest that randomizing classical heuristics is a powerful method that can be successfully applied in a variety of cases.

On the stability of the optimal value and the optimal set in optimization problems

The paper develops a stability theory for the optimal value and the optimal set mapping of optimization problems posed in a Banach space. The problems considered in this paper have an arbitrary number of inequality constraints involving lower semicontinuous (not necessarily convex) functions and one closed abstract constraint set. The considered perturbations lead to problems of the same type as the nominal one (with the same space of variables and the same number of constraints), where the abstract constraint set can also be perturbed. The spaces of functions involved in the problems (objective and constraints) are equipped with the metric of the uniform convergence on the bounded sets, meanwhile in the space of closed sets we consider, coherently, the Attouch-Wets topology. The paper examines, in a unified way, the lower and upper semicontinuity of the optimal value function, and the closedness, lower and upper semicontinuity (in the sense of Berge) of the optimal set mapping. This paper can be seen as a second part of the stability theory presented in [17], where we studied the stability of the feasible set mapping (completed here with the analysis of the Lipschitz-like property).

Effect of Temperature on the Development and Survival of the Argentine Ant, Linepithema humile

The influence of temperature on the developmental times and survival of insects can largely determine their distribution. For invasive species, like the Argentine ant, Linepithema humile Mayr (Hymenoptera: Formicidae), these data are essential for predicting their potential range based on mechanistic models. In the case of this species, such data are too scarce and incomplete to make accurate predictions based on its physiological needs. This research provides comprehensive new data about brood survival and developmental times at a wide range of temperatures under laboratory conditions. Temperature affected both the complete brood development from egg to adult worker and each of the immature stages separately. The higher the temperature, the shorter the development times. Brood survival from egg to adult was low, with the maximum survival rate being only 16% at 26º C. Temperature also affected survival of each of the immature stages differently: eggs were negatively affected by high temperatures, while larvae were negatively affected by low temperatures, and the survival of pupae was apparentlyindependent of environmental temperature. At 32º C no eggs survived, while at 18º C less than 2% of the eggs hatched into larva. The data from the present study are essential for developing prediction models about the distribution range of this tramp species based on its physiological needs in relation to temperature

Route optimization and customization using real geographical data in Android mobile devices

Nowadays, there are several services and applications that allow users to locate and move to different tourist areas using a mobile device. These systems can be used either by internet or downloading an application in concrete places like a visitors centre. Although such applications are able to facilitate the location and the search for points of interest, in most cases, these services and applications do not meet the needs of each user. This paper aims to provide a solution by studying the main projects, services and applications, their routing algorithms and their treatment of the real geographical data in Android mobile devices, focusing on the data acquisition and treatment to improve the routing searches in off-line environments.

Effect of Temperature on the Development and Survival of the Argentine Ant, Linepithema humile

The influence of temperature on the developmental times and survival of insects can largely determine their distribution. For invasive species, like the Argentine ant, Linepithema humile Mayr (Hymenoptera: Formicidae), these data are essential for predicting their potential range based on mechanistic models. In the case of this species, such data are too scarce and incomplete to make accurate predictions based on its physiological needs. This research provides comprehensive new data about brood survival and developmental times at a wide range of temperatures under laboratory conditions. Temperature affected both the complete brood development from egg to adult worker and each of the immature stages separately. The higher the temperature, the shorter the development times. Brood survival from egg to adult was low, with the maximum survival rate being only 16% at 26° C. Temperature also affected survival of each of the immature stages differently: eggs were negatively affected by high temperatures, while larvae were negatively affected by low temperatures, and the survival of pupae was apparently independent of environmental temperature. At 32° C no eggs survived, while at 18° C less than 2% of the eggs hatched into larva. The data from the present study are essential for developing prediction models about the distribution range of this tramp species based on its physiological needs in relation to temperature

Algorithm creation and optimization for the crew pairing problem

Algoritmo que optimiza y crea pairings para tripulaciones de líneas aéreas mediante la posterior programación en Java.

Optimization of floor cleaning coverage performance of a random path-planning mobile robot

Floor cleaning is a typical robot application. There are several mobile robots aviable in the market for domestic applications most of them with random path-planning algorithms. In this paper we study the cleaning coverage performances of a random path-planning mobile robot and propose an optimized control algorithm, some methods to estimate the are of the room, the evolution of the cleaning and the time needed for complete coverage.