The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, a novel population-based meta-heuristic algorithm, Discrete Cuckoo Search (DCS), is applied to solve Resource Constrained Project Scheduling Problem (RCPSP). The DCS is a modification of the existing Cuckoo Search which was adapted for solving combinatorial optimization problems. Application of the DCS for solving RCPSP was achieved by changing some of the algorithm's core elements,...
Gait recognition is of increasing interest recently. A gait recognition method using the temporal information of leg angles is proposed, based on the fact that changes of leg angles can reflect main trait of a man's moving. First the pendulum model is referred to for extracting leg parts, and least-square method is used for boundary fitting, to obtain the temporal information of angle about thigh...
An angle-based crossover tabu search (CTS) has been presented by author of this paper in. In this paper, an improved CTS is presented using the tabu-recorder, which record the tabu times of tabu-active attributes, to confirm new initial resolutions except the first cycle, and enlarge the global search, which is applied for the larger-scale traveling salesman problem (TSP). The key strategies of the...
Multi-objective flowshop scheduling problems have gained wide attention both in practical and academic fields. In this paper, a hybrid multi-objective genetic algorithm is proposed to solve multi-objective no-wait flowshop scheduling problems with both the makespan and the total flow time minimization. The proposed algorithm makes use of the principle of non-dominated sorting, coupled with the use...
An improved tabu search - crossover tabu search (CTS), with the angle-based idea of the sweep heuristic to confirm neighborhood, is presented, which is applied for solving a well-known combinatorial optimization problem - the traveling salesman problem (TSP). The key strategies of the CTS are intensification strategy and diversification strategy. Intensification strategies, based on modifying choice...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.