This paper focuses on solving the knapsack problem with forfeits (KPF). This variation of the knapsack problem includes soft conflicts or forfeits, where forfeit pairs consist of two items and an associated penalty. The proposed method combines the fixed set search (FSS) metaheuristic's learning...

The scope of this volume centers on advancements in the state of art and the state of the practice in computer-aided systems in public transport. Yet, this volume illustrates a greater breadth of subjects in this area. The common theme remains the use of computer-aided methods and operations...