Abstract
Two O( mod V mod /sup 2/) heuristics are presented for the stacker crane problem (SCP) and its variant, the k-stacker crane problem (k-SCP), both originating from the traveling salesman problem, where V stands for a set of cities to be visited. One heuristic not only is simpler than those of G. N. Frederickson et al. (1978) for SCP with the complexity of an O( mod V mod /sup 3/) time bound, but also provides a worst-case guarantee of twice the optimal solution for this problem, which results from one of Frederickson's. The other heuristic is the first for k-SCP with the object of minimizing the total length of k stacker crane tours. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
