Hybrid Multi-Objective Combinatorial Optimization Technique with Improved Compatibility between GA and Gradient-Based Local Search

The paper presents use case simulations of fleets of electric buses in two cities in Europe, one with a warm Mediterranean climate and the other with a Northern European (cool temperate) climate, to compare the different climatic effects of the thermal management strategy and charging management strategy. Two bus routes are selected in each city, and the effects of their speed, elevation, and passenger profiles on the energy and thermal management strategy of vehicles are evaluated. A multi-objective optimization technique, the improved Simple Optimization technique, and a “brute-force” Monte Carlo technique were employed to determine the optimal number of chargers and charging power to minimize the total cost of operation of the fleet and the impact on the grid, while ensuring that all the buses in the fleet are able to realize their trips throughout the day and keeping the battery SoC within the constraints designated by the manufacturer. A mix of four different types of buses with different battery capacities and electric motor specifications constitute the bus fleet, and the effects that they have on charging priority are evaluated. Finally, different energy management strategies, including economy (ECO) features, such as ECO-comfort, ECO-driving, and ECO-charging, and their effects on the overall optimization are investigated. The single bus results indicate that 12 m buses have a significant battery capacity, allowing for multiple trips within their designated routes, while 18 m buses only have the battery capacity to allow for one or two trips. The fleet results for Barcelona city indicate an energy requirement of 4.42 GWh per year for a fleet of 36 buses, while for Gothenburg, the energy requirement is 5 GWh per year for a fleet of 20 buses. The higher energy requirement in Gothenburg can be attributed to the higher average velocities of the bus routes in Gothenburg, compared to those of the bus routes in Barcelona city. However, applying ECO-features can reduce the energy consumption by 15% in Barcelona city and by 40% in Gothenburg. The significant reduction in Gothenburg is due to the more effective application of the ECO-driving and ECO-charging strategies. The application of ECO-charging also reduces the average grid load by more than 10%, while shifting the charging towards non-peak hours. Finally, the optimization process results in a reduction of the total fleet energy consumption of up to 30% in Barcelona city, while in Gothenburg, the total cost of ownership of the fleet is reduced by 9%.

Download Full-text

An Enhanced Multi-Objective Particle Swarm Optimization in Water Distribution Systems Design

Water ◽

10.3390/w13101334 ◽

2021 ◽

Vol 13 (10) ◽

pp. 1334

Author(s):

Mohamed R. Torkomany ◽

Hassan Shokry Hassan ◽

Amin Shoukry ◽

Ahmed M. Abdelrazek ◽

Mohamed Elkholy

Keyword(s):

Particle Swarm Optimization ◽

Local Search ◽

Distribution Systems ◽

Water Distribution ◽

Water Distribution Systems ◽

Particle Swarm ◽

Large Network ◽

Swarm Optimization ◽

Original Algorithm ◽

Multi Objective

The scarcity of water resources nowadays lays stress on researchers to develop strategies aiming at making the best benefit of the currently available resources. One of these strategies is ensuring that reliable and near-optimum designs of water distribution systems (WDSs) are achieved. Designing WDSs is a discrete combinatorial NP-hard optimization problem, and its complexity increases when more objectives are added. Among the many existing evolutionary algorithms, a new hybrid fast-convergent multi-objective particle swarm optimization (MOPSO) algorithm is developed to increase the convergence and diversity rates of the resulted non-dominated solutions in terms of network capital cost and reliability using a minimized computational budget. Several strategies are introduced to the developed algorithm, which are self-adaptive PSO parameters, regeneration-on-collision, adaptive population size, and using hypervolume quality for selecting repository members. A local search method is also coupled to both the original MOPSO algorithm and the newly developed one. Both algorithms are applied to medium and large benchmark problems. The results of the new algorithm coupled with the local search are superior to that of the original algorithm in terms of different performance metrics in the medium-sized network. In contrast, the new algorithm without the local search performed better in the large network.

Download Full-text

A modified simplex based direct search optimization algorithm for adaptive transversal FIR filters

Science Progress ◽

10.1177/00368504211025409 ◽

2021 ◽

Vol 104 (2) ◽

pp. 003685042110254

Author(s):

Armaghan Mohsin ◽

Yazan Alsmadi ◽

Ali Arshad Uppal ◽

Sardar Muhammad Gulfam

Keyword(s):

Optimization Algorithm ◽

Optimization Technique ◽

Fast Convergence ◽

Good Convergence ◽

Optimum Point ◽

Search Optimization ◽

Higher Dimensional ◽

Gradient Based ◽

Improved Accuracy ◽

Quadratic Cost Function

In this paper, a novel modified optimization algorithm is presented, which combines Nelder-Mead (NM) method with a gradient-based approach. The well-known Nelder Mead optimization technique is widely used but it suffers from convergence issues in higher dimensional complex problems. Unlike the NM, in this proposed technique we have focused on two issues of the NM approach, one is shape of the simplex which is reshaped at each iteration according to the objective function, so we used a fixed shape of the simplex and we regenerate the simplex at each iteration and the second issue is related to reflection and expansion steps of the NM technique in each iteration, NM used fixed value of [Formula: see text], that is, [Formula: see text] = 1 for reflection and [Formula: see text] = 2 for expansion and replace the worst point of the simplex with that new point in each iteration. In this way NM search the optimum point. In proposed algorithm the optimum value of the parameter [Formula: see text] is computed and then centroid of new simplex is originated at this optimum point and regenerate the simplex with this centroid in each iteration that optimum value of [Formula: see text] will ensure the fast convergence of the proposed technique. The proposed algorithm has been applied to the real time implementation of the transversal adaptive filter. The application used to demonstrate the performance of the proposed technique is a well-known convex optimization problem having quadratic cost function, and results show that the proposed technique shows fast convergence than the Nelder-Mead method for lower dimension problems and the proposed technique has also good convergence for higher dimensions, that is, for higher filter taps problem. The proposed technique has also been compared with stochastic techniques like LMS and NLMS (benchmark) techniques. The proposed technique shows good results against LMS. The comparison shows that the modified algorithm guarantees quite acceptable convergence with improved accuracy for higher dimensional identification problems.

Download Full-text