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 work deals with the Traveling Salesman Problem with Hotel Selection (TSPHS), a variant of the classic Traveling Salesman Problem (TSP). In the TSPHS, a set of hotels can be visited in strategic points of the route, dividing it in a minimum number of trips. Each trip must not exceed a given time limit, minimizing also the total time traveled. The TSPHS is NP-Hard, being a generalization of the...
This work addresses the Unrelated Parallel Machine Scheduling Problem where setup times are sequence-dependent and machine-dependent, the UPMSPST. The maximum completion time of the schedule, known as makespan, is considered as the objective to minimize. The UPMSPST is often found in industries and belongs to the NP-hard class. Aiming to its resolution, is proposed an algorithm named GARP. This algorithm...
This work addresses the development of a hybrid CPU-GPU local search heuristic for the unrelated parallel machine scheduling problem. In this scheduling problem setup times are sequence-dependent and also machine-dependent. The objective is to minimize the maximum completion time of the schedule, known as make span. Since the problem belongs to the NP-hard class there is no known polynomial time algorithm...
In this work, we propose a new algorithm to solve a variant of the Vehicle Routing Problem that is the Single Vehicle Routing Problem with Deliveries and Selective Pickups (SVRPDSP). Our algorithm produces good quality solutions that are better than the best known solutions in the literature. In order to reduce the time spent to solve large-sized instances, we also propose here a parallel implementation...
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.