Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
A heuristic for the multiple tour maximum collection problem
Computers and Operations Research
A tabu search heuristic for the vehicle routing problem
Management Science
A cutting plane algorithm for the capacitated arc routing problem
Computers and Operations Research
A Tabu Search Heuristic for the Capacitated Arc Routing Problem
Operations Research
A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
Transportation Science
Traveling Salesman Problems with Profits
Transportation Science
Privatized rural postman problems
Computers and Operations Research
Metaheuristics for the team orienteering problem
Journal of Heuristics
A TABU search heuristic for the team orienteering problem
Computers and Operations Research
The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm
Transportation Science
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
The Windy Clustered Prize-Collecting Arc-Routing Problem
Transportation Science
A Tabu Search Heuristic for the Prize-collecting Rural Postman Problem
Electronic Notes in Theoretical Computer Science (ENTCS)
The time-dependent prize-collecting arc routing problem
Computers and Operations Research
GRASP and Path Relinking for the Clustered Prize-collecting Arc Routing Problem
Journal of Heuristics
Hi-index | 0.01 |
A profit and a demand are associated with each edge of a set of profitable edges of a given graph. A travel time is associated with each edge of the graph. A fleet of capacitated vehicles is given to serve the profitable edges. A maximum duration of the route of each vehicle is also given. The profit of an edge can be collected by one vehicle only that also serves the demand of the edge. The objective of this problem, which is called the undirected capacitated arc routing problem with profits (UCARPP), is to find a set of routes that satisfy the constraints on the duration of the route and on the capacity of the vehicle and maximize the total collected profit. We propose a branch-and-price algorithm and several heuristics. We can solve exactly instances with up to 97 profitable edges. The best heuristics find the optimal solution on most of instances where it is available.