Results 51 to 60 of about 36,372,437 (161)

Heuristic approaches for a new variant of the team orienteering problem

International Transactions in Operational Research, EarlyView.
Abstract In this paper, we tackle the team orienteering problem (TOP) with service times, mandatory nodes and incompatibilities arising from two real‐world healthcare applications. We propose two heuristic algorithms: a variable neighbourhood descent algorithm and a matheuristic based on a cut separation approach.
Alberto Guastalla, Roberto Aringhieri, Pierre Hosteins   +2 more
wiley   +1 more source

SOLVING MULTIPLE-CONTAINER PACKING PROBLEMS USING PSEUDO-MEIOSIS GENETIC ALGORITHM

Journal of Engineering, 2005
Knapsack problems are a class of common but difficult (NP-complete or NP -hard) problems. Since, it is believed that no knapsack problem algorithm can be constructed whose computation time optimality increases as any polynomial function of the problem ...
Bara'a Ali Attea, Deldar Ibrahem Abdo Al-Rahman   +1 more
doaj   +1 more source

Modeling Bloons Tower Defense as a temporal two‐dimensional knapsack problem with irregular shapes and side constraints: integer programming–based approaches

International Transactions in Operational Research, EarlyView.
Abstract In Tower Defense (TD) games, the objective is to defend a specific point on the game map from mobile units by constructing towers with offensive capabilities. In this work, we focus on Bloons Tower Defense (Bloons TD), one of the earliest and most prominent TD games.
Maxence Delorme, Jakub Malinowski
wiley   +1 more source

Topology Knapsack Problem for Geometry Optimization

IEEE Access
The knapsack problem is a classic NP-hard optimization challenge with wide-ranging applications in computer science, such as resource allocation. While several variants have been developed, including the 0/1, fractional, and multi-dimensional knapsack ...
Hsiao-Hui Li, Po-Chun Chang, Yuan-Hsun Liao   +2 more
doaj   +1 more source

Random‐key optimization for 2D irregular packing with reusable area evaluation

International Transactions in Operational Research, EarlyView.
Abstract The diverse constraints of industrial applications lead to variants of two‐dimensional (2D) irregular packing problems that require tailored solution methods. This paper addresses a real‐world industrial challenge by proposing a new problem definition, the maximum reusable contiguous area problem (MRCAP), and a novel metric, the maximum ...
Felipe S. C. Roberto, Victor U. Pugliese, Sanderson L. Gonzaga de Oliveira, Oseias Ferreira, Antonio A. Chaves, Fabio A. Faria   +5 more
wiley   +1 more source

The one‐dimensional cutting stock problem with sequence‐dependent setups

International Transactions in Operational Research, EarlyView.
Abstract The cutting stock problem (CSP) is a classic operations research problem with several applications in real‐world scenarios. It involves cutting large objects into smaller items to satisfy customer demands, minimizing the number of cut objects.
Eduardo M. Silva, Antônio A. Chaves, Mauricio G. C. Resende, Silvio A. de Araujo   +3 more
wiley   +1 more source

Two‐dimensional guillotine cutting problem for large objects with non‐rectangular shapes

International Transactions in Operational Research, EarlyView.
Abstract In this paper, we address the two‐dimensional single large object placement problem with guillotine cutting constraints, focusing on non‐rectangular shapes. We consider objects with circular or convex polygonal geometries and study a variant that includes defective regions from which no items can be extracted. Rectangular items are cut using a
Carise E. Schmidt, Arinei C. L. Silva, Leandro C. Coelho, Maryam Darvish   +3 more
wiley   +1 more source

Minimizing cutting costs in 1D rod cutting

International Transactions in Operational Research, EarlyView.
Abstract We study a one‐dimensional rod‐cutting problem arising from an industrial setting where cutting itself carries cost. Each order specifies a length interval, and the task is to assign orders to warehouse rods so that all orders are satisfied while the number of cuts is minimized.
Bowen Li, Attila Sali
wiley   +1 more source

Solving 0-1 Knapsack and Bin Packing Problem Using Logical Social Group Optimization

IEEE Access
The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in the real world such as in resource allocation, logistics ...
Rhiddhi Prasad Das, Junali Jasmine Jena, Suresh Chandra Satapathy, Naeem M. S. Hannoon   +3 more
doaj   +1 more source

Schedule Optimization in a Smart Microgrid Considering Demand Response Constraints

Energies, 2020
Smart microgrids (SMGs) may face energy rationing due to unavailability of energy resources. Demand response (DR) in SMGs is useful not only in emergencies, since load cuts might be planned with a reduction in consumption but also in normal operation ...
Julian Garcia-Guarin, David Alvarez, Arturo Bretas, Sergio Rivera   +3 more
doaj   +1 more source