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

005
Publications

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

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.

2021

Analysis of the Impact of Physical Internet on the Container Loading Problem

Authors
Ferreira, AR; Ramos, AG; Silva, E;

Publication
COMPUTATIONAL LOGISTICS (ICCL 2021)

Abstract

2020

A generic mathematical formulation for two-echelon distribution systems based on mobile depots

Authors
Oliveira, B; Ramos, AG; De Sousa, JP;

Publication
Transportation Research Procedia

Abstract
The negative impacts of urban logistics have fostered the search for new distribution systems in inner city deliveries. In this context, interesting solutions can be developed around two-echelon distribution systems based on mobile depots (2E-MD), where loads arriving from the periphery of the city are directly transferred, at intermediate locations, from larger to smaller vehicles more suited to operate in the city centre. Four types of 2E-MD can be identified, according to the degree of mobility of larger vehicles and their accessibility to customers. In this paper, we propose a generic three-index arc-based mixed integer programming model, for a two-echelon vehicle routing problem, with synchronisation at the satellites and multi-trips at the second echelon. This generic base model is formulated for the most restrictive type of problems, where larger vehicles visit a a single transfer location and do not perform direct deliveries to customers, but it can be easily extended to address the other types of 2E-MD. The paper presents how these extensions account for the characteristics of the different types of 2E-MD. The generic model, its extensions and the impact of a set of valid inequalities are tested using problem instances adapted from the VRP literature. Results show that the proposed extensions do adequately address the specific features of the different types of 2E-MD, including multiple visits to satellites, and direct deliveries to customers. Nevertheless, the resulting models can only tackle rather small instances, even if the formulations can be strengthened by adding the valid inequalities proposed in the paper. © 2020 The Authors. Published by ELSEVIER B.V.

2019

Capacitated Vehicle Routing Problem with Heterogeneous Fixed Proprietary Fleet and Outsourcing Delivery—A Clustering-Based Approach

Authors
Bertoluci, R; Ramos, AG; Lopes, M; Bastos, J;

Publication
Springer Proceedings in Mathematics and Statistics

Abstract
This paper describes a solution method that was created with the objective of obtaining a more efficient finished goods distribution process for a food industry company. The finished goods distribution process involves the use of the companys own fleet to serve a specific group of customers, and the use of outsourcing transportation services that can make direct and transshipment customer deliveries. The complexity of the problem is due to the need to decide which customers should be served by each of the outsourcing transportation services, direct or transshipment, and to find cost efficient solutions for the multiple vehicle routing problems created. First, an original clustering method consisting of a logical division of the customer orders using a delivery ratio based on the transportation unit cost, distance and order weight, is used to define customer clusters by service type. Then, an exact method based on a mixed integer programming model, is used to obtain optimal vehicle routing solutions, for each cluster created. The solution method for the company real instances, proved able to reach the initial proposed objectives and obtain promising results that suggest an average reduction of 34% for the operational costs, when compared to the current distribution model of the company. © 2019, Springer Nature Switzerland AG.

Supervised
thesis

2021

Multi-Language Software Metrics

Author
Gil Dinis Magalhães Teixeira

Institution
UP-FEUP

2020

O impacto do congestionamento no roteamento de veículos para a logística urbana

Author
MICHAEL EMANUEL SOARES VIEIRA

Institution
IPP-ISEP

2020

IMPACTO DA PHYSICAL INTERNET NO CONTAINER LOADING PROBLEM

Author
JOÃO PEDRO COUTO SILVA

Institution
IPP-ISEP

2020

OTIMIZAÇÃO DA ENTREGA DE ENCOMENDAS POR DRONES

Author
JOÃO PEDRO MOUTINHO ALVES BARBOSA

Institution
IPP-ISEP

2020

O problema de roteamento de veículos com custos de combustível dependentes do peso

Author
DIOGO JOSÉ LAGES PEREIRA MORGADO RIBEIRO

Institution
IPP-ISEP