The community service activity aims to provide training and assistance members of the Paingan Tourism Awareness Group (Pokdarwis) in making tour packages tourist village Nagari Guguak Kuranji Hilir, Padang Pariaman Regency. This was carried out using method lectures, discussions practice by Pokdarwis totaling 10 people, located at office Wali result this is increase knowledge skills terms desig...

In manual order picking systems, order pickers walk or ride through a warehouse in order to collect items requested by customers. The performance of such a system is significantly dependent on its layout which determines the lengths of the order pickers’ tours and the corresponding picking times. Whereas for classic warehouse layouts all picking aisles are arranged in parallel to each other, in...

User-adaptive tour planning systems are tourist information systems that can make tour plans customized for individual users. Several systems have been already proposed, but such usability issues as frustrating preference/personality registration process and lack of sense of participation still remain. In this paper, we review these usability issues and discuss the following challenges for more...

This article describes a Hopfield-Tank model of the Euclidean traveling salesman problem (using Aiyer’s subspace approach) that incorporates a “fuzzy” interpretation of the rows of the activation array. This fuzzy approach is used to explain the network’s behavior. The fuzzy interpretation consists of computing the center of mass of the positive activations in each row. This produces real numbe...

Recommending and planning tour itineraries are challenging and time-consuming for tourists, hence they may seek tour operators for help. Traditionally tour operators have offered standard tour packages of popular locations, but these packages may not cater to tourist’s interests. In addition, tourists may want to travel in a group, e.g., extended family, and want an operator to help them. We in...

We present a new symmetric traveling salesman problem tour construction heuristic. Two sequential matchings yield a set of cycles over the given point set; these are then stitched to form a tour. Our method outperforms all previous tour construction methods, but is dominated by several tour improvement heuristics. c © 2004 Elsevier B.V. All rights reserved.

It is often difficult for individual tourists to make a sightseeing tour plan because they do not have prior knowledge about the destination. Although several systems have been developed for assisting the user’s tour planning, these systems lack interactivity, while demanding a lot of data input from the user. In this paper, we introduce a new computer-aided tour planning system, called CT-Plan...

The motivation of this project is to solve a problem that we currently face working on a project called 27bards, which seeks to revolutionize the tour industry by constructing a database of currently existing tour operators with the Airbnb-like twist of allowing the average person to make money as a part-time tour guide. We wanted to apply machine-learning techniques to make sense of the largel...

A knight‟s tour on a board is a sequence of knight moves that visits each square exactly once. A knight‟s tour on a square board is called magic knight‟s tour if the sum of the numbers in each row and column is the same (magic constant). Knight‟s tour in higher dimensions (n > 3) is a new topic in the age-old world of knight‟s tours. In this paper, it has been proved that there can‟t be magic k...

We consider the following natural heuristic for the Symmetric Traveling Salesman Problem: solve the subtour relaxation, yielding a solution x∗, and then find the best tour x̄ that is compatible with x∗, where compatible means that every subtour elimination constraint that is satisfied at equality at x∗ is also satisfied at equality at x̄ . We prove that finding the best compatible tour is NP-hard...