Are stacker crane problems easy?
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 o...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | article |
| منشور في: |
2013
|
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/2294 http://dx.doi.org/10.1016/j.cor.2011.06.017 http://www.sciencedirect.com/science/article/pii/S0305054811001791 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513457883185152 |
|---|---|
| author | Srour, F. Jordan |
| author2 | Van De Velde, Steef |
| author2_role | author |
| author_facet | Srour, F. Jordan Van De Velde, Steef |
| author_role | author |
| dc.creator.none.fl_str_mv | Srour, F. Jordan Van De Velde, Steef |
| dc.date.none.fl_str_mv | 2013 2015-10-21T07:30:31Z 2015-10-21T07:30:31Z 2015-10-21 |
| dc.identifier.none.fl_str_mv | 0305-0548 http://hdl.handle.net/10725/2294 http://dx.doi.org/10.1016/j.cor.2011.06.017 Srour, F. J., & Van De Velde, S. (2013). Are stacker crane problems easy? A statistical study. Computers & Operations Research, 40(3), 674-690. http://www.sciencedirect.com/science/article/pii/S0305054811001791 |
| dc.language.none.fl_str_mv | en |
| dc.relation.none.fl_str_mv | Computers & Operations Research |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.title.none.fl_str_mv | Are stacker crane problems easy? a statistical study |
| dc.type.none.fl_str_mv | Article info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | 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. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | LAURepo_e196af6dc9e5f9e59bcdf6d30d40f994 |
| identifier_str_mv | 0305-0548 Srour, F. J., & Van De Velde, S. (2013). Are stacker crane problems easy? A statistical study. Computers & Operations Research, 40(3), 674-690. |
| language_invalid_str_mv | en |
| network_acronym_str | LAURepo |
| network_name_str | Lebanese American University repository |
| oai_identifier_str | oai:laur.lau.edu.lb:10725/2294 |
| publishDate | 2013 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Are stacker crane problems easy?a statistical studySrour, F. JordanVan De Velde, SteefMany 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.PublishedN/A2015-10-21T07:30:31Z2015-10-21T07:30:31Z20132015-10-21Articleinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article0305-0548http://hdl.handle.net/10725/2294http://dx.doi.org/10.1016/j.cor.2011.06.017Srour, F. J., & Van De Velde, S. (2013). Are stacker crane problems easy? A statistical study. Computers & Operations Research, 40(3), 674-690.http://www.sciencedirect.com/science/article/pii/S0305054811001791enComputers & Operations Researchinfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/22942023-05-18T13:31:43Z |
| spellingShingle | Are stacker crane problems easy? Srour, F. Jordan |
| status_str | publishedVersion |
| title | Are stacker crane problems easy? |
| title_full | Are stacker crane problems easy? |
| title_fullStr | Are stacker crane problems easy? |
| title_full_unstemmed | Are stacker crane problems easy? |
| title_short | Are stacker crane problems easy? |
| title_sort | Are stacker crane problems easy? |
| url | http://hdl.handle.net/10725/2294 http://dx.doi.org/10.1016/j.cor.2011.06.017 http://www.sciencedirect.com/science/article/pii/S0305054811001791 |