A multi-objective model for a multi-period distribution management problem

The problems arising in commercial distribution are complex and involve several players and decision levels. One important decision is relatedwith the design of the routes to distribute the products, in an efficient and inexpensive way.This article deals with a complex vehicle routing problem that can beseen as a new extension of the basic vehicle routing problem. The proposed model is a multi-objective combinatorial optimization problemthat considers three objectives and multiple periods, which models in a closer way the real distribution problems. The first objective is costminimization, the second is balancing work levels and the third is amarketing objective. An application of the model on a small example, with5 clients and 3 days, is presented. The results of the model show the complexity of solving multi-objective combinatorial optimization problems and the contradiction between the several distribution management objective.

Iterated local search

Iterated Local Search has many of the desirable features of a metaheuristic: it is simple, easy to implement, robust, and highly effective. The essential idea of Iterated Local Search lies in focusing the search not on the full space of solutions but on a smaller subspace defined by the solutions that are locally optimal for a given optimization engine. The success of Iterated Local Search lies in the biased sampling of this set of local optima. How effective this approach turns out to be depends mainly on the choice of the local search, the perturbations, and the acceptance criterion. So far, in spite of its conceptual simplicity, it has lead to a number of state-of-the-art results without the use of too much problem-specific knowledge. But with further work so that the different modules are well adapted to the problem at hand, Iterated Local Search can often become a competitive or even state of the artalgorithm. The purpose of this review is both to give a detailed description of this metaheuristic and to show where it stands in terms of performance.

Bridging DSGE models and the raw data

A method to estimate DSGE models using the raw data is proposed. The approachlinks the observables to the model counterparts via a flexible specification which doesnot require the model-based component to be solely located at business cycle frequencies,allows the non model-based component to take various time series patterns, andpermits model misspecification. Applying standard data transformations induce biasesin structural estimates and distortions in the policy conclusions. The proposed approachrecovers important model-based features in selected experimental designs. Twowidely discussed issues are used to illustrate its practical use.

Assigning proctors to exams with scatter search

In this paper we present an algorithm to assign proctors toexams. This NP-hard problem is related to the generalized assignmentproblem with multiple objectives. The problem consists of assigningteaching assistants to proctor final exams at a university. We formulatethis problem as a multiobjective integer program (IP) with a preferencefunction and a workload-fairness function. We then consider also a weightedobjective that combines both functions. We develop a scatter searchprocedure and compare its outcome with solutions found by solving theIP model with CPLEX 6.5. Our test problems are real instances from aUniversity in Spain.

Adaptive approach heuristics for the generalized assignment problem

The Generalized Assignment Problem consists in assigning a setof tasks to a set of agents with minimum cost. Each agent hasa limited amount of a single resource and each task must beassigned to one and only one agent, requiring a certain amountof the resource of the agent. We present new metaheuristics forthe generalized assignment problem based on hybrid approaches.One metaheuristic is a MAX-MIN Ant System (MMAS), an improvedversion of the Ant System, which was recently proposed byStutzle and Hoos to combinatorial optimization problems, and itcan be seen has an adaptive sampling algorithm that takes inconsideration the experience gathered in earlier iterations ofthe algorithm. Moreover, the latter heuristic is combined withlocal search and tabu search heuristics to improve the search.A greedy randomized adaptive search heuristic (GRASP) is alsoproposed. Several neighborhoods are studied, including one basedon ejection chains that produces good moves withoutincreasing the computational effort. We present computationalresults of the comparative performance, followed by concludingremarks and ideas on future research in generalized assignmentrelated problems.

Costly search and design

Firms compete by choosing both a price and a design from a family of designs thatcan be represented as demand rotations. Consumers engage in costly sequential searchamong firms. Each time a consumer pays a search cost he observes a new offering. Anoffering consists of a price quote and a new good, where goods might vary in the extentto which they are good matches for the consumer. In equilibrium, only two design-styles arise: either the most niche where consumers are likely to either love or loathethe product, or the broadest where consumers are likely to have similar valuations. Inequilibrium, different firms may simultaneously offer both design-styles. We performcomparative statics on the equilibrium and show that a fall in search costs can lead tohigher industry prices and profits and lower consumer surplus. Our analysis is relatedto discussions of how the internet has led to the prevalence of niche goods and the"long tail" phenomenon.

Timing of seasonal sales

We present a model of timing of seasonal sales where stores chooseseveral designs at the beginning of the season without knowingwich one, if any, will be fashionable. Fashionable designs have achance to fetch high prices in fashion markets while non-fashionableones must be sold in a discount market. In the beginning of theseason, stores charge high prices in the hope of capturing theirfashion market. As the end of the season approaches with goods stillon the shelves, stores adjust downward their expectations that theyare carrying a fashionable design, and may have sales to capture thediscount market. Having a greater number of designs induces a storeto put one of them on sales earlier to test the market. Moreover,price competition in the discount market induces stores to startsales earlier because of a greater perceived first-mover advantage incapturing the discount market. More competition, perhaps due todecreases in the cost of product innovation, makes sales occur evenearlier. These results are consistent with the observation that thetrend toward earlier sales since mid-1970's coincides with increasingproduct varieties in fashion good markets and increasing storecompetition.

Metaheuristics for the bus-driver scheduling problem

We present new metaheuristics for solving real crew scheduling problemsin a public transportation bus company. Since the crews of thesecompanies are drivers, we will designate the problem by the bus-driverscheduling problem. Crew scheduling problems are well known and severalmathematical programming based techniques have been proposed to solvethem, in particular using the set-covering formulation. However, inpractice, there exists the need for improvement in terms of computationalefficiency and capacity of solving large-scale instances. Moreover, thereal bus-driver scheduling problems that we consider can present variantaspects of the set covering, as for example a different objectivefunction, implying that alternative solutions methods have to bedeveloped. We propose metaheuristics based on the following approaches:GRASP (greedy randomized adaptive search procedure), tabu search andgenetic algorithms. These metaheuristics also present some innovationfeatures based on and genetic algorithms. These metaheuristics alsopresent some innovation features based on the structure of the crewscheduling problem, that guide the search efficiently and able them tofind good solutions. Some of these new features can also be applied inthe development of heuristics to other combinatorial optimizationproblems. A summary of computational results with real-data problems ispresented.

Design effect and interviewer effects: Evidence from the Spanish ESS3-2006 Data

In 2007 the first Quality Enhancement Meeting on sampling in the European SocialSurvey (ESS) took place. The discussion focused on design effects and inteviewereffects in face-to-face interviews. Following the recomendations of this meeting theSpanish ESS team studied the impact of interviewers as a new element in the designeffect in the response s variance using the information of the correspondent SampleDesign Data Files. Hierarchical multilevel and cross-classified multilevel analysis areconducted in order to estimate the amount of responses variation due to PSU and tointerviewers for different questions in the survey. Factor such as the age of theinterviewer, gender, workload, training and experience and respondent characteristicssuch as age, gender, renuance to participate and their possible interactions are alsoincluded in the analysis of some specific questions like trust in politicians and trustin legal system . Some recomendations related to future sampling designs and thecontents of the briefing sessions are derived from this initial research.

Exploiting fitness distance correlation of set covering problems

The set covering problem is an NP-hard combinatorial optimization problemthat arises in applications ranging from crew scheduling in airlines todriver scheduling in public mass transport. In this paper we analyze searchspace characteristics of a widely used set of benchmark instances throughan analysis of the fitness-distance correlation. This analysis shows thatthere exist several classes of set covering instances that have a largelydifferent behavior. For instances with high fitness distance correlation,we propose new ways of generating core problems and analyze the performanceof algorithms exploiting these core problems.

Sistema de almacén y dispensación robotizada de productos farmacéuticos

Actualmente, las necesidades de mejora en gestión de stocks y la mayor disponibilidad de sistemas automáticos, están haciendo que muchas empresas inviertan en técnicas modernas para almacenamiento y manipulación de productos. Esta inquietud también ha llegado a las farmacias, que de forma lenta pero firme se van apuntando a su robotización. Uno de los principales problemas a los que se enfrentan las farmacias es la pérdida de tiempo en la gestión y búsqueda de medicamentos, provocando situaciones negativas como las esperas, la falta de tiempo para una atención más personalizada y como consecuencia, la pérdida de clientes. Este inconveniente y la necesidad de mejora en la gestión de los stocks han hecho que aparezcan los Sistemas de dispensación automática de productos farmacéuticos. El dispensador automático facilita el trabajo del farmacéutico al automatizar la búsqueda de la medicina requerida, aumentando la dedicación al cliente y reduciendo los tiempos no productivos y las colas. El presente estudio desarrolla un sistema de dispensación automático de fármacos aplicado a farmacias con una rotación de medicamentos media/ baja, valorando tanto su viabilidad técnica como económica. El almacén propuesto es de tipo caótico con sistema de carga, almacenamiento y descarga completamente automáticos. La mayoría de diseños y conceptos expuestos en este trabajo son de desarrollo propio del autor con el único objetivo de la búsqueda de nuevas soluciones para conseguir un sistema de almacenamiento efectivo y de máximo rendimiento.

Adquiridor de dades analògiques

L’empresa TER és una empresa dedicada al disseny i la construcció de projectes electrònics. La necessitat de comprovar el funcionament dels seus dissenys ha motivat a realitzar un projecte capaç de recollir dades significatives de diferents àmbits com pressió, voltatge, intensitat, temperatura etc. En el mercat les dos maneres més freqüents de recollir aquestes dades són per sensors que donen una equivalència d’un paràmetre físic a un rang de voltatge (0 a 10v) o per corrent (4 a 20mA). Aquestes dades seran adquirides i processades periòdicament per un microcontrolador que les emmagatzemarà una a una per posteriorment visualitzar-les en un LCD o en un programa fet per Visual Basic capaç de generar un document que guardi les dades en Excel. Com a conclusions es pot dir que s’han assolit els objectius, tant els personals com els proposats, per tal de tenir un prototip funcional

Programa d'anàlisi d'imatges de provetes metal·logràfiques

L’objectiu del present TFM és explorar les possibilitats del programa matemàtic MATLAB i la seva eina Entorn de Disseny d’Interfícies Gràfiques d’Usuari (GUIDE), desenvolupant un programa d’anàlisi d’imatges de provetes metal·logràfiques que es pugui utilitzar per a realitzar pràctiques de laboratori de l’assignatura Tecnologia de Materials de la titulació de Grau en Enginyeria Mecatrònica que s’imparteix a la Universitat de Vic. Les àrees d’interès del treball són la Instrumentació Virtual, la programació MATLAB i les tècniques d’anàlisi d’imatges metal·logràfiques. En la memòria es posa un èmfasi especial en el disseny de la interfície i dels procediments per a efectuar les mesures. El resultat final és un programa que satisfà tots els requeriments que s’havien imposat en la proposta inicial. La interfície del programa és clara i neta, destinant molt espai a la imatge que s’analitza. L’estructura i disposició dels menús i dels comandaments ajuda a que la utilització del programa sigui fàcil i intuïtiva. El programa s’ha estructurat de manera que sigui fàcilment ampliable amb altres rutines de mesura, o amb l’automatització de les rutines existents. Al tractar-se d’un programa que funciona com un instrument de mesura, es dedica un capítol sencer de la memòria a mostrar el procediment de càlcul dels errors que s’ocasionen durant la seva utilització, amb la finalitat de conèixer el seu ordre de magnitud, i de saber-los calcular de nou en cas que variïn les condicions d’utilització. Pel que fa referència a la programació, malgrat que MATLAB no sigui un entorn de programació clàssic, sí que incorpora eines que permeten fer aplicacions no massa complexes, i orientades bàsicament a gràfics o a imatges. L’eina GUIDE simplifica la realització de la interfície d’usuari, malgrat que presenta problemes per tractar dissenys una mica complexos. Per altra banda, el codi generat per GUIDE no és accessible, cosa que no permet modificar manualment la interfície en aquells casos en els que GUIDE té problemes. Malgrat aquests petits problemes, la potència de càlcul de MATLAB compensa sobradament aquestes deficiències.

Plantem un arbre

L’objecte de la proposta presentada en el concurs va ser desenvolupar un projecte d’hàbitat accessible per a persones amb paràlisi cerebral o discapacitat física greument afectades que resolgui les necessitats d’autonomia que han de permetre la seva emancipació.La proposta es va definir a partir d’un treball previ de comunicació amb usuaris, familiars, associacions, metges, neuròlegs i cuidadors. Aquest mètode fonamentat en el treball participatiu és la base d’un projecte de qualitat que pugui donar resposta a les necessitats dels usuaris reflectint aquestes inquietuds en els criteris adoptats al programa funcional i millorant els requisits de mínims que estableixen les normatives urbanístiques i sobretot edificatòries. Aquest mètode de treball participatiu i inclusiu és una constant clau durant tot el procés de projecte i posterior direcció de les obres.

An approach to costs and energy consumption in private urban Spanish Mediterranean landscapes from a simplified model in sprinkle irrigation

The number of private gardens has increased in recent years, creating a more pleasant urban model, but not without having an environmental impact, including increased energy consumption, which is the focus of this study. The estimation of costs and energy consumption for the generic typology of private urban gardens is based on two simplifying assumptions: square geometry with surface areas from 25 to 500 m2 and hydraulic design with a single pipe. In total, eight sprinkler models have been considered, along with their possible working pressures, and 31 pumping units grouped into 5 series that adequately cover the range of required flow rates and pressures, resultin in 495 hydraulic designs repeated for two climatically different locations in the Spanish Mediterranean area (Girona and Elche). Mean total irrigation costs for the locality with lower water needs (Girona) and greater needs (Elche) were € 2,974 ha-¹ yr-¹ and € 3,383 ha-¹ yr-¹, respectively. Energy costs accounted for 11.4% of the total cost for the first location, and 23.0% for the second. While a suitable choice of the hydraulic elements of the setup is essential, as it may provide average energy savings of 77%, due to the low energy cost in relation to the cost of installation, the potential energy savings do not constitute a significant incentive for the irrigation system design. The low efficiency of the pumping units used in this type of garden is the biggest obstacle and constraint to achieving a high quality energy solution