Preemptive stacker crane problem: extending tree-based properties and construction heuristics

DOI10.1016/J.EJOR.2020.10.051zbMath1487.90106OpenAlexW3095912917MaRDI QIDQ2030604

Benjamin Graf

Publication date: 7 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.10.051

zbMATH Keywords

routingpreemptionstacker crane problemconstruction heuristics

Mathematics Subject Classification ID

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

Uses Software

• Concorde
• LEMON

Cites Work

• Models for the single-vehicle preemptive pickup and delivery problem
• Heuristics for the mixed swapping problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Tree based heuristics for the preemptive asymmetric stacker crane problem
• A branch-and-cut algorithm for the preemptive swapping problem
• The preemptive swapping problem on a tree
• Nonpreemptive Ensemble Motion Planning on a Tree
• Integer Programming Formulation of Traveling Salesman Problems
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• The swapping problem
• Preemptive Ensemble Motion Planning on a Tree
• The Swapping Problem on a Line
• The General Pickup and Delivery Problem
• Construction heuristics for the asymmetric TSP.

This page was built for publication: Preemptive stacker crane problem: extending tree-based properties and construction heuristics