The battery of electric vehicles (EV) can be charged from the power grid or discharged back to it. Parking lots can aggregate hundreds of EVs which makes them a significant and flexible load/generation component in the grid. In a smart grid environment, the smart parking lot (SPL) can benefit from the situation of the simultaneous connection to the EVs and power grid. This paper proposes a new ...

In this paper, multi-objective uniform-diversity genetic algorithm (MUGA) with a diversity preserving mechanism called the ε-elimination algorithm is used for Pareto optimization of 5-degree of freedom vehicle vibration model considering the five conflicting functions simultaneously. The important conflicting objective functions that have been considered in this work are, namely, vertical accel...

In this article, we provide a splitting method for solving monotone inclusions in real Hilbert space involving four operators: maximally monotone, monotone-Lipschitzian, cocoercive, and monotone-continuous operator. The proposed takes advantage of the intrinsic properties each operator, generalizing forward–backward–half-forward Tseng’s algorithm with line search. At iteration, our defines step...

The forward checking algorithm for solving constraint satisfaction problems is a popular and successful alternative to backtracking. However, its success has largely been determined empirically, and there has been limited work towards a real understanding of why and when forward checking is the superior approach. This paper advances our understanding by showing that forward checking is closely ...

In this paper, we propose a stochastic forward–backward–forward splitting algorithm and prove its almost sure weak convergence in real separable Hilbert spaces. Applications to composite monotone inclusion andminimization problems are demonstrated.

University timetabling is an issue that has received more attention in the field of operations research. Course scheduling process arranging time slots and room for a class by paying to existing limitations. This problem NP-Hard problem, which means computation find solution increases exponentially with size problem. Solutions problems this kind generally use heuristic approach, tries sufficien...

Datalog-based systems often materialise all consequences of a datalog program and the data, allowing users’ queries to be evaluated directly in the materialisation. This process, however, can be computationally intensive, so most systems update the materialisation incrementally when input data changes. We argue that existing solutions, such as the wellknown Delete/Rederive (DRed) algorithm, can...