no code implementations • 11 Oct 2023 • Majid Namazi, M. A. Hakim Newton, Conrad Sanderson, Abdul Sattar
In TTP, city selection and item selection decisions need close coordination since the thief's travelling speed depends on the knapsack's weight and the order of visiting cities affects the order of item collection.
no code implementations • 14 May 2020 • Majid Namazi, Conrad Sanderson, M. A. Hakim Newton, Abdul Sattar
The TSP solution (cyclic tour) is typically changed in a deterministic way, while changes to the KP solution typically involve a random search, effectively resulting in a quasi-meandering exploration of the TTP solution space.
no code implementations • 8 Nov 2019 • Majid Namazi, Conrad Sanderson, M. A. Hakim Newton, Abdul Sattar
A thief performs a cyclic tour through a set of cities, and pursuant to a collection plan, collects a subset of items into a rented knapsack with finite capacity.
no code implementations • 25 Jun 2018 • Majid Namazi, Conrad Sanderson, M. A. Hakim Newton, M. M. A. Polash, Abdul Sattar
The well-known Late Acceptance Hill Climbing (LAHC) search aims to overcome the main downside of traditional Hill Climbing (HC) search, which is often quickly trapped in a local optimum due to strictly accepting only non-worsening moves within each iteration.
