Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Publications

Publications by CESE

2022

Cognitive Digital Twin Enabling Smart Product-Services Systems: A Literature Review

Authors
Enrique, DV; Soares, AL;

Publication
IFIP Advances in Information and Communication Technology

Abstract
Cognitive Digital Twin (CDT) has been taking considerable attention in several recent studies. CDT is considered as a promising evolution of Digital Twin bringing new smart and cognitive capabilities. Therefore, it is important to understand how companies can exploit this new technology and create new data-driven business models. Considering that context this article aims to identify Smart PSS business model based on Cognitive Digital Twin platforms. To reach this goal a literature review was conducted. As a principal contribution this study brings a set of new business models to offer Smart PSS based on cognitive digital twins. Moreover, the study presents several real cases of companies that are currently using the cognitive capabilities supplied by edge companies of the digital twin technologies. © 2022, IFIP International Federation for Information Processing.

2022

How visible is your supply chain? A model for supply chain visibility assessment

Authors
Messina, D; Soares, AL; Barros, AC; Zimmermann, R;

Publication
SUPPLY CHAIN FORUM

Abstract
Recent studies have highlighted the potential of supply chain visibility (SCV) to improve companies' performance, support the decision-making process and increase the resilience and sustainability of supply chains (SC). However, the definition and the approaches to manage visibility are not consensual, especially when it comes to its assessment. This paper studies the influence that some characteristics of the information shared among SC partners have on SCV and provides a model that allows to assess the level of visibility. Focus group research was used to discuss the visibility assessment model with academic and practical experts and case studies were conducted to evaluate the implementation of the model in real contexts. The results support the applicability of the model in complex SCs and show that the visibility indices proposed can help managers to identify the SC partners where improvement actions are needed. This study contributes to literature and practice by means of a model to assess the visibility throughout the SC by considering different types and characteristics of the information shared.

2022

A Novel Discrete Particle Swarm Optimization Algorithm for the Travelling Salesman Problems

Authors
Sequeiros, JA; Silva, R; Santos, AS; Bastos, J; Varela, MLR; Madureira, AM;

Publication
INNOVATIONS IN INDUSTRIAL ENGINEERING

Abstract
There are Optimization Problems that are too complex to be solved efficiently by deterministic methods. For these problems, where deterministic methods have proven to be inefficient, if not completely unusable, it is common to use approximate methods, that is, optimization methods that solve the problems quickly, regardless of their size or complexity, even if they do not guarantee optimal solutions. In other words, methods that find acceptable solutions, efficiently. One particular type of approximate method, which is particularly effective in complex problems, are metaheuristics. Particle Swarm Optimization is a population-based metaheuristic, which has been particularly successful. In order to broaden the application and overcome the limitation of Particle Swarm Optimization, a discrete version of the metaheuristics is proposed. The Discrete Particle Swarm Optimization, DPSO, will change the PSO algorithm so it can be applied to discrete optimization problems. This alteration will focus on the velocity update equation. The DPSO was tested in an instance of the Traveling Salesman Problem, att48, 48 points problems proposed by Padberg and Rinaldi, which showed some promising results.

2022

A Tool for Air Cargo Planning and Distribution

Authors
Costa, D; Santos, AS; Bastos, JA; Madureira, AM; Brito, MF;

Publication
INNOVATIONS IN BIO-INSPIRED COMPUTING AND APPLICATIONS, IBICA 2021

Abstract
In this paper, a decision support application, for the air cargo planning and distribution, is proposed. The freight forwarding sector has been working to be assertive and efficient in responding to the market through an efficient approach to planning and allocation problems. The main goal is to minimize costs and improve performance. A real air cargo distribution problem for a freight forwarder was addressed. This project emerged from the need to efficiently plan and minimize costs for the distribution of thousands of m(3) (cubic meters) of air cargo, while considering the market restrictions, such as aircraft availability and transportation fees. Through the GRG algorithm adaptation to the real problem, it was possible to respond to the main goal of this paper. The development of an easy-to-use application ensures a quick response in the air distribution planning, focusing on cost reduction in transportation. With the application development it is possible to obtain real earnings with immediate effect.

2022

Analysis and Comparison of DABC and ACO in a Scheduling Problem

Authors
Ferreira, AR; Soares, Â; Santos, AS; Bastos, JA; Varela, LR;

Publication
Lecture Notes in Mechanical Engineering

Abstract
The present study consists in the comparison of two metaheuristics in a scheduling problem (SP), in particular in the minimization of the makespan in flowshop problem. The two selected metaheuristics were DABC (Discrete Artificial Bee Colony) and ACO (Ant Colony Optimization). For the performance analysis, the metaheuristics were tuned with an extensive DOE study, subsequently, several tests were performed. Thirty-one evenly distributed instances were generated for a in-depth analysis and each one was subjected to three runs for each metaheuristic. Through the results obtained, it was possible to concluded that the DABC has a better performance when compared to SA and ACO. SA and ACO have a similar performance in the chosen problem. These conclusions were supported by descriptive statistics and statistical inference. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

2022

3D printed devices to avoid hand contact with commonly shared surfaces

Authors
Pais, A; Ferreira, C; Pires, V; Silva, V; Alves, JL; Bastos, J; Belinha, J;

Publication
INTERNATIONAL JOURNAL OF INTERACTIVE DESIGN AND MANUFACTURING - IJIDEM

Abstract
In the context of the COVID-19 pandemic, public spaces had to be quickly adapted to the new circumstances especially under the uncertainty of the pandemic development. Door handles are some of the most touched surfaces and so, this point of contagion was chosen to be tackled and two solutions were developed that would prevent direct touch with the handle: a portable and a fixed device. The portable device (HYHOOK + HYTIP) is a hook-like device holding a finger cover, which permits to open doors and push buttons safely. The fixed device (HANDGENIC) is meant to be assembled in door handles to equip buildings, such as universities or schools. With the fixed device, the user can open the door using their forearm which makes them less likely to transfer any particles to eyes, nose or mouth. The 3D printing Fused Filament Fabrication (FFF) process was selected as manufacturing technique, which allows the fast production of prototypes. This work portrays the development process and design iterations taking into consideration the concerns about the functioning of the devices and possible failures or alternative uses. To assure structural integrity of the parts, finite element (FE) analysis was used to verify its mechanical response. As conclusion, it was found that FE analysis indicate that the devices are structurally sound to be used in public spaces and that 3D printing is a useful way to rapidly develop devices while testing several design possibilities.

  • 37
  • 219