After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger
(2004), knapsack problems became a classical and rich research area in combinatorial …

1 knapsack problem (KP01) is one of the classic variants of knapsack problems in which the
aim is to select the items with the total profit to be in the knapsack. In contrast, the constraint …

Optimization in dynamic environments is a hot research area that has attracted a notable
attention in the past decade. It is clear from the dynamic optimization literature that most of …

Optimization problems especially in a dynamic environment is a hot research area that has
attracted notable attention in the past decades. It is clear from the dynamic optimization …

To attain the goal of cost minimization, a vehicle routing model for cargo transport O2O
platforms were established in this study. In consideration of differences in vehicle origin in …

针对遗传算法求解旅行商问题(TsP) 时容易早熟, 收敛速度慢等问题, 提出一种基于探索—开发—
跳跃策略的单亲遗传算法(EDJs PGA). 该算法将基因移位, 倒序, 交换三种算子组合构成探索 …

The focus of this work is the accurate prediction of dynamic mechanical performances of a
multi-ribbed belt span. An overlay constitutive model, which consists of hyperelastic …

Knapsack problems are a highly active research area in combinatorial optimization.
Although, the knapsack problem has been known since over a century, see Mathews [368] …

Concentrating on the convergence analysis of Genetic Algorithm (GA), this study originally
distinguishes two types of advantage sources: value advantage and relationship advantage …

This Ph. D. thesis deals with two different classes of optimization problems: knapsack
problems and tool switching problems. Knapsack problems became a classical and rich …