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

DOI10.1002/NET.21478MaRDI QIDQ5326795zbMATH OpenOpenAlexWikidataFDO

Authors Anupam Seth, Diego Klabjan, P. 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

approximation algorithmsprinted circuit boardvehicle routingworst-case analysis

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4066603
• Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
• A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands
• On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
• Parallel iterative search methods for vehicle routing problems

Cites work

• scientific article; zbMATH DE number 1128820 (Why is no real title available?)
• scientific article; zbMATH DE number 2064416 (Why is no real title available?)
• A Location Based Heuristic for General Routing Problems
• A note on two problems in connexion with graphs
• Bounds and Heuristics for Capacitated Routing Problems
• Container terminal operation and operations research -- a classification and literature review
• Heuristics for the traveling salesman problem with pickup and delivery
• Improved bounds for vehicle routing solutions
• PCB assembly scheduling for collect-and-place machines using genetic algorithms
• Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• The traveling salesman problem and its variations
• Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems

Cited in

(4)

• Chain partitioning as a key element for building vehicle routing problem heuristics
• scientific article; zbMATH DE number 4066603 (Why is no real title available?)
• On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
• A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines

Describes a project that uses

Uses Software

• Concorde

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

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