Local search for the undirected capacitated arc routing problem with profits
DOI10.1016/J.EJOR.2010.09.039zbMATH Open1210.90040OpenAlexW2070401841WikidataQ58646223 ScholiaQ58646223MaRDI QIDQ531469FDOQ531469
Authors: Emmanouil E. Zachariadis, Chris T. Kiranoudis 
Publication date: 29 April 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.09.039
Recommendations
- The undirected capacitated arc routing problem with profits
- The undirected capacitated general routing problem with profits
- An artificial bee colony approach for the undirected capacitated arc routing problem with profits
- A guided local search heuristic for the capacitated arc routing problem
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cites Work
- Title not available (Why is that?)
- Tabu Search—Part I
- The team orienteering problem
- Variable neighborhood search: Principles and applications
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Solving the prize-collecting rural postman problem
- Greedy randomized adaptive search procedures
- Privatized rural postman problems
- The selective travelling salesman problem
- A TABU search heuristic for the team orienteering problem
- A cutting plane algorithm for the capacitated arc routing problem
- Title not available (Why is that?)
- A path relinking approach for the team orienteering problem
- The undirected capacitated arc routing problem with profits
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- A heuristic for the multiple tour maximum collection problem
- A guided local search metaheuristic for the team orienteering problem
- Title not available (Why is that?)
- An optimal solution procedure for the multiple tour maximum collection problem using column generation
- Guided Local Search
Cited In (15)
- An artificial bee colony approach for the undirected capacitated arc routing problem with profits
- A guided local search procedure for the multi-compartment capacitated arc routing problem
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs
- An updated annotated bibliography on arc routing problems
- Arc routing problems: A review of the past, present, and future
- A matheuristic for the team orienteering arc routing problem
- Efficient metaheuristics for the mixed team orienteering problem with time windows
- The undirected capacitated general routing problem with profits
- A branch-and-cut algorithm for the profitable windy rural postman problem
- A unified solution framework for multi-attribute vehicle routing problems
- The undirected capacitated arc routing problem with profits
- An adaptive memory matheuristic for the set orienteering problem
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
- Profitable mixed capacitated arc routing and related problems
Uses Software
This page was built for publication: Local search for 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 Q531469)
