SCIOMACHEN , Anna Franca

In this paper we deal with shortest paths in the context of urban passenger mobility. In particular, we present a novel shortest path algorithm on multimodal networks, where the objective function may consist of different components, such as monetary cost, time and discomfort paid by users when changing modality. The key feature of the proposed...

In the recent literature a lot of attention has been given to intermodal transportation networks, mainly related to inland freight mobility. In particular, the landside distribution of maritime containers from/to seaports has been the focus of many research works. In fact, seaports are now suffering the lack of space at maritime terminals and...

No description

No description

No description

No description

No description

No description

No description

No description

No description

In this paper we deal with the problem of finding optimal routes in multimodal networks. Since modal change nodes play a relevant role in the choice of origin – destination paths, and consequently in the computation of multimodal shortest paths, we evaluate the performance of such nodes with the aim of increasing their attractivity. We propose...

No description

In this work, we deal with a food distribution problem that can be considered as a generalization of the asymmetric capacitated vehicle routing problem with split delivery. In particular, we are involved with a real application related to an Italian company that holds food markets along the national highway network and has to determine the...

In this paper we deal with a capacitated hub location problem arising in a freight logistics context; in particular, we have the need of locating logistics platforms for containers travelling via road and rail. The problem is modelled on a weighed multimodal network. We give a mixed integer linear programming model for the problem, having the...

No description

The present paper deals with the problem of locating hubs for freight mobility in urban and suburban areas. In particular, we present a heuristic method that combines aspects coming from both classical simple plant location problems and shortest path ones on multimodal graphs. In the first phase of the proposed heuristics, we identify those...

No description

This paper addresses the problem of determining stowage plans for containers in a ship, that is the so-called master bay plan problem (MBPP). MBPP is NP-complete [Botter, R.C., Brinati, M.A., 1992. Stowage container planning: A model for getting an optimal solution. IFIP Transactions B (Applications in Technology) B-5, 217–229; Avriel, M.,...

No description