Abstract
Orienteering problem is well-known as a NP-hard problem in transportation with many applications. This problem aims to find a path between a given set of control points, where the source and destination points are specified with respect to maximize the total score of collected points and satisfy the distance constraint. In this paper, we first analyze the structure of a generalized orienting problem and a new solution method, based on DC programming, DCA and Cutting plane method, is introduced. Preliminary numerical experiments are reported to show the efficiency of the proposed algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Laporte, G., Martello, S.: The selective travelling salesman problem. Discrete Applied Mathematics 26, 193–207 (1990)
Steven, E.B., Tom, M.C.: A heuristic for the multiple tour maximum collection problem. Computers & Operations Research 21(1), 101–111 (1994)
Arkin, E.M., Mitchell, J.S.B., Narasimhan, G.: Resource-constrained Geometric Network Optimization. In: Proceedings of the Fourteenth Annual Symposium on Computational Geometry, pp. 307–316 (1998)
Golden, B.L., Assad, A., Dahl, R.: Analysis of a large-scale vehicle routing problem with inventory component. Large Scale Systems 7, 181–190 (1984)
Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Naval Research Logistics 34, 307–318 (1987)
Keller, P.: Algorithms to solve the orienteering problem: a comparison. European Journal of Operational of Research 41, 224–231 (1989)
Kantor, M., Rosenwein, M.: The orienteering problem with time windows. Journal of Operational Research Society 43(6), 629–635 (1992)
Pieter, V., Wouter, S., Dirk, V.O.: The orienteering problem: A survey. European Journal of Operational Research 209(1), 1–10 (2011)
Balas, E.: The prize collecting traveling salesman problem. Networks 19, 621–636 (1989)
Le Thi, H.A., Pham Dinh, T.: A Continuous Approach for Globally Solving Linearly Constrained Quadratic Zero - One Programming Problems. Optimization 50, 93–120 (2001)
Alexander, S.: Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization (1998)
Nguyen Quang, T.: Approches locales et globales basées sur la programmation DC et DCA pour des problèmes combinatoires en variables mixtes 0-1: applications à la planification opérationnelle, These de doctorat dirigée par Le Thi H.A Informatique Metz (2010)
Nguyen, V.V.: Methodes exactes basées sur la programmation DC et nouvelles coupes pour l’optimisation en variables mixtes zero-un, These de doctorat dirigée par Pham Dinh T. and Le Thi H.A, LMI, INSA Rouen (2006)
Tsiligirides, T.: Heuristic Methods Applied to Orienteering. Journal of the Operational Research Society 35, 797–809 (1984)
Chao, I., Golden, B., Wasil, E.: Theory and methodology: a fast and effective heuristic for the orienteering problem. European Journal of Operational Research 88, 475–489 (1996)
Chao, I.: Algorithms and Solutions to Multi-level Vehicle Routing Problems. PhD thesis, University of Maryland at College Park (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Ta, A.S., Le Thi, H.A., Ha, T.S. (2015). Solving Relaxation Orienteering Problem Using DCA-CUT. In: Le Thi, H., Pham Dinh, T., Nguyen, N. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. Advances in Intelligent Systems and Computing, vol 359. Springer, Cham. https://doi.org/10.1007/978-3-319-18161-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-18161-5_17
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18160-8
Online ISBN: 978-3-319-18161-5
eBook Packages: EngineeringEngineering (R0)