异构卡车运输问题的价格-分支算法

Q2 Mathematics

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI:10.1016/j.endm.2018.07.031

Ali Ghezelsoflu, Massimo Di Francesco, Paola Zuddas, Antonio Frangioni

{"title":"异构卡车运输问题的价格-分支算法","authors":"Ali Ghezelsoflu, Massimo Di Francesco, Paola Zuddas, Antonio Frangioni","doi":"10.1016/j.endm.2018.07.031","DOIUrl":null,"url":null,"abstract":"<div><p>This paper investigates a drayage problem, which is motivated by a carrier providing <em>door-to-door</em> freight transportation services by trucks and containers. The trucks carry one or two containers to ship container loads from a port to importers and from exporters to the same port. The problem is modeled by a set covering formulation with integer variables. We propose a Price-and-Branch algorithm for this problem, in which the pricing problem is a pair of shortest path problems, one for each truck type, in a suitable graph. The algorithm can determine near-optimal solutions in a short time.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.031","citationCount":"1","resultStr":"{\"title\":\"A Price-and-Branch algorithm for a drayage problem with heterogeneous trucks\",\"authors\":\"Ali Ghezelsoflu, Massimo Di Francesco, Paola Zuddas, Antonio Frangioni\",\"doi\":\"10.1016/j.endm.2018.07.031\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper investigates a drayage problem, which is motivated by a carrier providing <em>door-to-door</em> freight transportation services by trucks and containers. The trucks carry one or two containers to ship container loads from a port to importers and from exporters to the same port. The problem is modeled by a set covering formulation with integer variables. We propose a Price-and-Branch algorithm for this problem, in which the pricing problem is a pair of shortest path problems, one for each truck type, in a suitable graph. The algorithm can determine near-optimal solutions in a short time.</p></div>\",\"PeriodicalId\":35408,\"journal\":{\"name\":\"Electronic Notes in Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.031\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571065318301756\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318301756","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 1

摘要

本文研究了一个运输问题，其动机是承运人提供门到门的货物运输服务的卡车和集装箱。卡车装载一个或两个集装箱，将集装箱货物从一个港口运往进口商，从出口商运往同一港口。该问题采用整数变量集覆盖公式进行建模。针对这一问题，我们提出了一个Price-and-Branch算法，其中定价问题是一对最短路径问题，每一种卡车类型对应一个最短路径问题，在一个合适的图中。该算法可以在短时间内确定近似最优解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Price-and-Branch algorithm for a drayage problem with heterogeneous trucks

This paper investigates a drayage problem, which is motivated by a carrier providing door-to-door freight transportation services by trucks and containers. The trucks carry one or two containers to ship container loads from a port to importers and from exporters to the same port. The problem is modeled by a set covering formulation with integer variables. We propose a Price-and-Branch algorithm for this problem, in which the pricing problem is a pair of shortest path problems, one for each truck type, in a suitable graph. The algorithm can determine near-optimal solutions in a short time.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.