Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems

DOI10.1002/net.21478zbMath1269.90016OpenAlexW1978225647WikidataQ125269250 ScholiaQ125269250MaRDI QIDQ5326795

Anupam Seth, Diego Klabjan, Placid M. Ferreira

Publication date: 6 August 2013

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21478

zbMATH Keywords

vehicle routingworst-case analysisapproximation algorithmsprinted circuit board

Mathematics Subject Classification ID

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

Related Items (1)

A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Improved bounds for vehicle routing solutions
• Heuristics for the traveling salesman problem with pickup and delivery
• Container terminal operation and operations research -- a classification and literature review
• The traveling salesman problem and its variations
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• Bounds and Heuristics for Capacitated Routing Problems
• Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
• A Location Based Heuristic for General Routing Problems
• PCB assembly scheduling for collect-and-place machines using genetic algorithms
• Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows

This page was built for publication: Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems