Approximating split delivery path routing problems

DOI10.1007/S10957-025-02890-3MaRDI QIDQ6866230zbMATH OpenFDO

Authors Jun Wu, Feng Chu, Zhen Yang, Yongxi Cheng

Publication date 29 January 2026

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-025-02890-3

zbMATH Keywords

parameterized approximation algorithmpath routing problemsplit delivery

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Programming involving graphs or networks (90C35)

Cites work

• A 1.5-approximation for path TSP
• A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints
• A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
• A heuristic method for the open vehicle routing problem
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
• A multi-start algorithm for a balanced real-world open vehicle routing problem
• A new tabu search heuristic for the open vehicle routing problem
• An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
• An Approximation Algorithm for k-Depot Split Delivery Vehicle Routing Problem
• An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem
• An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
• An improved formulation for the multi-depot open vehicle routing problem
• An optimization model for freight transport using urban rail transit
• Analysis of Christofides' heuristic: some paths are more difficult than cycles
• Approximating the multiple-depot multiple-terminal Hamiltonian path problem
• Approximation algorithms for multiple terminal, Hamiltonian path problems
• Approximation algorithms for the \(k\)-depots Hamiltonian path problem
• Fixed-Parameter and Approximation Algorithms: A New Look
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• Parametrized complexity theory.
• Savings by Split Delivery Routing
• Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
• The open vehicle routing problem with decoupling points
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• The truck dispatching problem
• Vehicle Routing
• Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems

This page was built for publication: Approximating split delivery path routing problems

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