Results 71 to 80 of about 36,372,437 (161)

Transport Logistics Optimization Model Of Passenger Car Based On Heuristic Algorithm

MATEC Web of Conferences, 2016
Passenger car logistics transportation problem is at the primary stage of development in China, great economic loss and waste of resources caused in the process of logistics transportation, because most of enterprises in China rely on artificial ...
Zhou Juan, Zhong Mao Sheng, Cheng Dao Lei, Xin Xie   +3 more
doaj   +1 more source

An Improved Shuffled Frog-Leaping Algorithm to Solving 0–1 Knapsack Problem

IEEE Access
To address the problems of slow convergence, low search accuracy, and easy fall into local optimum, and generating a large number of infeasible solutions when solving the 0–1 Knapsack Problem, which makes it difficult to obtain the optimal ...
Jianhao Zhang, Wei Jiang, Kang Zhao
doaj   +1 more source

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

IEEE Access, 2018
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
Shi-Hua Zhan, Ze-Jun Zhang, Li-Jin Wang, Yi-Wen Zhong   +3 more
doaj   +1 more source

Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem. [PDF]

Comput Intell Neurosci, 2022
Wang Z, Zhang H, Li Y.
europepmc   +1 more source

Two Knapsacks Are Better than One for Both Soft and Hard Conflict Constraints

Mathematics
For the classic 0–1 knapsack problem, there can be pairs of items that are in conflict. In other words, either at most one item can be inserted into the knapsack (hard conflict constraint) from the conflict pair or there may be a penalty (soft conflict ...
Peter Cadiz, Yun Lu, Myung Soon Song, Francis J. Vasko   +3 more
doaj   +1 more source

On solving the max-min 0-1 knapsack problem [PDF]

, 1997
The max-min 0-1 knapsack problem was recently introduced by Gang Yu in the journal of Operations Research. The problem is an extension of the classical 0-1 knapsack problem.
Iida, Hiroshi, 316
core   +1 more source

Complexity results and exact algorithms for robust knapsack problems. [PDF]

This paper studies the robust knapsack problem, for which solutions are, up to a certain point, immune to data uncertainty. We complement the works found in the literature where uncertainty affects only the profits or only the weights of the items by ...
Leus, Roel, Talla Nobibon, Fabrice
core  

The 0-1 Knapsack problem with a single continuous variable

, 1999
Constraints arising in practice often contain many 0-1 variables and one or a small number of continuous variables. Existing knapsack separation routines cannot be used on such constraints.
Marchand, H, Wolsey, Laurence
core   +1 more source

Binary Puma Optimizer: A Novel Approach for Solving 0-1 Knapsack Problems and the Uncapacitated Facility Location Problem

Applied Sciences
In this study, the Binary Puma Optimizer (BPO) is introduced as a novel binary metaheuristic. The BPO employs eight Transfer Functions (TFs), consisting of four S-shaped and four V-shaped mappings, to convert the continuous search space of the original ...
Aysegul Ihsan, Tahir Sag
doaj   +1 more source

An index for dynamic product promotion and the knapsack problem for perishable items [PDF]

This paper introduces the knapsack problem for perishable items (KPPI), which concerns the optimal dynamic allocation of a limited promotion space to a collection of perishable items. Such a problem is motivated by applications in a variety of industries,
Peter Jacko, Jose Nino-MOra
core