Dimitris Souravlias

Port of Rotterdam

The standard particle swarm optimization (PSO) algorithm allocates the total available budget of function evaluations equally and concurrently among the particles of the swarm. In the present work, we propose a new variant of PSO where each particle is dynamically assigned different computational budget based on the quality of its neighborhood. The...

We propose a novel algorithm portfolio model that incorporates time series forecasting techniques to predict online the performance of its constituent algorithms. The predictions are used to allocate computational resources to the algorithms, accordingly. The proposed model is demonstrated on parallel algorithm portfolios consisting of three popula...

This book covers algorithm portfolios, multi-method schemes that harness optimization algorithms into a joint framework to solve optimization problems. It is expected to be a primary reference point for researchers and doctoral students in relevant domains that seek a quick exposure to the field. The presentation focuses primarily on the applicabil...

Circulant weighing matrices constitute a special type of combinatorial matrices that have attracted scientific interest for many years. The existence and determination of specific classes of circulant weighing matrices remains an active research area that involves both theoretical algebraic techniques as well as high-performance computational optim...

The design and development of an offshore port terminal is a complex task that involves distinctive design and decision challenges. In this paper, we propose the implementation of a floating, modular, platform that can act as an additional terminal of a port, with the aim of expanding its current container handling capacity. To this end, we introdu...

Automated ground vehicles (AGVs) are essential parts of container operations at many ports. Forming platoons—as conceptually established in trucking—may allow these vehicles to directly cater demand points such as dry ports in the hinterland. In this work, we aim to assess such AGV platoons in terms of operational efficiency and costs, considering...

Inland waterway transport is becoming attractive due to its minimum environmental impact in comparison with other transportation modes. Fixed timetables and routes are adopted by most barge operators, avoiding the full utilization of the available resources. Therefore a flexible model is adopted to reduce the transportation cost and environmental i...

Automated ground vehicles (AGVs) are essential parts of container operations at many ports. Forming platoons—as conceptually established in trucking—may allow these vehicles to directly cater demand points such as dry ports in the hinterland. In this work, we aim to assess such AGV platoons in terms of operational efficiency and costs, considering...

The scheduling of quay cranes is a core logistics challenge that affects significantly the loading and unloading time of a vessel berthed at a container terminal. In this paper, we study the Stochastic Floating Quay Crane Scheduling Problem involving cranes situated on the quay of an offshore modular platform. Specifically, we consider the case in...

The present study aims at identifying possible relations between solution features and different characteristics of the Swap-body Vehicle Routing Problem. For this purpose, an investigation has been conducted on two established benchmark sets. Our analysis reveals the existence of hidden patterns with respect to various aspects of the corresponding...

This book constitutes the refereed post-conference proceedings of the Special Event on the Analysis of Experimental Algorithms, SEA² 2019, held in Kalamata, Greece, in June 2019. The 35 revised full papers presented were carefully reviewed and selected from 45 submissions. The papers cover a wide range of topics in both computer science and operat...

Metaheuristic optimization has been long established as a promising alternative to classical optimization approaches. However, the selection of a specific metaheuristic algorithm for solving a given problem constitutes an impactful decision. This can be attributed to possible performance fluctuations of the metaheuristic during its application eith...

Research on the existence of specific classes of combinatorial matrices such as the Circulant Weighing Matrices (CWMs) lies in the core of diverse theoretical and computational efforts. Modern metaheuristics have proved to be valuable tools for solving such problems. Recently, parallel Algorithm Portfolios (APs) composed of established search algor...

Standard Particle Swarm Optimization (PSO) allocates the total available computational budget, in terms of function evaluations, equally among the particles at each iteration of the algorithm. The present work introduces an alternative, which employs neighborhood ranking for allocating the computational budget to the particles. The proposed PSO var...

In this paper, we address the problem of evaluating historical queries on graphs. To this end, we investigate the use of graph deltas, i.e., a log of time-annotated graph operations. Our storage model maintains the current graph snapshot and the delta. We reconstruct past snapshots by applying appropriate parts of the graph delta on the current sna...

The growth of online services has created the need for duplicate elimination in high-volume streams of events. The sheer volume of data in applications such as pay-per-click clickstream processing, RSS feed syndication and notification services in social sites such Twitter and Facebook makes traditional centralized solutions hard to scale. In this...

In publish/subscribe systems, users express their interests in specific items of information and get notified when relevant data items are produced. Such systems allow users to stay informed without the need of going through huge amounts of data. However, as the volume of data being created increases, some form of ranking of matched events is neede...