scholarly journals A Near-Optimal Solution Method of Multi-Item Multi-Process Dynamic Lot Size Scheduling Problem.

2003 ◽  
Vol 46 (1) ◽  
pp. 46-53 ◽  
Author(s):  
Kenji MURAMATSU ◽  
Aditya WARMAN ◽  
Minoru KOBAYASHI
2021 ◽  
Vol 3 (7) ◽  
Author(s):  
Minoru Kobayashi

AbstractThis study treats a multi-item single-machine dynamic lot size scheduling problem with sequence-independent setup cost and setup time. This problem has various heterogeneous decision features, such as lot sizing and lot sequencing. Traditionally, the problem has been treated by putting artificial constraints on the other feature in order to determine one of them. The proposed model is a Lagrange decomposition and coordination method that aims at simultaneous optimization of these decision features; however, smooth convergence to a feasible near-optimal solution has been a problem. So, in this paper, we propose a model that improves the constraint equation of the existing model and showed that it satisfies the Karush–Kuhn–Tucker (KKT) condition when we obtained a feasible solution. In addition, by applying the surrogate gradient method, which has never been applied to this problem before, it was shown that smoother convergence than before can be achieved through actual example of printed circuit board.


2020 ◽  
Vol 39 (6) ◽  
pp. 8125-8137
Author(s):  
Jackson J Christy ◽  
D Rekha ◽  
V Vijayakumar ◽  
Glaucio H.S. Carvalho

Vehicular Adhoc Networks (VANET) are thought-about as a mainstay in Intelligent Transportation System (ITS). For an efficient vehicular Adhoc network, broadcasting i.e. sharing a safety related message across all vehicles and infrastructure throughout the network is pivotal. Hence an efficient TDMA based MAC protocol for VANETs would serve the purpose of broadcast scheduling. At the same time, high mobility, influential traffic density, and an altering network topology makes it strenuous to form an efficient broadcast schedule. In this paper an evolutionary approach has been chosen to solve the broadcast scheduling problem in VANETs. The paper focusses on identifying an optimal solution with minimal TDMA frames and increased transmissions. These two parameters are the converging factor for the evolutionary algorithms employed. The proposed approach uses an Adaptive Discrete Firefly Algorithm (ADFA) for solving the Broadcast Scheduling Problem (BSP). The results are compared with traditional evolutionary approaches such as Genetic Algorithm and Cuckoo search algorithm. A mathematical analysis to find the probability of achieving a time slot is done using Markov Chain analysis.


Energies ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 830
Author(s):  
Filipe F. C. Silva ◽  
Pedro M. S. Carvalho ◽  
Luís A. F. M. Ferreira

The dissemination of low-carbon technologies, such as urban photovoltaic distributed generation, imposes new challenges to the operation of distribution grids. Distributed generation may introduce significant net-load asymmetries between feeders in the course of the day, resulting in higher losses. The dynamic reconfiguration of the grid could mitigate daily losses and be used to minimize or defer the need for network reinforcement. Yet, dynamic reconfiguration has to be carried out in near real-time in order to make use of the most updated load and generation forecast, this way maximizing operational benefits. Given the need to quickly find and update reconfiguration decisions, the computational complexity of the underlying optimal scheduling problem is studied in this paper. The problem is formulated and the impact of sub-optimal solutions is illustrated using a real medium-voltage distribution grid operated under a heavy generation scenario. The complexity of the scheduling problem is discussed to conclude that its optimal solution is infeasible in practical terms if relying upon classical computing. Quantum computing is finally proposed as a way to handle this kind of problem in the future.


2020 ◽  
Vol 12 (13) ◽  
pp. 2123 ◽  
Author(s):  
Leran Han ◽  
Chunmei Wang ◽  
Tao Yu ◽  
Xingfa Gu ◽  
Qiyue Liu

This paper proposes a combined approach comprising a set of methods for the high-precision mapping of soil moisture in a study area located in Jiangsu Province of China, based on the Chinese C-band synthetic aperture radar data of GF-3 and high spatial-resolution optical data of GF-1, in situ experimental datasets and background knowledge. The study was conducted in three stages: First, in the process of eliminating the effect of vegetation canopy, an empirical vegetation water content model and a water cloud model with localized parameters were developed to obtain the bare soil backscattering coefficient. Second, four commonly used models (advanced integral equation model (AIEM), look-up table (LUT) method, Oh model, and the Dubois model) were coupled to acquire nine soil moisture retrieval maps and algorithms. Finally, a simple and effective optimal solution method was proposed to select and combine the nine algorithms based on classification strategies devised using three types of background knowledge. A comprehensive evaluation was carried out on each soil moisture map in terms of the root-mean-square-error (RMSE), Pearson correlation coefficient (PCC), mean absolute error (MAE), and mean bias (bias). The results show that for the nine individual algorithms, the estimated model constructed using the AIEM (mv1) was significantly more accurate than those constructed using the other models (RMSE = 0.0321 cm³/cm³, MAE = 0.0260 cm³/cm³, and PCC = 0.9115), followed by the Oh model (m_v5) and LUT inversion method under HH polarization (mv2). Compared with the independent algorithms, the optimal solution methods have significant advantages; the soil moisture map obtained using the classification strategy based on the percentage content of clay was the most satisfactory (RMSE = 0.0271 cm³/cm³, MAE = 0.0225 cm³/cm³, and PCC = 0.9364). This combined method could not only effectively integrate the optical and radar satellite data but also couple a variety of commonly used inversion models, and at the same time, background knowledge was introduced into the optimal solution method. Thus, we provide a new method for the high-precision mapping of soil moisture in areas with a complex underlying surface.


2009 ◽  
Vol 120 (2) ◽  
pp. 430-436 ◽  
Author(s):  
Milind Dawande ◽  
Srinagesh Gavirneni ◽  
Sanjeewa Naranpanawe ◽  
Suresh P. Sethi

1986 ◽  
Vol 33 (1) ◽  
pp. 111-122 ◽  
Author(s):  
Suresh Chand ◽  
Thomas E. Morton

Sign in / Sign up

Export Citation Format

Share Document