Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Competing for the most profitable tour: The orienteering interdiction game (2407.02959v1)

Published 3 Jul 2024 in math.OC and cs.DM

Abstract: The orienteering problem is a well-studied and fundamental problem in transportation science. In the problem, we are given a graph with prizes on the nodes and lengths on the edges, together with a budget on the overall tour length. The goal is to find a tour that respects the length budget and maximizes the collected prizes. In this work, we introduce the orienteering interdiction game, in which a competitor (the leader) tries to minimize the total prize that the follower can collect within a feasible tour. To this end, the leader interdicts some of the nodes so that the follower cannot collect their prizes. The resulting interdiction game is formulated as a bilevel optimization problem, and a single-level reformulation is obtained based on interdiction cuts. A branch-and-cut algorithm with several enhancements, including the use of a solution pool, a cut pool and a heuristic method for the follower's problem, is proposed. In addition to this exact approach, a genetic algorithm is developed to obtain high-quality solutions in a short computing time. In a computational study based on instances from the literature for the orienteering problem, the usefulness of the proposed algorithmic components is assessed, and the branch-and-cut and genetic algorithms are compared in terms of solution time and quality.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (52)
  1. A survey on bilevel optimization under uncertainty. European Journal of Operational Research 311, 401–426.
  2. Is door-to-door canvassing effective in europe? evidence from a meta-study across six european countries. British Journal of Political Science 49, 279–290.
  3. An arc interdiction vehicle routing problem with information asymmetry. Computers & Industrial Engineering 115, 520–531.
  4. Defending critical infrastructure. Interfaces 36, 530–544.
  5. Bilevel model for production–distribution planning solved by using ant colony optimization. Computers & Operations Research 38, 320–327.
  6. A tabu search algorithm to solve a green logistics bi-objective bi-level problem. Annals of Operations Research 316, 927–953.
  7. A bilevel approach for compensation and routing decisions in last-mile delivery. arXiv preprint arXiv:2304.09170 .
  8. The team orienteering problem. European Journal of Operational Research 88, 464–474.
  9. Identifying critical infrastructure: the median and covering facility interdiction problems. Annals of the Association of American Geographers 94, 491–502.
  10. Mathematical home burglary model with stochastic long crime trips and patrolling: Applied to Mexico City. Applied Mathematics and Computation 396, 125865.
  11. Solution of a large-scale traveling-salesman problem. Journal of the Operations Research Society of America 2, 393–410.
  12. Discrete-variable extremum problems. Operations Research 5, 266–288.
  13. Bilevel optimization. Springer.
  14. Interdiction and discrete bilevel linear programming. Lehigh University PhD thesis.
  15. A new general-purpose algorithm for mixed-integer bilevel linear programs. Operations Research 65, 1615–1637.
  16. Interdiction games and monotonicity, with application to knapsack problems. INFORMS Journal on Computing 31, 390–410.
  17. Solving the orienteering problem through branch-and-cut. INFORMS Journal on Computing 10, 133–148.
  18. The maximum clique interdiction problem. European Journal of Operational Research 277, 112–127.
  19. The orienteering problem. Naval Research Logistics 34, 307–318.
  20. Orienteering problem: A survey of recent variants, solution approaches and applications. European Journal of Operational Research 255, 315–332.
  21. The orienteering problem with stochastic profits. IIE Transactions 40, 406–421.
  22. Shortest-path network interdiction. Networks: An International Journal 40, 97–111.
  23. A bilevel ant colony optimization algorithm for capacitated electric vehicle routing problem. IEEE Transactions on Cybernetics 52, 10855–10868.
  24. Analysis of an integrated maximum covering and patrol routing problem. Transportation Research Part E: Logistics and Transportation Review 48, 215–232.
  25. An improved benders decomposition algorithm for an arc interdiction vehicle routing problem. IEEE Transactions on Engineering Management 63, 259–273.
  26. A bi-level network interdiction model for solving the hazmat routing problem. International Journal of Production Research 54, 459–471.
  27. A survey on mixed-integer programming techniques in bilevel optimization. EURO Journal on Computational Optimization 9, 100007.
  28. The team orienteering problem with time windows: An lp-based granular variable neighborhood search. European Journal of Operational Research 220, 15–27.
  29. The selective travelling salesman problem. Discrete Applied Mathematics 26, 193–207.
  30. Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Transactions 39, 15–26.
  31. Solving the traveling salesman problem with interdiction and fortification. Operations Research Letters 45, 210–216.
  32. A backward sampling framework for interdiction problems with fortification. INFORMS Journal on Computing 29, 123–139.
  33. On the merits of face-to-face campaigning. Social Science Quarterly , 534–543.
  34. A bilevel genetic algorithm for a real life location routing problem. International Journal of Logistics: Research and Applications 11, 49–65.
  35. A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm. Journal of Global Optimization 38, 555–580.
  36. A bi-level model and memetic algorithm for arc interdiction location-routing problem. Computational and Applied Mathematics 40, 1–44.
  37. A metaheuristic reconstruction algorithm for solving bi-level vehicle routing problems with backhauls for army rapid fielding. Military Logistics: Research Advances and Future Trends , 141–157.
  38. A multilevel approach for modelling vehicle routing problem with uncertain travelling time. Journal of Intelligent Manufacturing 28, 683–688.
  39. Door-to-door canvassing in the European elections: Evidence from a Swedish field experiment. Electoral Studies 45, 110–118.
  40. A bi-level bi-objective mathematical model for stop location in a school bus routing problem. IFAC-PapersOnLine 52, 1120–1125.
  41. The r-interdiction selective multi-depot vehicle routing problem. International Transactions in Operational Research 27, 835–866.
  42. A trilevel r-interdiction selective multi-depot vehicle routing problem with depot protection. Computers & Operations Research 123, 104996.
  43. A defender-attacker model and algorithm for maximizing weighted expected hitting time with application to conservation planning. IISE Transactions 49, 1112–1128.
  44. A survey of network interdiction models and algorithms. European Journal of Operational Research 283, 797–811.
  45. A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation. Mathematical Programming Computation 12, 529–568.
  46. A class of algorithms for mixed-integer bilevel min–max optimization. Journal of Global Optimization 66, 225–262.
  47. Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks. European Journal of Operational Research 297, 40–52.
  48. The orienteering problem: a survey. European Journal of Operational Research 209, 1–10.
  49. The theory of the market economy. Oxford University Press.
  50. The watermelon algorithm for the bilevel integer linear programming problem. SIAM Journal on Optimization 27, 1403–1430.
  51. Removing arcs from a network. Operations Research 12, 934–940.
  52. Deterministic network interdiction. Mathematical and Computer Modelling 17, 1–18.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets