Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Scheduling wagons to unload in bulk cargo ports with uncertain processing times
Publication

Scheduling wagons to unload in bulk cargo ports with uncertain processing times

Title
Scheduling wagons to unload in bulk cargo ports with uncertain processing times
Type
Article in International Scientific Journal
Year
2023
Authors
Ferreira, C
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Pedro Amorim
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Pigatti, A
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Journal
Vol. 160
ISSN: 0305-0548
Publisher: Elsevier
Indexing
Publicação em ISI Web of Knowledge ISI Web of Knowledge - 0 Citations
Publicação em Scopus Scopus - 0 Citations
Other information
Authenticus ID: P-00Y-XBE
Abstract (EN): Optimising operations in bulk cargo ports is of great relevance due to their major participation in international trade. In inbound operations, which are critical to meet due dates, the product typically arrives by train and must be transferred to the stockyard. This process requires several machines and is subject to frequent disruptions leading to uncertain processing times. This work focuses on the scheduling problem of unloading the wagons to the stockyard, approaching both the deterministic and the stochastic versions. For the deterministic problem, we compare three solution approaches: a Mixed Integer Programming model, a Constraint Programming model and a Greedy Randomised algorithm. The selection rule of the latter is evolved by Genetic Programming. The stochastic version is tackled by dispatching rules, also evolved via Genetic Programming. The proposed approaches are validated using real data from a leading company in the mining sector. Results show that the new heuristic presents similar results to the company's algorithm in a considerably shorter computational time. Moreover, we perform extensive computational experiments to validate the methods on a wide spectrum of randomly generated instances. Finally, as managing uncertainty is fundamental for the effectiveness of these operations, distinct strategies are compared, ranging from purely predictive to completely reactive scheduling. We conclude that re-scheduling with high frequency is the best approach to avoid performance deterioration under schedule disruptions, and using the evolved dispatching rules incur fewer deviations from the original schedule.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 16
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines (2015)
Article in International Scientific Journal
Marcos Furlan; Bernardo Almada Lobo; Maristela Santos; Reinaldo Morabito
The use of frontier techniques to identify efficient solutions for the Berth Allocation Problem solved with a hybrid evolutionary algorithm (2019)
Article in International Scientific Journal
Flávia Barbosa; Priscila C. Berbert Rampazzo; Akebo Yamakami; Ana S. Camanho
The Probabilistic Travelling Salesman Problem with Crowdsourcing (2022)
Article in International Scientific Journal
Santini, A; Viana, A; Klimentova, X; Joao Pedro Pedroso
The challenges of estimating the impact of distributed energy resources flexibility on the TSO/DSO boundary node operating points (2018)
Article in International Scientific Journal
João Silva; Jean Sumaili ; Ricardo J. Bessa; Luís Seca ; Manuel Matos; Vladimiro Miranda
Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics (2011)
Article in International Scientific Journal
Ross J. W. James; Bernardo Almada-Lobo

See all (40)

Recommend this page Top
Copyright 1996-2024 © Faculdade de Economia da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z  I Guest Book
Page created on: 2024-10-01 at 01:12:04 | Acceptable Use Policy | Data Protection Policy | Complaint Portal
SAMA2