An extension of the arc orienteering problem and its application to cycle trip planning

Verbeeck, Cédric; Vansteenwegen, Pieter; Aghezzaf, El‐Houssaine

doi:10.1016/j.tre.2014.05.006

Cited by 45 publications

(22 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(1) is similar to the original OP [2], which only includes reward on nodes. If we use transition reward, it is similar to the arc orienteering problem (AOP) [29], which only includes reward on edges. In terms of the combination equation Eq.…”

Section: Combining Location and Transition Rewardmentioning

confidence: 99%

User Transition Pattern Analysis for Travel Route Recommendation

Sun

Zhuang

2019

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

A travel route recommendation service that recommends a sequence of points of interest for tourists traveling in an unfamiliar city is a very useful tool in the field of location-based social networks. Although there are many web services and mobile applications that can help tourists to plan their trips by providing information about sightseeing attractions, travel route recommendation services are still not widely applied. One reason could be that most of the previous studies that addressed this task were based on the orienteering problem model, which mainly focuses on the estimation of a user-location relation (for example, a user preference). This assumes that a user receives a reward by visiting a point of interest and the travel route is recommended by maximizing the total rewards from visiting those locations. However, a location-location relation, which we introduce as a transition pattern in this paper, implies useful information such as visiting order and can help to improve the quality of travel route recommendations. To this end, we propose a travel route recommendation method by combining location and transition knowledge, which assigns rewards for both locations and transitions.

show abstract

Section: Combining Location and Transition Rewardmentioning

confidence: 99%

User Transition Pattern Analysis for Travel Route Recommendation

Sun

Zhuang

2019

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…Weights being used to prioritize critical nodes ARPs with Profits OARP Max(profit or attractiveness) [11,136,185,198] M the CPP in a multigraph where all nodes have the same odd degree value is equivalent to finding the shortest spanning subgraph in which all nodes have an odd degree value. Suil and West [186] prove the validity of some tight upper bounds for the number of additional edges needed for 3-regular graphs and for 3-regular multigraphs, identifying some cases where the equality holds.…”

Section: Chinese Postman Problem (Cpp)mentioning

confidence: 99%

An updated annotated bibliography on arc routing problems

Mourão

Pinto

2017

Networks

View full text Add to dashboard Cite

The number of arc routing publications has increased significantly in the last decade. Such an increase justifies a second annotated bibliography, a sequel to Corberán and Prins (Networks 56 (2010), 50–69), discussing arc routing studies from 2010 onwards. These studies are grouped into three main sections: single vehicle problems, multiple vehicle problems and applications. Each main section catalogs problems according to their specifics. Section 2 is therefore composed of four subsections, namely: the Chinese Postman Problem, the Rural Postman Problem, the General Routing Problem (GRP) and Arc Routing Problems (ARPs) with profits. Section 3, devoted to the multiple vehicle case, begins with three subsections on the Capacitated Arc Routing Problem (CARP) and then delves into several variants of multiple ARPs, ending with GRPs and problems with profits. Section 4 is devoted to applications, including distribution and collection routes, outdoor activities, post‐disaster operations, road cleaning and marking. As new applications emerge and existing applications continue to be used and adapted, the future of arc routing research looks promising. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(3), 144–194 2017

show abstract

“…Clearly, for such problems, it is difficult to build the vehicle routing problem (VRP) model because the goal of the VRP is to use the minimum number of vehicles to serve all the vertices or to use the minimum total travel distance with a fixed number of vehicles [19,20]. Currently, the TOP has been widely used in solving tourist trip design problems [6,10,21], mobile crowdsourcing problems [22][23][24], UAV task allocation problems [25,26], pharmaceutical sales representative planning problems [27], and resource management allocation problem during wildfires [28].…”

Section: Related Workmentioning

confidence: 99%

Optimization of Pesticide Spraying Tasks via Multi-UAVs Using Genetic Algorithm

Luo

Niu

Zhu

et al. 2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Task allocation is the key factor in the spraying pesticides process using unmanned aerial vehicles (UAVs), and maximizing the effects of pesticide spraying is the goal of optimizing UAV pesticide spraying. In this study, we first introduce each UAV's kinematic constraint and extend the Euclidean distance between fields to the Dubins path distance. We then analyze the two factors affecting the pesticide spraying effects, which are the type of pesticides and the temperature during the pesticide spraying. The time window of the pesticide spraying is dynamically generated according to the temperature and is introduced to the pesticide spraying efficacy function. Finally, according to the extensions, we propose a team orienteering problem with variable time windows and variable profits model. We propose the genetic algorithm to solve the above model and give the methods of encoding, crossover, and mutation in the algorithm. The experimental results show that this model and its solution method have clear advantages over the common manual allocation strategy and can provide the same results as those of the enumeration method in small-scale scenarios. In addition, the results also show that the algorithm parameter can affect the solution, and we provide the optimal parameters configuration for the algorithm.

show abstract

An extension of the arc orienteering problem and its application to cycle trip planning

Abstract: An extension of the arc orienteering problem and its application to cycle trip planning

Cited by 45 publications

References 28 publications

User Transition Pattern Analysis for Travel Route Recommendation

User Transition Pattern Analysis for Travel Route Recommendation

An updated annotated bibliography on arc routing problems

Optimization of Pesticide Spraying Tasks via Multi-UAVs Using Genetic Algorithm

Contact Info

Product

Resources

About