The stacker crane problem and the directed general routing problem

DOI10.1002/NET.21591MaRDI QIDQ4642462zbMATH OpenOpenAlexFDO

Authors Thais Ávila, Ángel Corberán, Isaac Plana, José M. Sanchis

Publication date 23 May 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10251/99717

zbMATH Keywords

branch-and-cut algorithmdirected general routing problemdirected rural postman problemstacker crane problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Approximation algorithms for the generalized stacker crane problem
• Approximation algorithms for multi-vehicle stacker crane problems
• Routing two stacking cranes with predetermined container sequences
• Approximation algorithms for some min-max and minimum stacker crane cover problems
• Approximation algorithms for some min-max and minimum stacker crane cover problems
• Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems
• Exact algorithms for the double vehicle routing problem with multiple stacks
• Algorithms and Computation
• A heuristic for the Stacker Crane Problem on trees which is almost surely exact
• Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations

Cited in

(17)

• Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems
• Approximation algorithms for the generalized stacker crane problem
• The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
• The directed profitable rural postman problem with incompatibility constraints
• Preemptive stacker crane problem: extending tree-based properties and construction heuristics
• The min-max close-enough arc routing problem
• The profitable close-enough arc routing problem
• Approximation algorithms for multi-vehicle stacker crane problems
• Tree based models and algorithms for the preemptive asymmetric stacker crane problem
• An ILS-based metaheuristic for the Stacker Crane problem
• Are stacker crane problems easy? A statistical study
• A branch-and-cut algorithm for the orienteering arc routing problem
• Algorithms and Computation
• Approximation algorithms for some min-max and minimum stacker crane cover problems
• Modeling and solving the endpoint cutting problem
• Constructing the first (and coolest) fixed-content universal cycle
• An updated annotated bibliography on arc routing problems

This page was built for publication: The stacker crane problem and the directed general routing problem

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