An ILP-refined tabu search for the directed profitable rural postman problem

DOI10.1016/J.DAM.2012.06.002MaRDI QIDQ406489zbMATH OpenOpenAlexFDO

Authors Gianfranco Guastaroba, C. Archetti, Maria Grazia Speranza

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

zbMATH Keywords

heuristic algorithmsILP-refinement proceduresselective arc routing problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• New results for the directed profitable rural postman problem
• The directed profitable rural postman problem with incompatibility constraints
• The directed profitable location rural postman problem
• Privatized rural postman problems
• The Directed Rural Postman Problem with Turn Penalties

Cites work

• scientific article; zbMATH DE number 1520350 (Why is no real title available?)
• A heuristic algorithm for the truckload and less-than-truckload problem
• A new ILP-based refinement heuristic for vehicle routing problems
• A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
• An algorithm for the Rural Postman problem on a directed graph
• Arc Routing Problems, Part II: The Rural Postman Problem
• Chained Lin-Kernighan for large traveling salesman problems
• Digraphs. Theory, algorithms and applications
• Modeling and solving several classes of arc routing problems as traveling salesman problems
• Modeling the Pre Auction Stage The Truckload Case
• Privatized rural postman problems
• Solving the prize-collecting rural postman problem
• The Capacitated Arc Routing Problem: Lower bounds
• The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
• The orienteering problem: a survey
• The traveling salesman problem and its variations
• The vehicle routing problem
• Transforming asymmetric into symmetric traveling salesman problems
• Transforming asymmetric into symmetric traveling salesman problems: Erratum

Cited in

(12)

• Learning tabu search algorithms: a scheduling application
• The directed profitable rural postman problem with incompatibility constraints
• New results for the directed profitable rural postman problem
• The profitable close-enough arc routing problem
• An updated annotated bibliography on arc routing problems
• New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
• Arc routing problems: A review of the past, present, and future
• Grocery distribution plans in urban networks with street crossing penalties
• A branch-and-cut algorithm for the profitable windy rural postman problem
• On the collaboration uncapacitated arc routing problem
• The directed profitable location rural postman problem
• A survey on matheuristics for routing problems

Describes a project that uses

Uses Software

• MAXFLOW
• VRP

This page was built for publication: An ILP-refined tabu search for the directed profitable rural postman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406489)