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.
This paper proposes a memetic direct transcription algorithm to solve Multi-Objective Optimal Control Problems (MOOCP). The MOOCP is first transcribed into a Non-linear Programming Problem (NLP) with Direct Finite Elements in Time (DFET) and then solved with a particular formulation of the Multi Agent Collaborative Search (MACS) framework. Multi Agent Collaborative Search is a memetic algorithm in...
The synergy between exploration and exploitation has been a prominent issue in optimization. Optimization algorithms are generally required to have their parameters tuned to achieve successful exploration-exploitation synergies. Nonetheless, while many algorithms have achieved remarkable success in a wide range of applications, the key to successful exploration-exploitation synergies still remains...
Semantic interoperability represents the ability of two or more systems to automatically interpret the information exchanged meaningfully in order to produce useful results. Currently, the best recognized technology for achieving a specification of meaning is represented by ontologies. However, the variety of ways that a domain can be conceptualized results in the creation of different ontologies...
The synergy between exploration and exploitation has been a prominent issue in optimization. The rise of memetic algorithms, a category of optimization techniques which feature the explicit exploration-exploitation coordination, much accentuates this issue. While memetic algorithms have achieved remarkable success in a wide range of real-world applications, the key to a successful exploration-exploitation...
Group Model Building (GMB) often refers to collaborative system dynamics (SD) modeling. Despite its impressive success in various interdisciplinary domains, SD still struggles to be adopted as a mainstream method in the very areas where it has proven its worth. SD is hard to learn, and acquiring modeling skills can take long time. SD is mostly taught in modeling courses with examples from various...
The synergy between exploration and exploitation has been a prominent issue in optimization. The rise of memetic algorithms, a category of optimization techniques which feature the explicit exploration-exploitation coordination, much accentuates this issue. While memetic algorithms have achieved remarkable success in a wide range of real-world applications, the key to successful exploration-exploitation...
Nowadays in the transportation industry carriers reduce the costs through collaboration, e.g., sharing the assets and tasks with other collaborative partners. In this paper, an optimization problem called the Close-Open Mixed Vehicle Routing Problem (COMVRP) is discussed, that can be used to assist in identifying routes when a carrier serves the customers through his private vehicles and vehicles...
Web based Decision Support systems like recommendation systems have become effective tools for decision making in the recent past. However the recommender systems employing conventional clustering techniques (KRS) like K-Means for collaborative filtering, suffer from the limitation of getting local optimum results. This paper presents Memetic Recommender System (MRS) based on the collaborative behavior...
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.