The undirected capacitated arc routing problem with profits

DOI10.1016/j.cor.2009.05.005zbMath1188.90024OpenAlexW2085543268MaRDI QIDQ975994

B. E. Eshmatov

Publication date: 11 June 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.05.005

zbMATH Keywords

carrierheuristicsbranch-and-priceauctions in transportationundirected capacitated arc routing with profits

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A matheuristic for the team orienteering arc routing problem ⋮ A branch-and-cut algorithm for the profitable windy rural postman problem ⋮ A branch-and-cut algorithm for the maximum benefit Chinese postman problem ⋮ A scatter search algorithm for time-dependent prize-collecting arc routing problems ⋮ The orienteering problem: a survey ⋮ Arc routing problems: A review of the past, present, and future ⋮ The parking warden tour problem ⋮ Efficient metaheuristics for the mixed team orienteering problem with time windows ⋮ Local search for the undirected capacitated arc routing problem with profits ⋮ City streets parking enforcement inspection decisions: the Chinese postman's perspective ⋮ Capacitated ring arborescence problems with profits ⋮ The directed profitable location rural postman problem ⋮ Profitable mixed capacitated arc routing and related problems

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the prize-collecting rural postman problem
• The team orienteering problem
• A heuristic for the multiple tour maximum collection problem
• A TABU search heuristic for the team orienteering problem
• Future paths for integer programming and links to artificial intelligence
• A cutting plane algorithm for the capacitated arc routing problem
• An exact algorithm for team orienteering problems
• Privatized rural postman problems
• The Vehicle Routing Problem
• The capacitated team orienteering and profitable tour problems
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A Primer in Column Generation
• New Refinements for the Solution of Vehicle Routing Problems with Branch and Price