{"title":"基于禁忌搜索的货物排序和码头分配问题","authors":"Jingjing Tong, H. Nachtmann","doi":"10.1504/ijstl.2020.10028342","DOIUrl":null,"url":null,"abstract":"To mitigate inland waterway disruption impacts, we develop a tabu search (TS) approach to solve the cargo prioritisation and terminal allocation problem (CPTAP) to minimise the total value loss of disrupted barge cargoes by offloading the cargoes to the land transportation modes. CPTAP is formulated as a nonlinear binary integer program, and problems of realistic size can be efficiently and effectively solved with an efficient heuristic approach. Given different neighbourhood structures, multiple TS variants are attempted and compared. Solving CPTAP with our TS heuristic leads to the lowest cargo value loss and the shortest response time for the disrupted barges compared to a genetic algorithm approach and a na","PeriodicalId":45963,"journal":{"name":"International Journal of Shipping and Transport Logistics","volume":" ","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2020-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A tabu search approach to the cargo prioritisation and terminal allocation problem\",\"authors\":\"Jingjing Tong, H. Nachtmann\",\"doi\":\"10.1504/ijstl.2020.10028342\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To mitigate inland waterway disruption impacts, we develop a tabu search (TS) approach to solve the cargo prioritisation and terminal allocation problem (CPTAP) to minimise the total value loss of disrupted barge cargoes by offloading the cargoes to the land transportation modes. CPTAP is formulated as a nonlinear binary integer program, and problems of realistic size can be efficiently and effectively solved with an efficient heuristic approach. Given different neighbourhood structures, multiple TS variants are attempted and compared. Solving CPTAP with our TS heuristic leads to the lowest cargo value loss and the shortest response time for the disrupted barges compared to a genetic algorithm approach and a na\",\"PeriodicalId\":45963,\"journal\":{\"name\":\"International Journal of Shipping and Transport Logistics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2020-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Shipping and Transport Logistics\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1504/ijstl.2020.10028342\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Shipping and Transport Logistics","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1504/ijstl.2020.10028342","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MANAGEMENT","Score":null,"Total":0}
A tabu search approach to the cargo prioritisation and terminal allocation problem
To mitigate inland waterway disruption impacts, we develop a tabu search (TS) approach to solve the cargo prioritisation and terminal allocation problem (CPTAP) to minimise the total value loss of disrupted barge cargoes by offloading the cargoes to the land transportation modes. CPTAP is formulated as a nonlinear binary integer program, and problems of realistic size can be efficiently and effectively solved with an efficient heuristic approach. Given different neighbourhood structures, multiple TS variants are attempted and compared. Solving CPTAP with our TS heuristic leads to the lowest cargo value loss and the shortest response time for the disrupted barges compared to a genetic algorithm approach and a na