Mario Marinelli

Prof. Mario Marinelli

DICATECh, Politecnico di Bari, Bari, Puglia, Italy
orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 September 2020 in Sustainability
Verified
Journal Article
Open access
PDF file
MGMariano Gallo
Mariano Gallo
Mario MarinelliMario Marinelli
Mario Marinelli
In this paper, a review of the main actions and policies that can be implemented to promote sustainable mobility is proposed. The work aims to provide a broad, albeit necessarily not exhaustive, analysis of the main studies and research that from different points of view have focused on sustainable mobility. The structure of the paper enables the reader to easily identify the topics covered and the studies related to them, so as to guide him/her to the related in-depth studies. In the first part of the paper, there is a preliminary analysis of the concept of sustainable mobility, the main transport policies implemented by the European Union and the USA, and the main statistical data useful to analyze the problem. Next, the main policies that can promote sustainable mobility are examined, classifying them into three topics: Environmental, socio-economic, and technological. Many of the policies and actions examined could be classified into more than one of the three categories used; for each of them, there is a description and the main literature work on which the topic can be analyzed in more detail. The paper concludes with a discussion on the results obtained and the prospects for research.

12 January 2018 in IET Intelligent Transport Systems
Verified
Journal Article
Open access
PDF file
Mario MarinelliMario Marinelli
Mario Marinelli
LCLeonardo Caggiani
Leonardo Caggiani
Michele OttomanelliMichele Ottomanelli
Michele Ottomanelli
MDMauro Dell'ORco
Mauro Dell'ORco
Recently, several prominent logistic companies in Europe and the USA are seriously considering the idea of using drones launched from trucks and working in parallel to deliver packages. In the relevant literature, a novel problem formulation called travelling salesman problem with drone has been introduced, and some modelling and solution approaches have been presented. Existing approaches are based on the main assumption that the truck can dispatch and pick up a drone only at a node, i.e. the depot or a customer location. Here, the authors present a novel approach aimed to maximise the drone usage in parcel delivering. The authors consider that a truck can deliver and pick a drone up not only at a node but also along a route arc ( en route ). In this way, the operations of a drone are not strictly related to the customers’ position, but it can serve a wider area along the route. The authors tested the proposed heuristic on benchmark instances and analysed the benefits introduced with the en route approach.

1 January 2014 in Transportation Research Procedia
Verified
Journal Article
Open access
VCVincenza Chiarazzo
Vincenza Chiarazzo
LCLeonardo Caggiani
Leonardo Caggiani
Mario MarinelliMario Marinelli
Mario Marinelli
Michele OttomanelliMichele Ottomanelli
Michele Ottomanelli
In this paper, a model based on Artificial Neural Network (ANN) has been applied to real estate appraisal. Moreover, an evaluation of ANN performances in estimating the sale price of residential properties has been carried out. Artificial Neural Networks (ANNs) are useful in modelling input-output relationships learning directly from observed data. This capability can be very useful in complex systems like the real estate ones where motivations, tastes and budget availability often do not follow rational behaviours. This study also analyses the impact of such key environmental conditions that represent a problem related to many industrial cities where pollution and landscaping consequences affect the real estate market and residential location choices. We have considered a set of asking price's houses collected in the urban area of Taranto (Italy) where the biggest European steel factory and the 2nd industrial harbour are located

1 July 2017 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
MDMauro Dell'Orco
Mauro Dell'Orco
Mario MarinelliMario Marinelli
Mario Marinelli
MAMaria Giovanna Altieri
Maria Giovanna Altieri

1 August 2019 in Transport Policy
Verified
Journal Article
Closed access
LCLeonardo Caggiani
Leonardo Caggiani
RCRosalia Camporeale
Rosalia Camporeale
Mario MarinelliMario Marinelli
Mario Marinelli
Michele OttomanelliMichele Ottomanelli
Michele Ottomanelli

1 December 2020 in Applied Intelligence
Verified
Journal Article
Open access
PDF file
Luigi Pio PrencipeLuigi Pio Prencipe
Luigi Pio Prencipe
Mario MarinelliMario Marinelli
Mario Marinelli
Berth allocation is one of the crucial points for efficient management of ports. This problem is complex due to all possible combinations for assigning ships to available compatible berths. This paper focuses on solving the Berth Allocation Problem (BAP) by optimising port operations using an innovative model. The problem analysed in this work deals with the Discrete and Dynamic Berth Allocation Problem (DDBAP). We propose a novel mathematical formulation expressed as a Mixed Integer Linear Programming (MILP) for solving the DDBAP. Furthermore, we adapted a metaheuristic solution approach based on the Bee Colony Optimisation (BCO) for solving large-sized combinatorial BAPs. In order to assess the solution performance and efficiency of the proposed model, we introduce a new set of instances based on real data of the Livorno port (Italy), and a comparison between the BCO algorithm and CPLEX in solving the DDBAP is performed. Additionally, the application of the proposed model to a real berth scheduling (Livorno port data) and a comparison with the Ant Colony Optimisation (ACO) metaheuristic are carried out. Results highlight the feasibility of the proposed model and the effectiveness of BCO when compared to both CPLEX and ACO, achieving computation times that ensure a real-time application of the method.