Zobrazeno 1 - 10
of 273
pro vyhledávání: '"sweep algorithm"'
Autor:
S.E. Monabbati
Publikováno v:
Iranian Journal of Numerical Analysis and Optimization, Vol 12, Iss Issue 3 (Special Issue), Pp 567-584 (2022)
We propose a two-phase algorithm for solving continuous rank-one quadratic knapsack problems (R1QKPs). In particular, we study the solution structure of the problem without the knapsack constraint. In fact, an $O(n\log n)$ algorithm is suggested in t
Externí odkaz:
https://doaj.org/article/8945a96aa6244f5fbc2c549ccff49482
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Fikret A. Aliev, Mutallim M. Mutallimov, Ilkin A. Maharramov, Nargiz Sh. Huseynova, Leyla I. Amirova
Publikováno v:
Sahand Communications in Mathematical Analysis, Vol 17, Iss 1, Pp 99-107 (2020)
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contra
Externí odkaz:
https://doaj.org/article/1f3a3cb39682435ea1deec94be9239eb
Publikováno v:
Energies, Vol 15, Iss 24, p 9348 (2022)
This paper presents an algorithm for solving the power flow (PF) problem of droop-regulated AC microgrids (DRACMs) operating in isolated mode. These systems are based on radial distribution networks without having a slack bus to facilitate convention
Externí odkaz:
https://doaj.org/article/a49da0b7b3fd49f5bd3d71ee1a1a2060
Autor:
Arit Thammano, Petcharat Rungwachira
Publikováno v:
Heliyon, Vol 7, Iss 9, Pp e08029- (2021)
Vehicle routing problem is a widely researched combinatorial optimization problem. We developed a hybrid of three strategies—a modified ant system, a sweep algorithm, and a path relinking—for solving a capacitated vehicle routing optimization pro
Externí odkaz:
https://doaj.org/article/acb339acecaf4b8a98ca649a552113be
Publikováno v:
IEEE Access, Vol 7, Pp 86102-86114 (2019)
The Internet of Things integrates lots of capacitated vehicles in smart logistics. The routing for capacitated vehicles is a combinatorial optimization problem which has been widely studied in recent years. This paper proposes an effective order-awar
Externí odkaz:
https://doaj.org/article/5104682129504281872be4b35b066211
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Gazi Üniversitesi Fen Bilimleri Dergisi, Vol 6, Iss 4, Pp 774-786 (2018)
In this study, Vehicle Routing Problem with Time Windows (VRPTW) which is a type of classical Vehicle Routing Problem (VRP) includes customers with known demands, a single depot with known location and a certain number of identical vehicles with iden
Externí odkaz:
https://doaj.org/article/682484b50a2b4210973d6ad111754f1e
Publikováno v:
Journal of Intelligent Systems, Vol 27, Iss 3, Pp 377-391 (2018)
This paper presents a fast and efficient method for load flow analysis of radial distribution networks. Here, an adaptive algorithm is proposed to analyze the load flow problem of distribution systems. An adaptive algorithm is the combination of back
Externí odkaz:
https://doaj.org/article/79116f96a18a4de894c970e1ee4fb658