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.
Vehicle Routing Problem (VRP) is a widely known NP-Hard combinatorial optimization problem. This paper presents a proposal of a memetic algorithm (MA) with simulated annealing (SA) as trajectory-based method for solving the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). A novel crossover operator, the Single Breaking-point Sequence Based Crossover (SBSBX), is introduced and compared...
The past few years have seen several variants of Evolutionary Algorithms (EAs) applied to solving Sudoku puzzles. Given that EAs with simple components do not work properly, considerable efforts have gone into designing ad-hoc evolutionary operators that profit from a knowledge of the problem. In this paper, we show that one of the main reasons for the improper behavior of EAs when dealing with difficult...
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.