Cookies Policy
We use cookies to improve our site and your experience. By continuing to browse our site you accept our cookie policy. Find out More
Close
  • Menu
Interest
Topics
Details

Details

003
Publications

2018

Allocating products on shelves under merchandising rules: Multi-level product families with display directions

Authors
Bianchi Aguiar, T; Silva, E; Guimardes, L; Carravilla, MA; Oliveira, JF;

Publication
Omega (United Kingdom)

Abstract
Retailers’ individual products are categorized as part of product families. Merchandising rules specify how the products should be arranged on the shelves using product families, creating more structured displays capable of increasing the viewers’ attention. This paper presents a novel mixed integer programming formulation for the Shelf Space Allocation Problem considering two innovative features emerging from merchandising rules: hierarchical product families and display directions. The formulation uses single commodity flow constraints to model product sequencing and explores the product families’ hierarchy to reduce the combinatorial nature of the problem. Based on the formulation, a mathematical programming-based heuristic was also developed that uses product families to decompose the problem into a sequence of sub-problems. To improve performance, its original design was adapted following two directions: recovery from infeasible solutions and reduction of solution times. A new set of real case benchmark instances is also provided, which was used to assess the formulation and the matheuristic. This approach will allow retailers to efficiently create planograms capable of following merchandising rules and optimizing shelf space revenue. © 2017 Elsevier Ltd

2018

The time window assignment vehicle routing problem with product dependent deliveries

Authors
Neves Moreira, F; da Silva, DP; Guimaraes, L; Amorim, P; Almada Lobo, B;

Publication
Transportation Research Part E: Logistics and Transportation Review

Abstract

2017

Tactical production and distribution planning with dependency issues on the production process

Authors
Wei, WC; Guimaraes, L; Amorim, P; Almada Lobo, B;

Publication
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE

Abstract
Tactical production-distribution "planning models have attracted a great deal of attention in the past decades. In these models, production and distribution decisions are considered simultaneously such that the combined plans are more advantageous than the plans resolved in a hierarchical planning process. We consider a two-stage production process, where in the first stage raw materials are transformed into continuous resources that feed the discrete production of end products in the second stage. Moreover, the setup times and costs of resources depend on the sequence in which they are processed in the first stage. The minimum scheduling unit is the product family which consists of products sharing common resources and manufacturing processes. Based on different mathematical modelling approaches to the production in the first stage, we develop a sequence-oriented formulation and a product-oriented formulation, and propose decomposition-based heuristics to solve this problem efficiently. By considering these dependencies arising in practical production processes, our model can be applied to various industrial cases, such as the beverage industry or the steel industry. Computation tests on instances from an industrial application are provided at the end of the paper.

2017

Alternative Mathematical Models and Solution Approaches for Lot-Sizing and Scheduling Problems in the Brewery Industry: Analyzing Two Different Situations

Authors
Baldo, TA; Morabito, R; Santos, MO; Guimarães, L;

Publication
Mathematical Problems in Engineering

Abstract
This research proposes new approaches to deal with the production planning and scheduling problem in brewery facilities. Two real situations found in factories are addressed, which differ by considering (or not) the setup operations in tanks that provide liquid for bottling lines. Depending on the technology involved in the production process, the number of tank swaps is relevant (Case A) or it can be neglected (Case B). For both scenarios, new MIP (Mixed Integer Programming) formulations and heuristic solution methods based on these formulations are proposed. In order to evaluate the approach for Case A, we compare the results of a previous study with the results obtained in this paper. For the solution methods and the result analysis of Case B, we propose adaptations of Case A approaches yielding an alternative MIP formulation to represent it. Therefore, the main contributions of this article are twofold: (i) to propose alternative MIP models and solution methods for the problem in Case A, providing better results than previously reported, and (ii) to propose new MIP models and solution methods for Case B, analyzing and comparing the results and benefits for Case B considering the technology investment required. © 2017 Tamara A. Baldo et al.

2016

A long-haul freight transportation problem: Synchronizing resources to deliver requests passing through multiple transshipment locations

Authors
Neves Moreira, F; Amorim, P; Guimaraes, L; Almada Lobo, B;

Publication
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

Abstract
This research aims at tackling a real-world long-haul freight transportation problem where tractors are allowed to exchange semi-trailers through several transshipment points until a request reaches its destiny. The unique characteristics of the considered logistics network allow for providing long-haul services by means of short-haul jobs, drastically reducing empty truck journeys. A greater flexibility is achieved with faster responses. Furthermore, the planning goals as well as the nature of the considered trips led to the definition of a new problem, the long-haul freight transportation problem with multiple transshipment locations. A novel mathematical formulation is developed to ensure resource synchronization while including realistic features, which are commonly found separately in the literature. Considering the complexity and dimension of this routing and scheduling problem, a mathematical programming heuristic (matheuristic) is developed with the objective of obtaining good quality solutions in a reasonable amount of time, considering the logistics business context. We provide a comparison between the results obtained for 79 real-world instances. The developed solution method is now the basis of a decision support system of a Portuguese logistics operator (LO).

Supervised
thesis

2017

Estimating wind turbine generators failures using machine learning

Author
João Miguel Guimarães Fidalgo Roque

Institution
UP-FEUP

2017

Otimização dos Parâmetros de Controlo de Processo dos Equipamentos de Tratamento Sensorial de Rolhas Naturais

Author
João Wandschneider Carvalho de Sousa

Institution
UP-FEUP

2017

Deteção e eliminação das perdas de eficiência numa linha de produção de enchimento de aerossóis

Author
João dos Santos Barbosa

Institution
UP-FEUP

2017

Planeamento de Produção Integrado com Sistema de Gestão e Controlo de Produção (MES)

Author
Nuno Alexandre Vitorino Fernandes

Institution
UP-FEUP

2016

Optimization Algorithms for the Inventory Routing Problem

Author
António Silva Fernandes

Institution
UP-FEUP