An ILP-refined tabu search for the directed profitable rural postman problem
From MaRDI portal
Publication:406489
DOI10.1016/j.dam.2012.06.002zbMath1352.90079OpenAlexW2013803636MaRDI QIDQ406489
G. Guastaroba, Maria Grazia Speranza, Claudia Archetti
Publication date: 8 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.06.002
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (10)
New results for the directed profitable rural postman problem ⋮ A branch-and-cut algorithm for the profitable windy rural postman problem ⋮ On the collaboration uncapacitated arc routing problem ⋮ The profitable close-enough arc routing problem ⋮ Grocery distribution plans in urban networks with street crossing penalties ⋮ Arc routing problems: A review of the past, present, and future ⋮ New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems ⋮ The directed profitable rural postman problem with incompatibility constraints ⋮ A survey on matheuristics for routing problems ⋮ The directed profitable location rural postman problem
Uses Software
Cites Work
- Unnamed Item
- The orienteering problem: a survey
- Transforming asymmetric into symmetric traveling salesman problems
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- Solving the prize-collecting rural postman problem
- Transforming asymmetric into symmetric traveling salesman problems: Erratum
- Modeling and solving several classes of arc routing problems as traveling salesman problems
- The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
- The traveling salesman problem and its variations
- A heuristic algorithm for the truckload and less-than-truckload problem
- Privatized rural postman problems
- A new ILP-based refinement heuristic for vehicle routing problems
- The Vehicle Routing Problem
- Chained Lin-Kernighan for Large Traveling Salesman Problems
- An algorithm for the Rural Postman problem on a directed graph
- The Capacitated Arc Routing Problem: Lower bounds
- Arc Routing Problems, Part II: The Rural Postman Problem
- Spectral Theory and Analysis
- Modeling the Pre Auction Stage The Truckload Case
This page was built for publication: An ILP-refined tabu search for the directed profitable rural postman problem
