Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Anna Sciomachen is active.

Publication


Featured researches published by Anna Sciomachen.


Journal of Heuristics | 2006

A decomposition heuristics for the container ship stowage problem

Daniela Ambrosino; Anna Sciomachen; Elena Tànfani

In this paper we face the problem of stowing a containership, referred to as the Master Bay Plan Problem (MBPP); this problem is difficult to solve due to its combinatorial nature and the constraints related to both the ship and the containers. We present a decomposition approach that allows us to assign a priori the bays of a containership to the set of containers to be loaded according to their final destination, such that different portions of the ship are independently considered for the stowage. Then, we find the optimal solution of each subset of bays by using a 0/1 Linear Programming model. Finally, we check the global ship stability of the overall stowage plan and look for its feasibility by using an exchange algorithm which is based on local search techniques. The validation of the proposed approach is performed with some real life test cases.


European Journal of Operational Research | 2007

A 3D-BPP approach for optimising stowage plans and terminal productivity

Anna Sciomachen; Elena Tànfani

Abstract 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., Penn, M., Shpirer, N., 2000. Container ship stowage problem: Complexity and connection to the colouring of circle graphs. Discrete Applied Mathematics 103, 271–279]. We present a heuristic method for solving MBPP based on its relation with the three-dimensional bin packing problem (3D-BPP), where items are containers and the only bin is the ship . We look for stowage plans that take into a proper account structural and operational constraints, related to both the containers and the ship, and maximise some important terminal performance indexes, such as the effective and mean net crane productivity. Our aim is to evaluate how stowage plans can influence the performance of the quay. A validation of the proposed approach with some test cases related to containership docks at the port of Genoa (Italy) is given. The results of real instances of the problem and the comparison with a validated heuristic for MBPP, show the effectiveness of the proposed approach in producing stowage plans that minimise the total loading time and allow an efficient use of the quay equipment.


symposium on experimental and efficient algorithms | 2010

An experimental comparison of different heuristics for the master bay plan problem

Daniela Ambrosino; Davide Anghinolfi; Massimo Paolucci; Anna Sciomachen

Different heuristics for the problem of determining stowage plans for containerships, that is the so called Master Bay Plan Problem (MBPP), are compared. The first approach is a tabu search (TS) heuristic and it has been recently presented in literature. Two new solution procedures are proposed in this paper: a fast simple constructive loading heuristic (LH) and an ant colony optimization (ACO) algorithm. An extensive computational experimentation performed on both random and real size instances is reported and conclusions on the appropriateness of the tested approaches for the MBPP are drawn.


Optimization Letters | 2016

A capacitated hub location problem in freight logistics multimodal networks

Daniela Ambrosino; Anna Sciomachen

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 goal of minimizing the location and shipping costs. The proposed formulation presents some novel features for modelling capacity bounds that are given both for the candidate hub nodes and the arcs incident to them; further, the containerised origin-destination (


Archive | 2015

Using a Bin Packing Approach for Stowing Hazardous Containers into Containerships

Daniela Ambrosino; Anna Sciomachen


soft computing | 2017

An exact approach for the grocery delivery problem in urban areas

Francesco Carrabs; Raffaele Cerulli; Anna Sciomachen

o-d)


Acta Paediatrica | 2018

Evaluation of neonatal transport in a European country shows that regional provision is not cost-effective or sustainable and needs to be re-organised

Carlo Bellini; Michela Pasquarella; Luca A. Ramenghi; Daniela Ambrosino; Anna Sciomachen


Archive | 2014

Environmental Sustainable Fleet Planning in B2C e-Commerce Urban Distribution Networks

Francesco Carrabs; Raffaele Cerulli; Anna Sciomachen

o-d) demand can be split among several platforms and different travelling modes. Note that here the network is not fully connected and only one hub for each


Maritime Policy & Management | 2018

Ports, external costs and Northern Italian transport network design: effects for the planned transformation

Daniela Ambrosino; Claudio Ferrari; Anna Sciomachen; Alessio Tei


Archive | 2016

Shipping Liner Company Stowage Plans: An Optimization Approach

Daniela Ambrosino; Massimo Paolucci; Anna Sciomachen

o-d

Collaboration


Dive into the Anna Sciomachen's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Carlo Bellini

Istituto Giannina Gaslini

View shared research outputs
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge