Parameters Optimization Algorithm of a New Type of Diffraction Optics Elements

Author(s):  
I.V. Minin ◽  
O.V. Minin ◽  
E.G. Danilov ◽  
G.S. Lbov
2019 ◽  
Vol 8 (5) ◽  
pp. 239 ◽  
Author(s):  
Zhihui Gu ◽  
Yong Zhu ◽  
Yan Zhang ◽  
Wanyu Zhou ◽  
Yu Chen

Station-free bike sharing systems (BSSs) are a new type of public bike system that has been widely deployed in China since 2017. However, rapid growth has vastly outpaced the immediate demand and overwhelmed many cities around the world. This paper proposes a heuristic bike optimization algorithm (HBOA) to determine the optimal supply and distribution of bikes considering the effect of bicycle cycling. In this approach, the different bike trips with separate bikes can be connected in space and time and converted into a continuous trip chain for a single bike. To improve this cycling efficiency, it is important to properly design the bicycle distribution. Taking Shenzhen as an example, we implement the algorithm with OD matrix data from Mobike and Ofo, the two large bike sharing companies which account for 80% of the shared bike market in Shenzhen, over two days. The HBOA results are as follows. 1) Only one-fifth of the bike supply is needed to meet the current usage demand if the bikes are used efficiently, which means a large number of shared bikes in Shenzhen remain in an idle state for long periods. 2) Although the cycling demand is high in many areas, it does not mean that large numbers of bikes are needed because the continuous inflow caused by the cycling effect of bikes will meet most of the demand by itself. 3) The areas with the highest demands for optimal bikes are residential, followed by industrial, public transportation, official and commercial areas, on both working and non-working days. This algorithm can be an objective basis for city related departments to manage station-free BSSs and be applied to design the layout of bikes in small-scale spatial units to help station-free BSSs operate efficiently and minimize the need to relocate the bikes without reducing the level of user satisfaction.


2020 ◽  
Vol 26 (1) ◽  
pp. 66-72
Author(s):  
DAN GEORGE PRUTICA ◽  
GHEORGHE BRABIE ◽  
BOGDAN CHIRITA

Optimization of cutting parameters in machining operations is a complex task requiring extensive knowledge and experience to reach the maximum potential for cost reductions in manufacturing. Through the work presented in this paper a cutting parameters optimization algorithm for roughing and finishing turning has been realized. The proposed optimization algorithm is based on a combination of linear search and binary search methods, heaving as objective criterion the minimization of the machining time. Examples for roughing and finishing turning have been presented to illustrate the application of the proposed algorithm and analyse the results.


Sign in / Sign up

Export Citation Format

Share Document