Deep learning-based genetic algorithm for the robust hub allocation problem with discrete scenarios

Achraf Berrajaa

International Journal of Logistics Systems and Management, 2024, vol. 48, issue 4, 489-507

Abstract: Over the last decade, big data have changed the work and research strategies of several areas, in particular the hub location problems (HLP). The HLP have been extended to handle uncertain data, giving rise to robust HLPs. In a RHLP with discrete scenarios, the unique set of requests is replaced by a set of discrete scenarios. In a robust optimisation approach, making appropriate decisions for all scenarios must be intelligent and optimal. The purpose of this study is to show that such problems can be solved in a reasonable computing time and with an intelligent solution, using a RNN based on GA to approximately solve the problem. The proposed RNN has been trained on a big dataset of 20,000 instances. The performances of the proposed RNN are very interesting such that the success rate is 91% and able to resolve large instances while the traditional approaches are fail to resolve them.

Keywords: robust HLP; discrete scenarios; deep learning; recurrent neural network; RNN; genetic algorithm. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=140398 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijlsma:v:48:y:2024:i:4:p:489-507

Access Statistics for this article

More articles in International Journal of Logistics Systems and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().