The undirected capacitated arc routing problem with profits

DOI10.1016/J.COR.2009.05.005MaRDI QIDQ975994zbMATH OpenOpenAlexFDO

Authors 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

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

Mathematics Subject Classification ID

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

Recommendations

• Local search for the undirected capacitated arc routing problem with profits
• The undirected capacitated general routing problem with profits
• Profitable mixed capacitated arc routing and related problems
• scientific article; zbMATH DE number 6741969
• The capacitated arc routing problem. A heuristic algorithm

Cites work

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

Cited in

(20)

• A scatter search algorithm for time-dependent prize-collecting arc routing problems
• Capacitated ring arborescence problems with profits
• On the collaboration uncapacitated arc routing problem
• The orienteering problem: a survey
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem
• The undirected capacitated general routing problem with profits
• Customer selection and profit maximization in vehicle routing problems
• The directed profitable location rural postman problem
• The profitable close-enough arc routing problem
• An updated annotated bibliography on arc routing problems
• City streets parking enforcement inspection decisions: the Chinese postman's perspective
• Local search for the undirected capacitated arc routing problem with profits
• A matheuristic for the team orienteering arc routing problem
• A branch-and-cut algorithm for the profitable windy rural postman problem
• Arc routing problems: A review of the past, present, and future
• scientific article; zbMATH DE number 6741969 (Why is no real title available?)
• Efficient metaheuristics for the mixed team orienteering problem with time windows
• The parking warden tour problem
• Profitable mixed capacitated arc routing and related problems
• An artificial bee colony approach for the undirected capacitated arc routing problem with profits

Describes a project that uses

Uses Software

• VRP

This page was built for publication: The undirected capacitated arc routing problem with profits

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