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 colored traveling salesman problem (CTSP) is a generalization of the well-known multiple traveling salesman problem (MTSP). In CTSP, each city has one to multiple colors, allowing a salesman in the same color to visit exactly once. This work presents a dynamic CTSP (DCTSP) in which the weights of edges among the cities change over time. To solve the DCTSP, we propose a variable neighborhood search...
This work formulates for the first time a multiple traveling salesman problem (MTSP) with ordinary and exclusive cities, denoted by MTSP for short. In the original MTSP, a city can be visited by any traveling salesman and is thus renamed as an ordinary one in MTSP. A new class of cities is introduced in MTSP, called exclusive ones. They are divided into groups, each of which can be exclusively visited...
This work formulates for the first time a multiple traveling salesman problem (MTSP) with ordinary and exclusive cities, denoted by MTSP for short. In the original MTSP, a city can be visited by any traveling salesman and is thus renamed as an ordinary one in MTSP. A new class of cities is introduced in MTSP, called exclusive ones. They are divided into groups, each of which can be exclusively visited...
Presently, the number, types, and distribution of resources in a resource allocation system (RAS), may change frequently and dynamically due to fluctuant customer demands. Such changes in a resource allocation (RA) specification mean different production or service behaviors yielded by the providers. This new situation gives rise to a challenging problem, namely, how to switch smoothly the provider...
Generating economical single-product flow-line configurations as candidates for a given demand period is a key optimization problem for reconfigurable manufacturing systems (RMS) at both initial design and reconfiguration stages. The optimization problem addresses the questions of selecting number of workstations, number and type of machines as well as assigned operations for each workstation. Given...
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.