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
About

About

António Galrão Ramos has a M.Sc. degree in Logistics by the Porto Business School, University of Porto, Portugal and a PhD degree in Industrial Engineering and Management, by the University of Porto. He is an Associate Professor with the Department of Mechanical Engineering, School of Engineering, Polytechnic of Porto (ISEP) and a researcher at the Institute for Systems and Computer Engineering of Porto (INESC TEC). He worked in multinational companies in Project Management, Operations and Logistics Management for over 10 years.

His main area of scientific activity is Operations Research and Management Science. Within Operations Research the main application area are the 3D Cutting and Packing Problems, while from the techniques viewpoint the research is centred in the use and development of metaheuristics approaches that integrate safety and logistics constraints, so that the solutions can be of practical use.

He regularly publishes the results of his research in the main operations research and management science international scientific journals and keeps a frequent activity in consultancy with private companies.

During his academic career he has mainly taught courses on Operations Research, Logistics, Warehouse and Inventory Management and Operations Management. He has served as Member of the Technical-Scientific Council of ISEP and he is now Vice-director of the BSc Program in Automotive Engineering at ISEP.

Interest
Topics
Details

Details

  • Name

    António Galrão Ramos
  • Since

    01st March 2013
005
Publications

2024

Pallets delivery: Two matheuristics for combined loading and routing

Authors
Silva, E; Ramos, AG; Moura, A;

Publication
EXPERT SYSTEMS WITH APPLICATIONS

Abstract
The implementation of novel regulatory and technical requirements for the distribution of vehicle axle weights in road freight transport introduces a new set of constraints on vehicle routing. Until now, axle weight distribution in determining the load plan for freight transport units has been overlooked in the vehicle routing process. Compliance with these axle weight constraints has become paramount for road freight transport companies, since noncompliance with the axle weight distribution legislation translates into heavy fines. This work aims to provide a tool capable of generating cargo loading plans and routing sequences for a palletised cargo distribution problem. The problem addressed integrates the capacitated vehicle routing problem with time window and the two-dimensional loading problem with load balance constraints. Two integrative solution approaches are proposed, one giving greater importance to the routing and the other prioritising the loading. In addition, a novel MILP model is proposed for the 2D pallet loading problem with load-balance constraints that take advantage of the standard dimension of the pallets. Extensive computational experiments were performed with a set of well-known literature benchmark instances, extended to incorporate additional features. The computational results show the effectiveness of the proposed approaches.

2024

Heuristics for online three-dimensional packing problems and algorithm selection framework for semi-online with full look-ahead

Authors
Ali, S; Ramos, AG; Carravilla, MA; Oliveira, JF;

Publication
APPLIED SOFT COMPUTING

Abstract
In online three-dimensional packing problems (3D-PPs), unlike offline problems, items arrive sequentially and require immediate packing decisions without any information about the quantities and sizes of the items to come. Heuristic methods are of great importance in solving online problems to find good solutions in a reasonable amount of time. However, the literature on heuristics for online problems is sparse. As our first contribution, we developed a pool of heuristics applicable to online 3D-PPs with complementary performance on different sets of instances. Computational results showed that in terms of the number of used bins, in all problem instances, at least one of our heuristics had a better or equal performance compared to existing heuristics in the literature. The developed heuristics are also fully applicable to an intermediate class between offline and online problems, referred to in this paper as a specific type of semi-online with full look-ahead, which has several practical applications. In this class, as in offline problems, complete information about all items is known in advance (i.e., full look-ahead); however, due to time or space constraints, as in online problems, items should be packed immediately in the order of their arrival. As our second contribution, we presented an algorithm selection framework, building on developed heuristics and utilizing prior information about items in this specific class of problems. We used supervised machine learning techniques to find the relationship between the features of problem instances and the performance of heuristics and to build a prediction model. The results indicate an 88% accuracy in predicting (identifying) the most promising heuristic(s) for solving any new instance from this class of problems.

2022

On-line three-dimensional packing problems: A review of off-line and on-line solution approaches

Authors
Ali, S; Ramos, AG; Carravilla, MA; Oliveira, JF;

Publication
COMPUTERS & INDUSTRIAL ENGINEERING

Abstract
Three-Dimensional Packing Problems (3D-PPs) can be applied to effectively reduce logistics costs in various areas, such as airline cargo management and warehouse management. In general, 3D-PP studies can be divided into two different streams: those tackling the off-line problem, where full knowledge about items is available beforehand; and those tackling the on-line (real-time) problem, where items arrive one by one and should be packed immediately without having full prior knowledge about them. During the past decades, off-line and online 3D-PPs have been studied in the literature with various constraints and solution approaches. However, and despite the numerous practical applications of on-line problems in real-world situations, most of the literature to date has focused on off-line problems and is quite sparse when it comes to on-line solution methods. In this regard, and despite the different nature of on-line and off-line problems, some approaches can be applied in both environments. Hence, we conducted an in-depth and updated literature review to identify and structure various constraints and solution methods employed by researchers in off-line and on-line 3D-PPs. Building on this, by bringing together the two separate streams of the literature, we identified several off-line approaches that can be adopted in on-line environments. Additionally, we addressed relevant research gaps and ways to bridge them in the future, which can help to develop this research field.

2022

CrossLog: Automatic Mixed-Palletizing for Cross-Docking Logistics Centers

Authors
Rocha, P; Ramos, AG; Silva, E;

Publication
COMPUTATIONAL LOGISTICS (ICCL 2022)

Abstract
The CrossLog project aims to investigate, study, develop and implement an automated and collaborative cross-docking system (aligned with Industry 4.0) capable of moving and managing the flow of products within the warehouse in the fastest and safest way. In CrossLog, the ability to generate intelligent three-dimensional packing patterns is essential to ensure the flexibility and productivity of the cross-docking system while ensuring the stability of the palletised load. In this work, a heuristic solution approach is proposed to generate efficient pallet packing patterns that simultaneously minimise the total number of pallets required and address the balance of weight and volume between pallets. Computational experiments with data from a real company demonstrate the quality of the proposed solution approach.

2021

Complexity Constraint in the Distributor's Pallet Loading Problem

Authors
Barros, H; Pereira, T; Ramos, AG; Ferreira, FA;

Publication
MATHEMATICS

Abstract
This paper presents a study on the complexity of cargo arrangements in the pallet loading problem. Due to the diversity of perspectives that have been presented in the literature, complexity is one of the least studied practical constraints. In this work, we aim to refine and propose a new set of metrics to measure the complexity of an arrangement of cargo in a pallet. The parameters are validated using statistical methods, such as principal component analysis and multiple linear regression, using data retrieved from the company logistics. Our tests show that the number of boxes was the main variable responsible for explaining complexity in the pallet loading problem.

Supervised
thesis

2022

Sistemas de Informação das empresas portuguesas: Análise do nível da maturidade e dos principais fatores que a determinam

Author
Fábio André Rodrigues de Oliveira

Institution
UP-FEP

2022

Spotting Fraud: Detecting patterns and red flags in financial networks

Author
Joana Isabel Cortez Trindade

Institution
UP-FEP

2022

O perfil das empresas portuguesas internacionalizadas no setor do vestuário - análise da propensão e intensidade exportadora

Author
Alexandra Sousa Pinto

Institution
UP-FEP

2022

URBAN NAVIGATION ? HANDLING OPENSTREETMAP DATA FOR AN EASY TO DRIVE ROUTE

Author
ROSÁRIA SPINA

Institution
IPP-ISEP

2022

Unemployment Hysteresis in OECD Countries – The impact of sampling on unit root tests

Author
Pedro Guilherme Santos Martins

Institution
UP-FEP