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

DOI10.1007/S10287-009-0119-2zbMATH Open1194.90012OpenAlexW1975583493MaRDI QIDQ993701FDOQ993701

Authors: Enrique Benavent, Ángel Corberán, José M. Sanchis 

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

Recommendations

• Min-Max \(K\)-vehicles windy rural postman problem
• A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
• New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
• New heuristic algorithms for the windy rural postman problem
• Lower bounds and heuristics for the windy rural postman problem
• A branch-and-price algorithm for the windy rural postman problem
• A branch-and-cut algorithm for the profitable windy rural postman problem
• A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
• Heuristics for a dynamic rural postman problem
• Heuristics for the mixed rural postman problem

zbMATH Keywords

metaheuristicsrural postman problemwindy rural postman problemmultivehicles

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
• Multi-depot rural postman problems
• An updated annotated bibliography on arc routing problems
• A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
• Solving the large-scale min-max \(k\)-rural postman problem for snow plowing
• A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
• Aesthetic considerations for the min-max \(K\)-windy rural postman problem
• Min-Max \(K\)-vehicles windy rural postman problem

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

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