Local search for the undirected capacitated arc routing problem with profits

DOI10.1016/J.EJOR.2010.09.039zbMath1210.90040OpenAlexW2070401841WikidataQ58646223 ScholiaQ58646223MaRDI QIDQ531469

Chris T. Kiranoudis, Emmanouil E. Zachariadis

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

zbMATH Keywords

metaheuristicslocal searcharc routing with profitsaspiration criteria

Mathematics Subject Classification ID

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

Related Items (10)

Approximation algorithms for solving the constrained arc routing problem in mixed graphs ⋮ 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 ⋮ Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery ⋮ An adaptive memory matheuristic for the set orienteering problem ⋮ Efficient metaheuristics for the mixed team orienteering problem with time windows ⋮ An updated annotated bibliography on arc routing problems ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ Profitable mixed capacitated arc routing and related problems

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The selective travelling salesman problem
• 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
• Solving the prize-collecting rural postman problem
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• The team orienteering problem
• An optimal solution procedure for the multiple tour maximum collection problem using column generation
• A heuristic for the multiple tour maximum collection problem
• A TABU search heuristic for the team orienteering problem
• Greedy randomized adaptive search procedures
• A cutting plane algorithm for the capacitated arc routing problem
• A guided local search metaheuristic for the team orienteering problem
• Privatized rural postman problems
• Tabu Search—Part I
• Guided Local Search
• Variable neighborhood search: Principles and applications

This page was built for publication: Local search for the undirected capacitated arc routing problem with profits