Results 11 to 20 of about 8,257 (239)
Scheduling in Container Terminals using Network Simplex Algorithm [PDF]
Journal of Optimization in Industrial Engineering, 2010 In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the ...
Hassan Rashidi
doaj +1 more source
A Hybrid Algorithm of GA + Simplex Method in the WSN Localization
International Journal of Distributed Sensor Networks, 2015 Localization provides the key support for wireless sensor networks (WSNs). In order to solve the large-error problem in the third phase and the poor position accuracy of the least square method in the weighted DV-Hop algorithm, a hybrid algorithm of GA +
Feng Wang +3 more
doaj +2 more sources
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm [PDF]
Journal of Graph Algorithms and Applications, 2015 The minimum-cost flow (MCF) problem is a fundamental optimization problem with many applications and seems to be well understood. Over the last half century many algorithms have been developed to solve the MCF problem, and these algorithms have varying worst-case bounds on their running time.
Cornelissen, Kamiel, Manthey, Bodo
core +8 more sources
Polynomial dual network simplex algorithms [PDF]
Mathematical Programming, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James B. Orlin +2 more
openaire +2 more sources
Advances in Multimedia, 2022 In order to improve the cooperative operation scheduling effect of agricultural machinery, this article uses particle swarm neural network to study the cooperative operation scheduling algorithm of agricultural machinery and improves the cooperative ...
Wei Li
doaj +1 more source
Solving biobjective network flow problem associated with minimum cost-time loading [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2020 We apply a primal-dual simplex algorithm for solving the biobjective min imum cost-time network flow problem such that the total shipping cost and the total shipping fixed time are considered as the first and second objective functions, respectively.
O. Baghani, S. Ghafoori
doaj +1 more source
An Algorithm for Choosing, Ordering a New Criteria of a Bi-Objective Flow Problem
Foundations of Computing and Decision Sciences, 2021 In this paper, we propose an algorithm which is based on many things: the notions well-known of the simplex network method, Ford Fulkerson’s algorithm and our new idea, which is >, applied on a bi-objective minimum cost flow problem.
Belkacem Salima Nait
doaj +1 more source
Online Identification of VLRA Battery Model Parameters Using Electrochemical Impedance Spectroscopy
Batteries, 2022 This paper introduces the use of a new low-computation cost algorithm combining neural networks with the Nelder–Mead simplex method to monitor the variations of the parameters of a previously selected equivalent circuit calculated from Electrochemical ...
Javier Olarte +5 more
doaj +1 more source
NETWORK SIMPLEX ALGORITHM ASSOCIATED WITH THE MAXIMUM FLOW PROBLEM [PDF]
Far East Journal of Mathematical Sciences (FJMS), 2018 13pages
Sennosuke Watanabe +2 more
openaire +2 more sources
Micromachines, 2022 A multi-channel pressure scanner is an essential tool for measuring and acquiring various pressure parameters in aerospace applications. It is important to note, however, that the pressure sensor of each of these channels will drift significantly with ...
Huan Wang +3 more
doaj +1 more source