Models and Algorithms for the Constrained Orienteering Problem

被引:0
|
作者
Li, Zhenping [1 ]
Wang, Rui-Sheng [2 ]
Liu, Hong-Wei [1 ]
Zhou, Wenfeng [1 ]
机构
[1] Beijing Wuzi Univ, Sch Informat, Beijing 101149, Peoples R China
[2] Renmin Univ China, Sch Informat, Beijing 100872, Peoples R China
来源
OPERATIONS RESEARCH AND ITS APPLICATIONS | 2010年 / 12卷
基金
北京市自然科学基金; 中国国家自然科学基金;
关键词
Constrained Orienteering Problem; Integer Linear Programming; Heuristic Algorithm;
D O I
暂无
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The constrained orienteering problem (COP) can be expressed as: Given an undirected weighted graph G = (V,E) and a subset S subset of V. Each node has a score, each edge has a weight indicating distance or time between the two adjacent nodes. The starting node and ending node are specified. Given a fixed amount of weight denoting the total distance or total time, the goal is to determine a walk from the starting node to the ending node through a subset of nodes including all the nodes in S, in order to maximize the total score of the walk. This problem is a generalization of the orienteering problem or a special case of the Steiner Tree problem. In this paper, we first formulate the COP problem into an integer linear programming based on network flow theory and solve it to obtain the exact optimal solution for examples of small size. Then we give a heuristic algorithm for solving the large instances of the problem. Finally, we give computational results of both exact and heuristic algorithms which demonstrate the efficient of the algorithm.
引用
收藏
页码:89 / +
页数:3
相关论文
共 50 条
  • [31] Optimization algorithms for the disjunctively constrained knapsack problem
    Ben Salem, Mariem
    Taktak, Raouia
    Mahjoub, A. Ridha
    Ben-Abdallah, Hanene
    SOFT COMPUTING, 2018, 22 (06) : 2025 - 2043
  • [32] Algorithms for the multi-constrained routing problem
    Puri, A
    Tripakis, S
    ALGORITHM THEORY - SWAT 2002, 2002, 2368 : 338 - 347
  • [33] Approximation Algorithms for the Interval Constrained Coloring Problem
    Althaus, Ernst
    Canzar, Stefan
    Elbassioni, Khaled
    Karrenbauer, Andreas
    Mestre, Julian
    ALGORITHMICA, 2011, 61 (02) : 342 - 361
  • [34] Models and algorithms for haplotyping problem
    Zhang, Xiang-Sun
    Wang, Rui-Sheng
    Wu, Ling-Yun
    Chen, Luonan
    CURRENT BIOINFORMATICS, 2006, 1 (01) : 105 - 114
  • [35] Improved Algorithms for Orienteering and Related Problems
    Chekuri, Chandra
    Korula, Nitish
    Pal, Martin
    PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 661 - +
  • [36] Two algorithms for fitting constrained marginal models
    Evans, R. J.
    Forcina, A.
    COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2013, 66 : 1 - 7
  • [37] Dubins Orienteering Problem with Neighborhoods
    Penicka, Robert
    Faigl, Jan
    Vana, Petr
    Saska, Martin
    2017 INTERNATIONAL CONFERENCE ON UNMANNED AIRCRAFT SYSTEMS (ICUAS'17), 2017, : 1555 - 1562
  • [38] The Correlated Arc Orienteering Problem
    Agarwal, Saurav
    Akella, Srinivas
    ALGORITHMIC FOUNDATIONS OF ROBOTICS XV, 2023, 25 : 402 - 418
  • [39] The Dynamic Team Orienteering Problem
    Kirac, Emre
    Milburn, Ashlea Bennett
    Gedik, Ridvan
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2025, 324 (01) : 22 - 39
  • [40] THE ORIENTEERING PROBLEM WITH TIME WINDOWS
    KANTOR, MG
    ROSENWEIN, MB
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1992, 43 (06) : 629 - 635