Orienteering Problem: A survey of recent variants, solution approaches and applications

National Research Foundation (NRF) Singapore under International Research Centres in Singapore Funding Initiativ

Solving Multi Objectives Team Orienteering Problem with Time Windows using Multi Integer Linear Programming

This study solves tourist trip planning using team orienteering problem with time windows with more than one objective. In MO-TOPTW, besides maximum score, there is minimum time that must be achieved to make sure tourist get effective and efficient routing. Score represent priority to visit the destinations, while time consist of visiting time and traveling time between destinations. Number of routing is determined and the goal is giving the tourist the best routing that fulfill all the constraints. The constraints are time windows and tourist’s budget time. Modification of mathematical programming will be done. We used small case to compare between heuristic procedure to develop the route with optimization. Optimization is implemented using Multi Integer Linear Programming using Lingo. The global optimum of optimization method gives better result than heuristic, with total score higher as 12% and total time lower 7.3%. Because this is NP-hard problem, the running time is 45 minutes 24 seconds, very long time for tourist to wait the result. Further research must be done to faster the process with preserving the best result

An updated annotated bibliography on arc routing problems

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.info:eu-repo/semantics/publishedVersio