.

Are stacker crane problems easy?

LAUR Repository

Show simple item record

dc.contributor.author Srour, F. Jordan
dc.contributor.author Van De Velde, Steef
dc.date.accessioned 2015-10-21T07:30:31Z
dc.date.available 2015-10-21T07:30:31Z
dc.date.copyright 2013-03
dc.date.issued 2015-10-21
dc.identifier.issn 0305-0548 en_US
dc.identifier.uri http://hdl.handle.net/10725/2294
dc.description.abstract Many full truckload pick-up and delivery problems in the intermodal freight container transport industry can be modeled as Asymmetric Traveling Salesman Problems (ATSPs). Several authors have noted that while ATSPs are NP-hard, some instances are readily solved to optimality in only a short amount of time. Furthermore, the literature contains several references to the Stacker Crane Problem (SCP) as an “easy” problem amidst the ATSPs. We put this hypothesis to test by using statistical methods to build a model relating measurable distance matrix structures to the amount of time required by two existing exact solvers in finding solutions to over 500 ATSP instances. From this analysis we conclude that SCPs are not necessarily easier than other ATSPs, but a special subset of SCPs, termed drayage problems, are more readily solved. We speculate that drayage problems are “easy” because of a comparatively high number of zeros in symmetric locations within the distance matrix. In real-world drayage problems (i.e. the movement of containers a short distance to/from a port or rail terminal), these zeros correspond to the prevalence of jobs originating at or destined to a fixed number of freight terminals. en_US
dc.language.iso en en_US
dc.title Are stacker crane problems easy? en_US
dc.type Article en_US
dc.description.version Published en_US
dc.title.subtitle a statistical study en_US
dc.author.school SOB en_US
dc.author.idnumber 201204645 en_US
dc.author.woa N/A en_US
dc.author.department Inform. Tech. and Operat. Mgmt. en_US
dc.description.embargo N/A en_US
dc.relation.journal Computers & Operations Research en_US
dc.journal.volume 40 en_US
dc.journal.issue 3 en_US
dc.article.pages 674–690 en_US
dc.keywords Drayage en_US
dc.keywords Intermodal freight en_US
dc.keywords Asymmetric Traveling Salesman Problem en_US
dc.keywords Traveling Salesman Problem en_US
dc.keywords Stacker Crane Problem en_US
dc.keywords Statistical analysis of algorithms en_US
dc.identifier.doi http://dx.doi.org/10.1016/j.cor.2011.06.017 en_US
dc.identifier.ctation Srour, F. J., & Van De Velde, S. (2013). Are stacker crane problems easy? A statistical study. Computers & Operations Research, 40(3), 674-690. en_US
dc.author.email jordan.srour@lau.edu.lb
dc.identifier.url http://www.sciencedirect.com/science/article/pii/S0305054811001791
dc.orcid.id https://orcid.org/0000-0001-7623-723X en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search LAUR


Advanced Search

Browse

My Account