G. Laporte , Y. Nobert , S. Taillefer
{"title":"A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem","authors":"G. Laporte , Y. Nobert , S. Taillefer","doi":"10.1016/0270-0255(87)90004-2","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":100895,"journal":{"name":"Mathematical Modelling","volume":"9 12","pages":"857-868"},"PeriodicalIF":0.0000,"publicationDate":"1987-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0270-0255(87)90004-2","citationCount":"52","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Modelling","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0270025587900042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 52
非对称距离约束车辆路径问题的分枝定界算法
本文的目的是为不对称距离限制车辆路由问题开发精确算法。该问题通过分支和绑定树解决,其中的子问题被修改。分配问题受某些限制。报告了涉及100个节点的问题的计算结果。本文描述了具有时间约束和不对称距离矩阵的路由问题的精确算法。该问题通过分支和绑定树解决,其中子问题是广义分配问题。给出了仅包含100个交付点的问题的数值结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。