Cookies
O website necessita de alguns cookies e outros recursos semelhantes para funcionar. Caso o permita, o INESC TEC irá utilizar cookies para recolher dados sobre as suas visitas, contribuindo, assim, para estatísticas agregadas que permitem melhorar o nosso serviço. Ver mais
Aceitar Rejeitar
  • Menu
Publicações

Publicações por CESE

2022

Obstacle-aware On-demand 5G Network using a Mobile Robotic Platform

Autores
Maia, D; Coelho, A; Ricardo, M;

Publicação
2022 18TH INTERNATIONAL CONFERENCE ON WIRELESS AND MOBILE COMPUTING, NETWORKING AND COMMUNICATIONS (WIMOB)

Abstract
5G has become increasingly popular nowadays, mainly due to its characteristics which enable high data rates and low latency. At the same time, mobile robotic platforms, such as drones and robots, appeared as suitable platforms to carry radio stations, enabling the on-demand placement of 5G communications cells. The main contribution of this paper is an obstacle-aware on-demand 5G network. The proposed solution consists of a 5G radio station (gNB) carried by a mobile robotic platform capable of providing obstacle-aware wireless connectivity to 5G User Equipments (UEs), leveraged by a novel virtual network function - On-Demand Mobility Management Function (ODMMF). ODMMF is designed to integrate the 5G Core network and it allows to monitor the radio conditions provided to the served UEs, while enabling the positioning of the mobile robotic platform remotely by taking advantage of the visual information provided by on-board video cameras. The proposed solution was validated using an experimental prototype, under a representative networking scenario.

2022

The Probabilistic Travelling Salesman Problem with Crowdsourcing

Autores
Santini, A; Viana, A; Klimentova, X; Pedroso, JP;

Publicação
COMPUTERS & OPERATIONS RESEARCH

Abstract
We study a variant of the Probabilistic Travelling Salesman Problem arising when retailers crowdsource last-mile deliveries to their own customers, who can refuse or accept in exchange for a reward. A planner must identify which deliveries to offer, knowing that all deliveries need fulfilment, either via crowdsourcing or using the retailer's own vehicle. We formalise the problem and position it in both the literature about crowdsourcing and among routing problems in which not all customers need a visit. We show that to evaluate the objective function of this stochastic problem for even one solution, one needs to solve an exponential number of Travelling Salesman Problems. To address this complexity, we propose Machine Learning and Monte Carlo simulation methods to approximate the objective function, and both a branch-and-bound algorithm and heuristics to reduce the number of evaluations. We show that these approaches work well on small size instances and derive managerial insights on the economic and environmental benefits of crowdsourcing to customers.

2022

On the development and deployment of an IIoT Infrastructure for the Fish Canning Industry

Autores
Teixeira, S; Arrais, R; Dias, R; Veiga, G;

Publicação
Procedia Computer Science

Abstract

2022

Supply Chain Resiliency in the Pharmaceutical Industry – a Simulation-Based Approach

Autores
da Silva, ACT; de Sousa, JP; Marques, CM;

Publicação
Proceedings of the International Conference on Industrial Engineering and Operations Management

Abstract

2022

Energy-Efficient Scheduling in Job Shop Manufacturing Systems: A Literature Review

Autores
Fernandes, JMRC; Homayouni, SM; Fontes, DBMM;

Publicação
SUSTAINABILITY

Abstract
Energy efficiency has become a major concern for manufacturing companies not only due to environmental concerns and stringent regulations, but also due to large and incremental energy costs. Energy-efficient scheduling can be effective at improving energy efficiency and thus reducing energy consumption and associated costs, as well as pollutant emissions. This work reviews recent literature on energy-efficient scheduling in job shop manufacturing systems, with a particular focus on metaheuristics. We review 172 papers published between 2013 and 2022, by analyzing the shop floor type, the energy efficiency strategy, the objective function(s), the newly added problem feature(s), and the solution approach(es). We also report on the existing data sets and make them available to the research community. The paper is concluded by pointing out potential directions for future research, namely developing integrated scheduling approaches for interconnected problems, fast metaheuristic methods to respond to dynamic scheduling problems, and hybrid metaheuristic and big data methods for cyber-physical production systems.

2022

Energy-Efficient Scheduling of Intraterminal Container Transport

Autores
Homayouni, SM; Fontes, DBMM;

Publicação
Springer Optimization and Its Applications

Abstract
Maritime transportation has been, historically, a major factor in economic development and prosperity since it enables trade and contacts between nations. The amount of trade through maritime transport has increased drastically; for example, about 90% of the European Union’s external trade and one-third of its internal trade depend on maritime transport. Major ports, typically, incorporate multiple terminals serving containerships, railways, and other forms of hinterland transportation and require interterminal and intraterminal container transport. Many factors influence the productivity and efficiency of ports and hence their economic viability. Moreover, environmental concerns have been leading to stern regulation that requires ports to reduce, for example, greenhouse gas emissions. Therefore, port authorities need to balance economic and ecological objectives in order to ensure sustainable growth and to remain competitive. Once a containership moors at a container terminal, several quay cranes are assigned to the ship to load/unload the containers to/from the ship. Loading activities require the containers to have been previously made available at the quayside, while unloading ones require the containers to be removed from the quayside. The containers are transported between the quayside and the storage yard by a set of vehicles. This chapter addresses the intraterminal container transport scheduling problem by simultaneously scheduling the loading/unloading activities of quay cranes and the transport (between the quayside and the storage yard) activities of vehicles. In addition, the problem includes vehicles with adjustable travelling speed, a characteristic never considered in this context. For this problem, we propose bi-objective mixed-integer linear programming (MILP) models aiming at minimizing the makespan and the total energy consumption simultaneously. Computational experiments are conducted on benchmark instances that we also propose. The computational results show the effectiveness of the MILP models as well as the impact of considering vehicles with adjustable speed, which can reduce the makespan by up to 16.2% and the total energy consumption by up to 2.5%. Finally, we also show that handling unloading and loading activities simultaneously rather than sequentially (the usual practice rule) can improve the makespan by up to 34.5% and the total energy consumption by up to 18.3%. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

  • 27
  • 203