Results 61 to 70 of about 24,926 (205)
IEEE Access, 2019 In this paper, we present some initial results of several meta-heuristic optimization algorithms, namely, genetic algorithms, simulated annealing, branch and bound, dynamic programming, greedy search algorithm, and a hybrid genetic algorithm-simulated ...
Absalom E. Ezugwu +4 more
doaj +1 more source
Exploring drivers and costs of partial trans‐Saharan migration in juvenile vultures
Ibis, EarlyView.Partial migration occurs when only a subset of individuals within a population undertakes a migratory journey. The decision to migrate can be influenced by intrinsic traits (e.g. sex or physical condition) as well as by extrinsic factors (e.g. social environment or resource availability).
Eneko Arrondo +18 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 +1 more
doaj +1 more source
International Transactions in Operational Research, EarlyView.Abstract The application of automated ground vehicles (AGVs) is well‐established in closed environments such as port terminals, while their operation in open areas remains challenging. In this work, we set out to overcome this limitation by introducing platooning as a transfer mode in heterogeneous vehicle networks.
Nadia Pourmohammad‐Zia +2 more
wiley +1 more source
Sedimentology, EarlyView.ABSTRACT Tsunami deposits serve as geological records of past events and are essential for understanding the occurrence and dynamics of tsunamis. However, conventional research has largely focused on sandy and boulder deposits, leaving gravel‐dominated tsunami deposits comparatively underexplored; furthermore, their characteristics and formation ...
Hidetoshi Masuda +5 more
wiley +1 more source
Topology Knapsack Problem for Geometry Optimization
IEEE AccessThe 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 +2 more
doaj +1 more source
Solving Multidimensional 0-1 Knapsack Problem by P Systems with Input and Active Membranes [PDF]
, 2004 P systems are parallel molecular computing models based on pro- cessing multisets of objects in cell-like membrane structures. In this paper we give a membrane algorithm to multidimensional 0-1 knapsack problem in lin- ear time by recognizer P systems
Martín Vide, Carlos, Pan, Linqiang
core
Experimental Physiology, EarlyView.Abstract Prolonged exposure to weightlessness leads to loss of muscle and bone mass. Therefore, astronauts on board the International Space Station (ISS) currently perform mandatory daily exercises. ISS missions usually last 6 months, and future missions will become significantly longer when going, for example, to Mars.
Jonas Böcker +6 more
wiley +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 +3 more
doaj +1 more source
Graph Theory Approach to Transportation Systems Design and Optimization [PDF]
TransNav, 2014 The main aim of the paper is to present graph theory parameters and algorithms as tool to analyze and to optimise transportation systems. To realize these goals the 0-1 knapsack problem solution by SPEA algorithm, methods and procedures for finding the ...
Sambor Guze
doaj +1 more source