Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers

Tarhini, Abbas; Danach, Kassem; Harfouche, Antoine

doi:10.1007/s10479-020-03625-5

Cited by 31 publications

(12 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The blockchain has the characteristics of a large number of active users and a large number of transaction data packets, so it has the features of a natural carrier for building covert channels. The fusion of cryptography and information hiding technology provides a new idea [33][34][35]. The use of blockchain for information hiding and transmission has the following characteristics: covert channels are difficult to monitor and detect; it is challenging to extract hidden information from massive data transactions and protect confidential data transmission to the recipient.…”

Section: Information Concealed Transmission Methods Based On Bitcoin ...mentioning

confidence: 99%

Retracted: Blockchain‐based covert software information transmission for bitcoin

Reis¹,

Barbosa

Albuquerque

et al. 2023

IET Software

View full text Add to dashboard Cite

Blockchain-based data transmission will become a new development direction of data concealment transmission, which is of great significance for developing a secure transmission technology for special applications. To meet the needs of efficient, secure, concealed and stable transmission of confidential information, the transaction data structure of Bitcoin and the location and capacity of potential covert channels are analysed. The data transmission model for covert storage channels based on Bitcoin blockchain is also proposed. It cannot destroy the original transaction format, do not increase the particularity of the transaction content, overcome the defects of the concealed channel characteristics in the existing network environment, ensure that the data is not detected, and protect the sender and receiver of the hidden data transmission. | Information hidingInformation hiding methods can be divided into three categories according to the different information hiding carriers:This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

show abstract

Section: Information Concealed Transmission Methods Based On Bitcoin ...mentioning

confidence: 99%

Retracted: Blockchain‐based covert software information transmission for bitcoin

Reis¹,

Barbosa

Albuquerque

et al. 2023

IET Software

View full text Add to dashboard Cite

show abstract

“…Tarhini et al [68] modified a contemporary model of vehicle routing along with the application of the Cuckoo Search-based hyperheuristics. They attempted to distinguish a customer priority VRP model with the demands of every zone of a routing.…”

Section: Applications Of Cuckoo Search (Cs) In Comentioning

confidence: 99%

Nature-Inspired Metaheuristic Techniques for Combinatorial Optimization Problems: Overview and Recent Advances

et al. 2021

View full text Add to dashboard Cite

Combinatorial optimization problems are often considered NP-hard problems in the field of decision science and the industrial revolution. As a successful transformation to tackle complex dimensional problems, metaheuristic algorithms have been implemented in a wide area of combinatorial optimization problems. Metaheuristic algorithms have been evolved and modified with respect to the problem nature since it was recommended for the first time. As there is a growing interest in incorporating necessary methods to develop metaheuristics, there is a need to rediscover the recent advancement of metaheuristics in combinatorial optimization. From the authors’ point of view, there is still a lack of comprehensive surveys on current research directions. Therefore, a substantial part of this paper is devoted to analyzing and discussing the modern age metaheuristic algorithms that gained popular use in mostly cited combinatorial optimization problems such as vehicle routing problems, traveling salesman problems, and supply chain network design problems. A survey of seven different metaheuristic algorithms (which are proposed after 2000) for combinatorial optimization problems is carried out in this study, apart from conventional metaheuristics like simulated annealing, particle swarm optimization, and tabu search. These metaheuristics have been filtered through some key factors like easy parameter handling, the scope of hybridization as well as performance efficiency. In this study, a concise description of the framework of the selected algorithm is included. Finally, a technical analysis of the recent trends of implementation is discussed, along with the impacts of algorithm modification on performance, constraint handling strategy, the handling of multi-objective situations using hybridization, and future research opportunities.

show abstract

“…Metode metaheuristik memiliki pengembangan yaitu metode hyper-heuristik. Metode hyperheuristik memiliki perbedaan utama dengan metaheuristik yaitu, metode hyper-heuristik secara langsung mencari solusi pada space of heuristic daripada ke space of problem solutions [3]. Metode hyper-heuristik bertujuan untuk menemukan kombinasi yang tepat dari heuristik low-level yang mudah diterapkan dan menghasilkan solusi domain yang dapat diterima [4].…”

Section: Pendahuluanunclassified

Penyelesaian Urban Transit Routing Problem Menggunakan Algoritma Hyper-heuristics berbasis Modified Particle Swarm Optimization based on Gravitational field Interactions

Robbani¹

2021

JATISI

View full text Add to dashboard Cite

Kemacetan lalu lintas dapat diatasi dengan adanya public transport. Penerapan public transport yang optimal perlu dilakukan penentuan rute yang baik. Untuk mendapatkan rute public transport yang optimal, maka perlu dilakukan beberapa percobaan kombinasi antara jarak titik awal dan tujuan. Sehingga masalah dapat dikatakan sebagai masalah kombinatorik. VRP merupakan permasalahan kombinatorik. Oleh karena itu permasalahan dapat diselesaikan menggunakan metode metaheuristik. Penelitian ini akan menggunakan algoritma Modified Particle Swarm Optimization (MPSO-GI) dengan pendekatan Hyper-heuristics untuk menyelesaikan masalah penentuan rute public transport. Data yang digunakan merupakan dataset Mumford dan Mandl yang digunakan pada beberapa penelitian sebelumnya. Penelitian dilakukan dengan membandingkan hasil solusi yang dihasilkan oleh metode yang ditawarkan dengan hasil pada penelitian sebelumnya. Sehingga dapat diketahui kelebihan dan kekurangan dari metode yang ditawarkan. Berdasarkan hasil uji coba dapat ketahui bahwa algoritma MPSO-GI dengan pendekatan Hyper-Heuristics dapat diimpelmentasikan dan menyelesaikan masalah UTRP. MPSO-GI dengan pendekatan Hyper-Heuristics berhasil memperbaiki solusi hill-climbing di hamper semua dataset dengan nilai yang stabil. Hasil metode MPSO-GI dengan pendekatan Hyper-Heuristics unggul dalam menghasilkan solusi biaya penumpang pada dataset Mandl4, Mandl6, Mandl7, Mandl8 dan biaya operator pada dataset Mandl4 dan Mandl6 jika dibandingkan dengan metode pada penelitian sebelumnya.

show abstract

Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers

Cited by 31 publications

References 44 publications

Retracted: Blockchain‐based covert software information transmission for bitcoin

Retracted: Blockchain‐based covert software information transmission for bitcoin

Nature-Inspired Metaheuristic Techniques for Combinatorial Optimization Problems: Overview and Recent Advances

Penyelesaian Urban Transit Routing Problem Menggunakan Algoritma Hyper-heuristics berbasis Modified Particle Swarm Optimization based on Gravitational field Interactions

Contact Info

Product

Resources

About