A5067876652- Vehicle Routing Optimization Methods
- Maritime Ports and Logistics
- Optimization and Mathematical Programming
- Optimization and Packing Problems
- Supply Chain and Inventory Management
- Advanced Optical Network Technologies
- Facility Location and Emergency Management
- Maritime Transport Emissions and Efficiency
- Advanced Graph Theory Research
- Risk and Portfolio Optimization
- Scheduling and Optimization Algorithms
- Software-Defined Networks and 5G
- Transportation Planning and Optimization
- Optimization and Search Problems
- Interconnection Networks and Systems
- Optical Network Technologies
- Advanced Manufacturing and Logistics Optimization
- Transportation and Mobility Innovations
- Advanced Photonic Communication Systems
- Constraint Satisfaction and Optimization
- Topology Optimization in Engineering
- Sustainable Supply Chain Management
- Complexity and Algorithms in Graphs
- Probabilistic and Robust Engineering Design
- Composite Structure Analysis and Optimization
University of Aveiro
2015-2024
Instituto de Telecomunicações
2019-2023
Centro de Investigação em Artes e Comunicação
2023
Group for Research in Decision Analysis
2020
University of Maryland, College Park
2018
Polytechnic University
2018
John Wiley & Sons (United States)
2018
University of Lisbon
1999
Abstract A single‐product maritime inventory routing problem (MIRP) is studied in which the production and consumption rates vary over planning horizon. The involves a heterogeneous fleet multiple ports with limited storage capacity. Two discrete time formulations are developed: an original model reformulated that pure fixed charge network flow (FCNF) side constraints. Mixed integer sets arising from decomposition of identified. In particular, several lot‐sizing relaxations derived for used...
We consider a single product maritime inventory routing problem in which the production and consumption rates are constant over planning horizon. The involves heterogeneous fleet multiple ports with limited storage capacity. Maritime transportation is characterized by high levels of uncertainty, sailing times can be severely influenced varying unpredictable weather conditions. To deal this paper investigates use adaptable robust optimization where assumed to belong well-known budget polytope...
Berth allocation problems are amongst the most important occurring in port terminals, and they greatly affected by several unpredictable events. As a result, study of these under uncertainty has been target more researchers. Following this research line, we consider berth problem uncertain handling times. A distributionally robust two-stage model is presented to minimize worst-case expected sum delays with respect set possible probability distributions The solutions proposed obtained an...
We consider a short sea fuel oil distribution problem occurring in the archipelago at Cape Verde. Here, an company is responsible for routing and scheduling of ships between islands such that demand various products satisfied during planning horizon. Inventory management considerations are taken into account side but not supply side. The ports have restricted opening hours each day, so multiple time windows considered. In contrast to many other studies within ship scheduling, here spend...
Abstract Quay cranes are among the most important resources in port terminals, and their efficient use is crucial for terminals to remain competitive market. The problem of determining sequence tasks performed by quay that minimizes turnaround time a vessel an NP‐hard known as crane scheduling (QCSP). In this paper, we consider unidirectional QCSP under uncertain processing times, where only allowed move specific direction. We start presenting first distributionally robust optimization (DRO)...
Common approaches to solving a robust optimization problem decompose the into master (MP) and adversarial problems (APs). The MP contains original constraints, written, however, only for finite numbers of scenarios. Additional scenarios are generated on fly by APs. We consider in this work budgeted uncertainty polytope from Bertsimas Sim, widely used literature, propose new dynamic programming algorithms solve APs that based maximum number deviations allowed size deviations. Our can be...
Given a social network modelled by graph, the goal of influence maximization problem is to find k vertices that maximize number active through process diffusion. For this diffusion, linear threshold model considered. A new algorithm, called ClusterGreedy, proposed solve problem. The ClusterGreedy algorithm creates partition original set nodes into small subsets (the clusters), applies SimpleGreedy subgraphs induced each subset nodes, and obtains seed from combination cluster solving an...
We consider a stochastic single item production‐inventory‐routing problem with producer, multiple clients, and vehicles. At the demand is allowed to be backlogged incurring penalty cost. Demands are considered uncertain. A recourse model presented, valid inequalities introduced enhance model. new general approach that explores sample average approximation (SAA) method introduced. In method, several sets generated solved independently in order obtain set of candidate solutions. Then,...