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.
We present a hyperheuristic approach designed to solve a real world problem: the Orienteering Problem with Hotel Selection (OPHS). This problem has recently been introduced as an extension of the well-known Orienteering Problem. In this problem, hotels must be selected from a pool of available hotels. Each trip starts and ends in one of the hotels. The goal is to maximize the total score computed...
In this study, we present the Big Bang-Big Crunch (BB-BC) method to solve the post-enrolment course timetabling problem. This method is derived from one of the evolution of the universe theories in physics and astronomy. The BB-BC theory involves two phases (Big Bang and Big Crunch). The Big Bang phase feeds the Big Crunch phase with many inputs and the Big Crunch phase is the shrinking destiny of...
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges crossing the subsets is minimized. In this work, we present a multilevel memetic algorithm for this NP-hard problem that relies on a powerful grouping recombination operator and a dedicated local search procedure. The proposed...
The generalized traveling salesman problem (GTSP) is a generalization of the classical traveling salesman problem. The GTSP is known to be an NP-hard problem and has many interesting applications. In this paper we present a local-global approach for the generalized traveling salesman problem and as well an efficient algorithm for solving the problem based on genetic algorithms. Computational results...
Redundancy allocation problems (RAPs) have attracted much attention for the past thirty years due to its wide applications in improving the reliability of various engineering systems. Because RAP is an NP-hard problem, and exact methods are only applicable to small instances, various heuristic and meta-heuristic methods have been proposed to solve it. In the literature, most studies on RAPs have been...
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.