Nowadays, due to the high expectations of customers in meeting their demand and the competition environment among service providers, employers are working to provide customers with new methods in the shortest possible time and in the best possible way to attract custome More
Nowadays, due to the high expectations of customers in meeting their demand and the competition environment among service providers, employers are working to provide customers with new methods in the shortest possible time and in the best possible way to attract customer’s satisfaction and maximize profits. In this paper, the orienteering problem with variable profits, fractional objective function and demand on arcs is studied. An appropriate integer programming model is proposed to solve it. In this case, the purpose is to determine a route for a vehicle so that it maximizes the profit, the start and end of its route is at the origin, serving demands of customers, and does not exceed a maximum allowed travel time. In the orinteering problem with variable profits and fractional objective function the customers are located on vertices of the graph corresponding to the problem. Next, a problem is considered in which the service is performed on arcs. The resulting problem is called the orinteering arc routing problem with variable profits and fractional objective function. We solve the problem by bisection method. In the end, the numerical efficiency of the proposed model is examined. The proposed algorithms can solve problems in a reasonable amount of time. We will also see that the time of solving problems depends on their graph structure and not on their size.
Manuscript profile
The use of distributed generation (DG) systems has significant effects, such as increasing the stability of the voltage profile, reducing power losses, and solving problems related to voltage stability. This study proposes an objective function to locate and determine t More
The use of distributed generation (DG) systems has significant effects, such as increasing the stability of the voltage profile, reducing power losses, and solving problems related to voltage stability. This study proposes an objective function to locate and determine the optimal size in DG systems. The objective function is based on increasing the voltage profile, reducing power loss, and improving economic efficiency using an arithmetic optimization algorithm (AOA). The proposed approach uses the lowest losses and improvement of the voltage profile level after injecting power into the system in distribution networks and sub-transmission networks to determine and locate the optimal size in DG systems. This research has been implemented on an IEEE 33-bus network using AOA, and the results are compared with genetic algorithm (GA) and particle swarm optimization (PSO). The results show that the proposed approach is superior to other optimization methods in locating and determining the optimal size, power loss, and cost function in DG systems. For example, AOA has obtained more profit than PSO and GA, 33.4% and 32.8%, respectively. In particular, the results show that AOA has a higher convergence speed in finding the optimal location in DG systems.
Manuscript profile
Planning is currently considered as an important element for the whole personal, societal and organizational affairs, whereby every activity would be performed effectively. Scheduling is of high significance in operations research. Recently, scholars have drawn much att More
Planning is currently considered as an important element for the whole personal, societal and organizational affairs, whereby every activity would be performed effectively. Scheduling is of high significance in operations research. Recently, scholars have drawn much attention to the application of mathematical modeling as an optimization approach in solving the complex scheduling problems. However, only a few have addressed the open-shop scheduling problem. This study was intended to investigate the effectiveness of meta-heuristic genetic algorithm in order to minimize non-decreasing separable objective functions for such problem. In this genetic algorithm, displacement mutation and partially matched crossover were adopted as two operators. Moreover, the obtained solutions were compared based on how to select the best chromosome by using methods of tournament selection, rank selection, and roulette wheel selection. The data were collected through literature review. It was exhibited that meta-heuristic genetic algorithm can rapidly find the optimal solution. Furthermore, rank selection resulted in more optimal solutions instead of the other two.
Manuscript profile
One of the common methods of structural damage detections and identification of location and severity of the damage in structures is investigation of changes in modal parameters before and after damage. These methods which are mostly based on optimization techniques use More
One of the common methods of structural damage detections and identification of location and severity of the damage in structures is investigation of changes in modal parameters before and after damage. These methods which are mostly based on optimization techniques use an objective function based on natural frequencies and mode shapes. This paper reviews previous researches in damage detection techniques based on modal parameters and common objective functions used in the optimization stage in the damage detection process. To this end, damage detection methods based on natural frequency, mode shape, curvature mode shape and both of mode shape and natural frequency are reviewed. In the following, due to high importance of objective function in the damage detection process, objective functions based on modal assurance criterion, flexibility matrix and natural frequency and mode shapes are compared
Manuscript profile
Choosing appropriate objective function is necessary for detection of damage location and severity. To this end, objective functions based on modal parameters such as mode shapes and natural frequencies are combined with other objective functions capable to detect damag More
Choosing appropriate objective function is necessary for detection of damage location and severity. To this end, objective functions based on modal parameters such as mode shapes and natural frequencies are combined with other objective functions capable to detect damage location. Then the location and severity of damage is obtained using optimization techniques. In this paper a cantilever beam is simulated numerically in MATLAB software using finite element method and then single and multi-objective genetic algorithms with different objective functions based on modal parameters are used to detect damage location and severity. To compare different objective functions, the effect of coordinate incompleteness, frequency range of interest and also environmental noise on the obtained results is studied.
Manuscript profile
In this research, a new method is proposed to reduce the coincidence of the volume, losses and cost of making a DC motor without brushes using colonial competition optimization algorithms. In the first step, all electric motor relations are extracted and expressed based More
In this research, a new method is proposed to reduce the coincidence of the volume, losses and cost of making a DC motor without brushes using colonial competition optimization algorithms. In the first step, all electric motor relations are extracted and expressed based on its geometric parameters. In the second step, the function of competence, which is the same reduction in the volume, losses and cost of construction of a DC motor without brush, is defined on the basis of the relationships obtained in the previous stage. In the third step, the colonial competition algorithm is used to select the best values of the geometric parameters of the engine so that the objective function is minimized. The results of simulations show that the colonial competition algorithm has a good performance and can dramatically reduce the size, loss, and cost by appropriate selection of geometric parameters.
Manuscript profile