{"title":"海港泊位堆场资源配置的数学模型与算法","authors":"Ming Liu, Zhihui Sun, Xiaoning Zhang","doi":"10.1109/ICSSSM.2017.7996122","DOIUrl":null,"url":null,"abstract":"We study a deterministic container transportation problem, jointly optimizing the berth allocation, quay crane assignment and yard storage allocation at container ports. The problem is formulated as an integer program to coordinate the decisions. To solve this large-scale problem, we then transform it into a set partitioning formulation, and provide a framework of branch-and-price algorithm.","PeriodicalId":239892,"journal":{"name":"2017 International Conference on Service Systems and Service Management","volume":"210 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Mathematical model and algorithm for the berth and yard resource allocation at seaports\",\"authors\":\"Ming Liu, Zhihui Sun, Xiaoning Zhang\",\"doi\":\"10.1109/ICSSSM.2017.7996122\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study a deterministic container transportation problem, jointly optimizing the berth allocation, quay crane assignment and yard storage allocation at container ports. The problem is formulated as an integer program to coordinate the decisions. To solve this large-scale problem, we then transform it into a set partitioning formulation, and provide a framework of branch-and-price algorithm.\",\"PeriodicalId\":239892,\"journal\":{\"name\":\"2017 International Conference on Service Systems and Service Management\",\"volume\":\"210 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Service Systems and Service Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSSSM.2017.7996122\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Service Systems and Service Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSSSM.2017.7996122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Mathematical model and algorithm for the berth and yard resource allocation at seaports
We study a deterministic container transportation problem, jointly optimizing the berth allocation, quay crane assignment and yard storage allocation at container ports. The problem is formulated as an integer program to coordinate the decisions. To solve this large-scale problem, we then transform it into a set partitioning formulation, and provide a framework of branch-and-price algorithm.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
