Anolan Yamile Milanes Barrientos

• Milanés, Anolan Yamilé & Jæger, Bjørn (2023). Teaching Programming Blockchain Applications to undergraduate students . NIKT: Norsk IKT-konferanse for forskning og utdanning. ISSN 1892-0713. p. 1–14. Show summary

  Blockchain is an technology with potential for supporting industrial applications with traceability and transparency. Unfortunately, the understanding necessary to make decisions regarding the adoption of the technology and to implement blockchain-based applications is still in short supply. We have designed and thought for two years an undergraduate course to help filling the talent gap that is undermining Blockchain adoption. The course is thought as a hands-on course, where students gain initial skills in developing supply management applications for the BSV blockchain. This paper describes the motivations and challenges of this course, discusses its main achievements and issues, and suggests guidelines to follow based on our observations and the student feedback.

• Tomacheski, Clynton; Milanés, Anolan Yamilé & Urrutia, Sebastián (2023). The nilcatenation problem and its application for detecting money laundering activities in cryptocurrency networks. International Transactions in Operational Research. ISSN 0969-6016. doi: 10.1111/itor.13353. Show summary

  This work considers a combinatorial optimization problem in graphs, the nilcatenation problem, and investigates its potential application for detecting money laundering activities in cryptocurrency networks. The nilcatenation problem consists of finding a set of arcs that can be removed from an arc-weighted directed graph without changing the balance of any vertex. The balance of a vertex is defined as the difference between the sum of the weights of outgoing and incoming arcs. We propose a 0/1 integer linear programming formulation and a local branching algorithm. The approaches are computationally evaluated and compared using three sets of test instances, two of them generated from Bitcoin's testnet and mainnet networks. An experiment on the testnet showed that it is possible to retrieve a nilcatenation artificially introduced with fake bitcoin transactions. Experiments on the mainnet showed that it is possible to find large nilcatenations, possibly indicating money laundering activities.

• Urrutia, Sebastián; Milanés, Anolan Yamilé & Løkketangen, Arne (2015). A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks. International Transactions in Operational Research. ISSN 0969-6016. 22(1), p. 61–75. doi: 10.1111/itor.12053. Show summary

  The double traveling salesman problem with multiple stacks consists in determining a pair of routes (pickup and delivery) for a unique vehicle in two different and disjoint networks. It models a realistic transportation problem with loading/unloading constraints imposed by having a set of last-in-first-out (LIFO) stacks used for storing the goods being transported. The arrangement of the items in the container determines the loading plan that in terms constrains both routes. In this paper, we propose a novel local search approach. The local search heuristic is applied to the loading plan instead of working directly on the routes. A dynamic programming algorithm is used to map the loading plan solution into corresponding optimal routes. Computational results show that the proposed approach is competitive with state-of-the-art heuristics for the problem.

View all works in Cristin

• Milanés, Anolan Yamilé & Jæger, Bjørn (2023). Teaching Programming Blockchain Applications to undergraduate students . Show summary

  Blockchain is an technology with potential for supporting industrial applications with traceability and transparency. Unfortunately, the understanding necessary to make decisions regarding the adoption of the technology and to implement blockchain-based applications is still in short supply. We have designed and thought for two years an undergraduate course to help filling the talent gap that is undermining Blockchain adoption. The course is thought as a hands-on course, where students gain initial skills in developing supply management applications for the BSV blockchain. This paper describes the motivations and challenges of this course, discusses its main achievements and issues, and suggests guidelines to follow based on our observations and the student feedback.

• Urrutia, Sebastián; Milanés, Anolan Yamilé & Løkketangen, Arne (2013). A GPU algorithm for the DTSPMS.
• Milanés, Anolan Yamilé; Urrutia, Sebastián & Løkketangen, Arne (2013). Uma heurística paralela na GPU para o problema do Caixeiro Viajante Duplo com Múltiplas Pilhas.
• Urrutia, Sebastián; Milanés, Anolan Yamilé & Løkketangen, Arne (2012). A strategic oscillation heuristic for the double Traveling Salesman Problem with multiple stacks. Show summary

  The extended abstract describes a new heuristic for the Double Traveling Salesman Problem with Multiple Stacks. Preliminary computational results indicate that the heuristics performance is very similar to that of state of the art algorithms.

• Løkketangen, Arne; Milanés, Anolan Yamilé & Urrutia, Sebastián (2012). Double TSP with multiple stacks - strategic oscilliation and heuristic search.

View all works in Cristin