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.
The satisfiability problem is the first problem proved to be NP-Complete and has been one of the core NP-Complete problems since then. The satisfiability problem is a decision problem. And the maximum satisfiability problem is its optimization version that aims to find an assignment that satisfies most clauses. In this study, a fuzzy conversion method is proposed to convert the maximum satisfiability...
In this paper, the Multiple Trajectory Search (MTS) is presented for single objective constrained real-parameter optimization problems. The MTS uses multiple agents to search the solution space concurrently. Each agent does an iterated region search using one of three candidate region search methods. By choosing a region search method that best fits the landscape of a solution's neighborhood, an agent...
Many real-world optimization problems involve multiple conflicting objectives. Therefore, multi-objective optimization has attracted much attention of researchers and many algorithms have been developed for solving multi-objective optimization problems in the last decade. In this paper the multiple trajectory search (MTS) is presented and successfully applied to thirteen unconstrained and ten constrained...
In this study, a novel metaheuristic called the multiple trajectory search (MTS) is proposed to solve the uncapacitated facility location problem (UFLP). The multiple trajectory search hybridizes a global search method (the Trajectory_Search) and a local search method (the Variable_Neighborhood_Search). The application of the multiple trajectory search to the benchmarks ORLIB and GHOSH had been conducted...
In this paper, the multiple trajectory search (MTS) is presented for large scale global optimization. The MTS uses multiple agents to search the solution space concurrently. Each agent does an iterated local search using one of three candidate local search methods. By choosing a local search method that best fits the landscape of a solutionpsilas neighborhood, an agent may find its way to a local...
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.