Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
DOI10.1002/NET.21478zbMATH Open1269.90016OpenAlexW1978225647WikidataQ125269250 ScholiaQ125269250MaRDI QIDQ5326795FDOQ5326795
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
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
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- The traveling salesman problem and its variations
- PCB assembly scheduling for collect-and-place machines using genetic algorithms
- Container terminal operation and operations research -- a classification and literature review
- Bounds and Heuristics for Capacitated Routing Problems
- Improved bounds for vehicle routing solutions
- A Location Based Heuristic for General Routing Problems
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Heuristics for the traveling salesman problem with pickup and delivery
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
- Title not available (Why is that?)
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
Cited In (4)
- Title not available (Why is that?)
- A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines
- Chain partitioning as a key element for building vehicle routing problem heuristics
- On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem
Uses Software
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)
