Approximation algorithms for multi-vehicle stacker crane problems

DOI10.1007/s40305-021-00372-7OpenAlexW4205711205MaRDI QIDQ2687683

Wei Yu, Zhaohui Liu, Rui-Yong Dai

Publication date: 7 March 2023

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-021-00372-7

zbMATH Keywords

approximation algorithmvehicle routing problempickup and delivery problemstacker crane problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (1)

Approximation algorithms for some min-max and minimum stacker crane cover problems

Cites Work

• Unnamed Item
• Unnamed Item
• An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
• \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
• An effective and fast heuristic for the dial-a-ride problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
• Nonpreemptive Ensemble Motion Planning on a Tree
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• An Approximation Algorithm for the Three Depots Hamiltonian Path Problem
• Arc Routing Problems, Part I: The Chinese Postman Problem
• An optimal algorithm for the mixed Chinese postman problem
• Approximations for minimum and min-max vehicle routing problems
• Combinatorial optimization. Theory and algorithms

This page was built for publication: Approximation algorithms for multi-vehicle stacker crane problems