A metaheuristic for the min-max windy rural postman problem with K vehicles

DOI10.1007/S10287-009-0119-2zbMath1194.90012OpenAlexW1975583493MaRDI QIDQ993701

Enrique Benavent, José María Sanchis, Angel Corberán

Publication date: 20 September 2010

Published in: Computational Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10287-009-0119-2

zbMATH Keywords

metaheuristicsrural postman problemwindy rural postman problemmultivehicles

Mathematics Subject Classification ID

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

Related Items (6)

Multi-depot rural postman problems ⋮ An updated annotated bibliography on arc routing problems ⋮ Solving the large-scale min-max \(k\)-rural postman problem for snow plowing ⋮ Aesthetic considerations for the min-max \(K\)-windy rural postman problem ⋮ A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem ⋮ New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive memetic algorithms for arc routing problems
• Lower bounds and heuristics for the windy rural postman problem
• On the cycle polytope of a binary matroid
• On the windy postman problem on Eulerian graphs
• Variable neighborhood search
• Evolutionary algorithms for periodic arc routing problems
• Solvable cases of the \(k\)-person Chinese postman problem
• New heuristic algorithms for the windy rural postman problem
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
• Solution of a Min-Max Vehicle Routing Problem
• Min-Max K -vehicles windy rural postman problem
• New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
• The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
• An algorithm for the Rural Postman problem on a directed graph
• The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
• The Chinese Postman Problem for Mixed Networks
• Arc Routing Problems, Part II: The Rural Postman Problem
• A branch & cut algorithm for the windy general routing problem and special cases

This page was built for publication: A metaheuristic for the min-max windy rural postman problem with K vehicles