In order to solve the problem of an uncertain initial state and big errors for hypersonic glide vehicle (HGV) tracking, a hybrid model algorithm is proposed by combining a single model algorithm with a multiple model algorithm. To develop the tracking algorithm with the Cubature Kalman filter, in every model filter the process equation is established based on the HGV aerodynamic model and the m...

Short term prediction of traffic flow is one of the most essential elements of all proactive traffic control systems. Although various methodologies have been applied to forecast traffic parameters, several researchers have showed that compared with the individual methods, hybrid methods provide more accurate results . These results made the hybrid tools and approaches a more common method for ...

‎in this paper‎, ‎we propose two iterative methods for finding a common solution of a finite family of equilibrium problems ‎for pseudomonotone bifunctions‎. ‎the first is a parallel hybrid extragradient-cutting algorithm which is extended from the‎ ‎previously known one for variational inequalities to equilibrium problems‎. ‎the second is a new cyclic hybrid‎ ‎extragradient-cutting algorithm‎....

Though the hybrid system model checker HYTECH has successfully verified some systems, it restricts the dynamics to linear hybrid automata. We have designed an algorithm capable of verifying systems with more general dynamics. This algorithm uses interval numerical methods to conservatively overapproximate the reachable states of a hybrid automaton. We have implemented our new algorithm in HYTEC...

In this paper, a novel hybrid optimization algorithm, which combines a firefly algorithms and Artificial Bee Colony algorithm (FFAABC), is proposed for solving the economic power dispatch (EPD) problem. The hybrid algorithm is structured with two stages. The first stage uses the search by firefly algorithm (FFA) and second stage is a search with Artificial Bee Colony algorithm (ABC). The hybrid...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

This paper considers the problem of scheduling hybrid flowshops with machine availability constraints (MAC) to minimize makespan. The paper deals with a specific case of MAC caused by preventive maintenance (PM) operations. Contrary to previous papers considering fixed or/and conservative policies, we explore a case in which PM activities might be postponed or expedited while necessary. Regardi...

In this paper, we propose a new mathematical model for Capacitated Inventory Routing Problem (CIRP), which considers freshly delivery of perishable products to the customers’ location; otherwise, a reduction in products’ demand may occur. Therefore, we attempt to plan delivering process of products at the right time to avoid extra inventory causing increase in age of products. This ...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...