Submitted by Marcelo Sant'Anna (marcelos@fgvmail.br) on 2010-07-20T19:55:28Z No. of bitstreams: 1 dissertVF.pdf: 409746 bytes, checksum: ca7db8bc8077f795d693bed9b119adac (MD5) / Approved for entry into archive by Andrea Virginio Machado(andrea.machado@fgv.br) on 2010-07-22T12:27:19Z (GMT) No. of bitstreams: 1 dissertVF.pdf: 409746 bytes, checksum: ca7db8bc8077f795d693bed9b119adac (MD5) / Made available in DSpace on 2010-07-23T19:33:54Z (GMT). No. of bitstreams: 1 dissertVF.pdf: 409746 bytes, checksum: ca7db8bc8077f795d693bed9b119adac (MD5) Previous issue date: 2010-07-07 / We develop a model to study shelf space allocation in retail. Retailers compete for consumers not only choosing prices but also by the space allocated to each product on shelves. Our approach depart from the existing literature on shelf allocation, as we model the problem of price setting and shelf allocation in an oligopolistic retail market. We present a simple model of retail competition in which prices are dispersed in the crosssection of stores but shelf allocation is not.

No description available.

The research is a study of the efficiency and robustness of genetic algorithm to instances of both discrete and continuous global optimization problems. We developed genetic algorithm based heuristics to find the global minimum to problem instances considered. In the discrete category, we considered two instances of real-world space allocation problems that arose from an academic environment in a developing country. These are the university timetabling problem and hostel space allocation problem. University timetabling represents a difficult optimization problem and finding a high quality solution is a challenging task. Many approaches, based on instances from developed countries, have been reported in the literature. However, most developing countries are yet to appreciate the deployment of heuristics and metaheuristics in handling the timetabling problem. We therefore worked on an instance from a university in Nigeria to show the feasibility and efficiency of heuristic method to the timetabling problem. We adopt a simplified bottom up approach in which timetable are build around departments. Thus a small portion of real data was used for experimental testing purposes. As with similar baseline studies in literature, we employ genetic algorithm to solve this instance and show that efficient solutions that meet stated constraints can be obtained with the metaheuristics. This thesis further focuses on an instance of university space allocation problem, namely the hostel space allocation problem. This is a new instance of the space allocation problems that has not been studied by metaheuristic researchers to the best of our knowledge. The problem aims at the allocation of categories of students into available hostel space. This must be done without violating any hard constraints but satisfying as many soft constraints as possible and ensuring optimum space utilization. We identified some issues in the problem that helped to adapt metaheuristic approach to solve it. The problem is multi-stage and highly constrained. We first highlight an initial investigation based on genetic algorithm adapted to find a good solution within the search space of the hostel space allocation problem. Some ideas are introduced to increase the overall performance of initial results based on instance of the problem from our case study. Computational results obtained are reported to demonstrate the effectiveness of the solution approaches employed. Sensitivity analysis was conducted on the genetic algorithm for the two SAPs considered to determine the best parameter values that consistently give good solutions. We noted that the genetic algorithms perform well specially, when repair strategies are incorporated. This thesis pioneers the application of metaheuristics to solve the hostel space allocation problem. It provides a baseline study of the problem based on genetic algorithms with associated test data sets. We report the best known results for the test instances. It is a known fact that many real-life problems are formulated as global optimization problems with continuous variables. On the continuous global optimization category therefore, we focus on improving the efficiency and reliability of real coded genetic algorithm for solving unconstrained global optimization, mainly through hybridization with exploratory features. Hybridization has widely been recognized as one of the most attractive approach to solving unconstrained global optimization. Literatures have shown that hybridization helps component heuristics to taking advantage of their individual strengths while avoiding their weaknesses. We therefore derived three modified forms of real coded genetic algorithm by hybridizing the standard real-coded genetic algorithm with pattern search and vector projection. These are combined to form three new algorithms namely, RCGA-PS, RCGA-P, and RCGA-PS-P. The hybridization strategy used and results obtained are reported and compared with the standard real-coded genetic algorithm. Experimental studies show that all the modified algorithms perform better than the original algorithm.

Many high-volume warehouses for small parts such as pharmaceuticals, cosmetics and office supplies seek to improve efficiency by creating forward pick areas in which many popular products are stored in a small area that is replenished from reserve storage. This thesis addresses the question of how to stock forward pick areas to maximum benefit by answering two key, inter-related decisions that have been called Assignment-Allocation. The assignment question asks which SKUs should be stored in the forward pick area? And the allocation question asks how much space should be allocated to each SKU? We show fast, simple, near-optimal algorithms to answer these questions in a variety of circumstances. To allocate space to SKUS, we introduce a Powers of Two allocation scheme designed to simplify shelf management. In addition, we present a ranking-based algorithm to assign SKUs and allocate space among multiple forward pick areas. We show that a similar algorithm that accounts for constraints on congestion and workload within the forward pick area. We also show how to determine the optimal assignment for warehouses with one or more forward pick areas that allocate space in ways that are common in practice. Warehouses frequently use the 80-20 rule to manage SKUs based on their popularity. We examine empirical data from thirty warehouses and analyze whether the power law distribution is a suitable fit. We test the hypothesis that the power law fits of warehouses in similar industries are themselves similar. We review explanations for why power laws arise in other settings and identify those that are plausible in the warehouse setting.

Research into appropriate plan of storage space is not a new issue. Several journals includestudies of storage space Allocation plan as the main topic whereas most of them focus on the subject of distribution center rather that of large scale object warehouse and few of them are to discuss the issue of storage space distribution from warehouse attendant¡¦s viewpoint.The cost of crane operation of large scale object is high; hence, inappropriate planning of large scale object may increase turning frequency of order picking. Due to this, storage operation speed will slow down and cost will rise, and thus will make it less competitive. Warehouse attendants always allot present storage by their own experiences; thus, they rarely transform their experiences into principles. If the principle of inbound operation can be documented by characters and if the implicit knowledge of warehouse attendants can be expressed explicitly, then storage department will have an efficient way of inbound operation for reference. By the method of Storage allocation strategy, this study is to analyze the necessary information of storage plan. It draws up several principles of storage assignment; according to the different production conditions the variable principles will be assigned to assist storage space assignment and ways of piling. By this way, it decreases frequency of using large scale object hanging machines and thus speeds up shipping simultaneously. Finally, this study performs a simulated analysis of inbound operation via simulation software. By this way of simulation, it makes comparisons between different experimental results. It is proven that this way can help warehouse attendants to choose appropriate mode of inbound operation according to the different orders.

No description available.

<p>In today's retail environment, there are many consumer packaged goods (CPG) in the same category with various brands and differential products under the same brand. These differential products appear in different dimension sizes, display facing areas, purchasing costs and selling prices which are competing for a limited space in retail store shelves. Product assortment and space allocation of the chosen products to a limited shelf space is becoming more and more important for retailers. In this thesis we critically review the existing literature of shelf space allocation optimization models and solution techniques. We then propose a comprehensive model for shelf space allocation for a product category. Products are allocated to a two-dimensional area of a shelf section where a shelf section consists of multilevel vertical shelves. We account for adjustable shelf heights and product and brand integrity in a shelf section. Unlike the existing optimization models in the literature, we model our demand not only as a function of the space allocated to a product, in terms of the number of display facings, but also as a function of vertical product location in a shelf section and price sensitivity. Stackability of the products is also considered and products can be stacked depending on their package. Our objective is to maximize the retailer's daily gross profit. We numerically show that incorporating price changes and adjustable shelf spaces can have major impacts on the retailers' profit. Finally, we provide directions and suggestions for future research in this growing area of research.</p> / Master of Applied Science (MASc)

Syfte och Frågeställning Studiens huvudsyfte är att skapa förståelse för hur layout och gruppering i butiksmiljöer, påverkar inredningsintresserade kvinnors butiksupplevelse. För att besvara studiens syfte har följande frågeställning formulerats: Hur påverkar layout och gruppering inredningsintresserade kvinnors butiksupplevelse i fysiska inredningsbutiker där produkter grupperas efter produktkategorier jämfört med där produktkategorier mixas? Metod, Teoretisk referensram och Empiri Studien är kvalitativ med en komparativ forskningsdesign och jämför två fall vilka utgörs av butikerna Hemtex, i Kalmar, och Hjärterum, i Borås. Den teoretiska referensramen utgörs av teorier om butiksmiljö och butiksupplevelser. Teorier om layout och gruppering har även tagits fram som en del av butiksmiljö. Studiens empiri samlades in genom intervjuer av tre kunder till respektive butik samt genom två stycken observationer, av de två butiksmiljöerna. Analys och Slutsatser I analysen diskuteras empiri och teori, där empirin från respektive butik jämförs. Analysen resulterar i studiens slutsatser vilket visar att olika arbetssätt gällande layout och gruppering i inredningsbutiker resulterar i olika butiksupplevelser. En inredningsbutik vars produkter grupperas efter produktkategorier främjar en funktionsfokuserad butiksupplevelse med dess funktionalitet men begränsade utrymme för inspiration. För en positiv upplevelse lämpar sig arbetssättet därmed bäst vid en målinriktad aktivitet. Vidare visar studien att mixade produktkategorier främjar en inspirationsfokuserad upplevelse med mer utrymme för inspiration men med sämre navigering, för en positiv upplevelse krävs därför mer av personalen vid en målinriktad aktivitet men lämpar sig väl för en fritidsorienterad aktivitet. / Purpose and Research question The main purpose of this study is to create understanding about how layout and space allocation, as aspects of store environments, affect the in-store customer experience (ISCX) of women interested in interior design. A question has been framed to fulfill the purpose of the study: How do layout and space allocation affect the ISCXof women interested in interior design where product are grouped by product categories compared with where product categories are mixed Method, Theoretical frame of reference and Empiricism The study is qualitative with a comparative research design that compares two cases that consist of the two stores Hemtex in Kalmar and Hjärterum in Borås. The theoretical frame of reference consists of theories about store environment and ISCX. These theories has been supplemented with theories about layout and space allocation, as a part of the store environment. The empiricism was gathered by interviews of three customers from each store and by two observations of the two store environments.  Analysis and Conclusions The analysis discuss the empiricism with the theories by comparing the empiricism of each store. The analysis is resulting in the study’s conclusions which show that different ways of working with layout and space allocations in interior design stores result in different ISCX. An interior design store with products grouped by product categories promotes a functional focused ISCX with its functionality but limited space for inspiration. The strategy is therefore most suitable for a targeted activity, for a positive experience. Further the study indicates that mixed product categories promotes an inspiring focused ISCX with more space for inspiration but less navigation, it is therefore most suitable for a leisure activity for a positive experience.

This thesis includes three self-contained projects: In the first project Bidding strategies and their impact on the auctioneer's revenue in combinatorial auctions, focusing on combinatorial auctions, we propose a simple and efficient model for evaluating the value of any bundle given limited information, design bidding strategies that efficiently select desirable bundles, and evaluate the performance of different bundling strategies under various market settings. In the second project Retailer shelf-space management with promotion effects, promotional investment effects are integrated with retail store assortment decisions and shelf space allocation. An optimization model for the category shelf-space allocation incorporating promotion effects is presented. Based on the proposed model, a category shelf space allocation framework with trade allowances is presented where a multi-player Retailer Stackelberg game is introduced to model the interactions between retailer and manufacturers. In the third project Supply-chain oriented robust parameter design, we introduce the game theoretical method, commonly used in supply-chain analysis to solve potential conflicts between manufacturers at various stages. These manufacturing chain partners collaboratively decide parameter design settings of the controllable factors to make the product less sensitive to process variations.

The goal of the thesis is to develop tools for improving shipbuilding workshops productivity. These tools have been tested on workshops of Aker Yards France shipyard, in Saint-Nazaire. The main chapter concerns the modelling of a workshop with the discrete-event simulation methodology. Production simulation is strongly used in some fields as automobile industry but is less used in shipbuilding. Indeed, the difficulty is that almost each piece to produce is unique. The objective is to show the importance of production simulation for such workshops. The modelled workshop is linked to a genetic algorithm to improve its productivity by optimizing its production sequence. Secondly a tool of creation and optimization of PERT networks has been created. The tool contains a graphical interface to easily handle networks and an optimization algorithm. This last one can minimize total cost of any project for a given total time. The tool has been linked to the modelled workshop. Consequently we get a PERT diagram of the workshop that can highlight critical activities. Finally, the last chapter explains the development of a tool to solve space allocation problems. Indeed space is often a critical point in many shipyards. Thanks to a user-friendly interface, the developed tool facilitates scheduling of these workshops. Furthermore it contains an optimization algorithm based on a heuristic approach to automate the planning process. In conclusion a set of efficient tools has been carried out with concrete applications on real workshops./Lobjectif de la thèse est de développer une série doutils qui permettent doptimiser la production dateliers de construction navale. Ces outils sont testés sur des ateliers du Chantier Naval Aker Yards France à Saint-Nazaire. Le chapitre principal traite de la modélisation dun atelier dit de PréPréFabrication sur le principe de la simulation de production à évènements discrets. La simulation de production est fortement utilisée dans certains domaines industrie automobile par exemple mais encore peu souvent en construction navale. En effet, la difficulté réside dans la diversité des pièces à produire. Lobjectif est de démontrer lintérêt de la simulation de production même dans ces ateliers où pratiquement chaque pièce à construire est unique. Latelier modélisé a été couplé avec un algorithme génétique pour améliorer sa productivité en optimisant la séquence de production. En second lieu, un outil de création et doptimisation des réseaux PERT a été créé. Loutil contient une interface graphique permettant une manipulation aisée des réseaux et un algorithme doptimisation. Ce dernier permet de minimiser le coût de réalisation dun projet pour un temps total fixé. En étant couplé avec le logiciel de simulation développé, une création automatique du diagramme PERT de latelier est créée, permettant de mettre clairement en évidence ses activités critiques. Finalement, le dernier chapitre de la thèse porte sur la création dun logiciel permettant de résoudre les problèmes de gestion de surface et de planification rencontrés dans certains chantiers. En effet, lespace au sol est un élément critique pour beaucoup dateliers de construction navale. Le logiciel développé, grâce à une interface conviviale et pratique, permet de faciliter grandement la planification. De plus, il contient un algorithme doptimisation basé sur des heuristiques afin dautomatiser le processus de planification. En conclusion, un ensemble doutils efficaces a été généré, avec des applications concrètes sur des ateliers réels.