English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

List-based simulated annealing (LBSA) algorithm, which uses list-based cooling scheme to control the change of parameter temperature, was first proposed for traveling salesman problem. This paper extends the application of LBSA algorithm for 0-1 knapsack problem (0-1 KP). A hybrid greedy repair and optimization operator, which combines density-based and value-based greedy repair and optimization operators, is designed to get better balance between intensification and diversification. Extensive experiments were performed to show the effectiveness and parameter robustness of a list-based cooling scheme and to verify the advantage of using hybrid greedy repair and optimization operator. Comparing experiments, which were conducted on small-scale, medium-scale, and large-scale 0-1 KP instances, have shown that LBSA algorithm is better than or competitive with other state-of-the-art metaheuristics.

List-Based Simulated Annealing Algorithm With Hybrid Greedy Repair and Optimization Operator for 0–1 Knapsack Problem