三层物流网络选址—路径优化及混合启发式算法研究
为同时解决转运、分配、选址和车辆路径问题,在考虑车辆载重和行驶距离约束、配送中心处理能力约束的基础上,构建了一个多产品三层物流网络选址—路径模型,以总成本最小为目标,提出一种基于贪婪随机自适应搜索算法和里程节约算法的混合启发式算法,给出了该算法的步骤和伪代码。实验结果表明,该算法具有可行性,并且与其他算法比较而言,算法具有高效性。...
Saved in:
| Published in | 计算机应用研究 Vol. 34; no. 8; pp. 2349 - 2354 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
九江学院 电子商务学院,江西 九江,332005
2017
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1001-3695 |
| DOI | 10.3969/j.issn.1001-3695.2017.08.026 |
Cover
| Abstract | 为同时解决转运、分配、选址和车辆路径问题,在考虑车辆载重和行驶距离约束、配送中心处理能力约束的基础上,构建了一个多产品三层物流网络选址—路径模型,以总成本最小为目标,提出一种基于贪婪随机自适应搜索算法和里程节约算法的混合启发式算法,给出了该算法的步骤和伪代码。实验结果表明,该算法具有可行性,并且与其他算法比较而言,算法具有高效性。 |
|---|---|
| AbstractList | 为同时解决转运、分配、选址和车辆路径问题,在考虑车辆载重和行驶距离约束、配送中心处理能力约束的基础上,构建了一个多产品三层物流网络选址—路径模型,以总成本最小为目标,提出一种基于贪婪随机自适应搜索算法和里程节约算法的混合启发式算法,给出了该算法的步骤和伪代码。实验结果表明,该算法具有可行性,并且与其他算法比较而言,算法具有高效性。 TP301.6; 为同时解决转运、分配、选址和车辆路径问题,在考虑车辆载重和行驶距离约束、配送中心处理能力约束的基础上,构建了一个多产品三层物流网络选址-路径模型,以总成本最小为目标,提出一种基于贪婪随机自适应搜索算法和里程节约算法的混合启发式算法,给出了该算法的步骤和伪代码.实验结果表明,该算法具有可行性,并且与其他算法比较而言,算法具有高效性. |
| Abstract_FL | This paper put forward a location-routing model for multi-product three-layer logistics network of three layers in consideration of loads and distance constraints of vehicles, processing capacity constraint of distribution centers to deal with the transshipment, distribution, location and vehicle routing problem simultaneously.In order to minimize the total costs,it proposed a hybrid heuristic algorithm which integrated a greedy randomized adaptive search algorithm with saving algorithm.In addition,it gave the steps and pseudo codes of this algorithm.The experimental results show that the proposed algorithm is feasible and the algorithm has high efficiency compared with other algorithms. |
| Author | 戴卓 |
| AuthorAffiliation | 九江学院电子商务学院,江西九江332005 |
| AuthorAffiliation_xml | – name: 九江学院 电子商务学院,江西 九江,332005 |
| Author_FL | Dai Zhuo |
| Author_FL_xml | – sequence: 1 fullname: Dai Zhuo |
| Author_xml | – sequence: 1 fullname: 戴卓 |
| BookMark | eNo9j01LAkEcxudgkFpfIjp02e2_M-7MzjHEXkDo4l1md2fNpcZyidibRYeMQAV7ORR09ZJElEHWhwnHrW_RhtHpgYcfz8MvhzKqoSRCyxaYhFO-Gpr1KFKmBWAZhHLbxGAxExwTMM2g7H8_j3JRFAIUsMUhi0qT17Z-PEnag-nzcfLeS95uv1ttfdf6bPW_RkP9cToZ3-iLK905n45Gunumu0Pd6elxJ3m4nj5dJvf9ZPCygOYCsRvJxb_Mo8p6qVLcNMrbG1vFtbLhUaAGsbHkmAvXYVx6vu85TEruYl8Ql3DiBkA84lsFygJiC0mZF7i-YI6NuV8g2CV5tDKbPRIqEKpWDRuHTZUeVsMojOM4_HUGJzVO0aUZ6u00VO2gnsL7zfqeaMZVyjADGxxKfgAKvXUv |
| ClassificationCodes | TP301.6 |
| ContentType | Journal Article |
| Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 2RA 92L CQIGP W92 ~WA 2B. 4A8 92I 93N PSX TCJ |
| DOI | 10.3969/j.issn.1001-3695.2017.08.026 |
| DatabaseName | 维普_期刊 中文科技期刊数据库-CALIS站点 维普中文期刊数据库 中文科技期刊数据库-工程技术 中文科技期刊数据库- 镜像站点 Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| DocumentTitleAlternate | Study on optimization and hybrid heuristic algorithm for location-routing of three-layer logistics network |
| DocumentTitle_FL | Study on optimization and hybrid heuristic algorithm forlocation-routing of three-layer logistics network |
| EndPage | 2354 |
| ExternalDocumentID | jsjyyyj201708026 672705086 |
| GrantInformation_xml | – fundername: 江西高校人文社会科学研究项目; 国家自然科学基金资助项目 funderid: (JJ1541); (71462020) |
| GroupedDBID | -0Y 2B. 2C0 2RA 5XA 5XJ 92H 92I 92L ACGFS ALMA_UNASSIGNED_HOLDINGS CCEZO CQIGP CUBFJ CW9 TCJ TGT U1G U5S W92 ~WA 4A8 93N ABJNI PSX |
| ID | FETCH-LOGICAL-c606-352e929ab879ecddc87ee9b2da3b393bf03c3d1467f35ae67cfbda78529d432b3 |
| ISSN | 1001-3695 |
| IngestDate | Thu May 29 03:54:51 EDT 2025 Wed Feb 14 09:59:56 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 8 |
| Keywords | 三层物流网络 location-routing three-layer logistics network optimization 优化 混合启发式算法 选址路径 hybrid heuristic algorithm |
| Language | Chinese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c606-352e929ab879ecddc87ee9b2da3b393bf03c3d1467f35ae67cfbda78529d432b3 |
| Notes | 51-1196/TP three-layer logistics network; location-routing; optimization; hybrid heuristic algorithm Dai Zhuo （School of Electronic Commerce, Jiujiang University, Jiujiang Jiangxi 332005, China） This paper put forward a location-routing model for multi-product three-layer logistics network of three layers in consideration of loads and distance constraints of vehicles, processing capacity constraint of distribution centers to deal with the transshipment, distribution, location and vehicle routing problem simultaneously. In order to minimize the total costs, it pro- posed a hybrid heuristic algorithm which integrated a greedy randomized adaptive search algorithm with saving algorithm. In addition, it gave the steps and pseudo codes of this algorithm. The experimental results show that the proposed algorithm is fea- sible and the algorithm has high efficiency compared with other algorithms. |
| PageCount | 6 |
| ParticipantIDs | wanfang_journals_jsjyyyj201708026 chongqing_primary_672705086 |
| PublicationCentury | 2000 |
| PublicationDate | 2017 |
| PublicationDateYYYYMMDD | 2017-01-01 |
| PublicationDate_xml | – year: 2017 text: 2017 |
| PublicationDecade | 2010 |
| PublicationTitle | 计算机应用研究 |
| PublicationTitleAlternate | Application Research of Computers |
| PublicationTitle_FL | Application Research of Computers |
| PublicationYear | 2017 |
| Publisher | 九江学院 电子商务学院,江西 九江,332005 |
| Publisher_xml | – name: 九江学院 电子商务学院,江西 九江,332005 |
| SSID | ssj0042190 ssib001102940 ssib002263599 ssib023646305 ssib051375744 ssib025702191 |
| Score | 2.086243 |
| Snippet | 为同时解决转运、分配、选址和车辆路径问题,在考虑车辆载重和行驶距离约束、配送中心处理能力约束的基础上,构建了一个多产品三层物流网络选址—路径模型,以总成本最小为目标,... TP301.6; 为同时解决转运、分配、选址和车辆路径问题,在考虑车辆载重和行驶距离约束、配送中心处理能力约束的基础上,构建了一个多产品三层物流网络选址-路径模型,以总成本最... |
| SourceID | wanfang chongqing |
| SourceType | Aggregation Database Publisher |
| StartPage | 2349 |
| SubjectTerms | 三层物流网络 优化 混合启发式算法 选址路径 |
| Title | 三层物流网络选址—路径优化及混合启发式算法研究 |
| URI | http://lib.cqvip.com/qk/93231X/201708/672705086.html https://d.wanfangdata.com.cn/periodical/jsjyyyj201708026 |
| Volume | 34 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate issn: 1001-3695 databaseCode: ABDBF dateStart: 20130901 customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn isFulltext: true dateEnd: 99991231 titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn omitProxy: true ssIdentifier: ssib025702191 providerName: EBSCOhost |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnR1NaxQxNPQDxIvfYq1KheZUpu5OkpnkOLM7SxH0VKG3ZT5betiqbQ_tqYoHK0Jb8Oug4LUXi4hWsPprOl39F76XpNtxqaLCMrzN5L28j0zeS0heCBnP67VMFlnqxDwvHJ4U3EnAbzuJH9djBbPtwsXDybdue1N3-M0ZMTMw2KjsWlpeSibT1WPPlfyPVaEM7IqnZP_Bsj2iUAAw2BeeYGF4_pWNacRpKKlUNBI0rFPp0sjHvwGUeDQUECdiSdikygAhVQ0aKdzfYLBUE2CHRpKGPg1amlBEJdekG1RJLJEAeBpoURlo0j7-EB8ISQsYdKiDjQlEBxhaDSKqfI3FqBK6pEYV14CioVcNkJETqB_Uf0EEpsNA0wwsIjwD-RtS0H8QCfgKueYIxGfV5Q1zjlN3RS2nQjUgf3WqtAxBkwYe6kmBLt0J2yDo07wDWVFioGy0Emh--9Gg91aIgljAfmvimAbdBmO47FZxELgFjXnmYtBDD2KXY82XIqvugJl8rDa0cJlJmN3vtpjylHZb2MRkrwnceOjrBLNuX7ZwHX_ML86vrKzMYyU8MO0NkmEXF6WGyHAQNsPWUVQMQWQ1S6KLCYiOZqF4hYBXGfbxXkPwY71hX9SZL_QlCSbA4fDSJPmwfJ4g41aIG38SAbOXzC10Zu9BTKaPyHWKuDNbieamz5BTdho2Fphv6iwZWJ07R04fXnEyZj3eedLY_7xevn_YXd8--Pig-3Wr--X1j7X18s2a8313p_z2aH_vVfn0Rbnx5GB3t9x8XG7ulBtb5d5G993Lgw_Pu2-fdbc_XSDTrWi6MeXYe0ec1MOdoMLNYdIQJ9JXeZplqfTzXCVuFrOEKZYUNZayDCOMgok49_y0SLLYl8JVGWduwi6Soc5CJ79ExuIaLwovyeOYC65qWSxymQpWxKnI3STlI2S0p5L2XZNepo17I2owb_JGyHWrpLYddBbb_Ua__Bd1RslJhM3C4RUytHR_Ob8KofRScs12lZ-DoJ6D |
| linkProvider | EBSCOhost |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E4%B8%89%E5%B1%82%E7%89%A9%E6%B5%81%E7%BD%91%E7%BB%9C%E9%80%89%E5%9D%80-%E8%B7%AF%E5%BE%84%E4%BC%98%E5%8C%96%E5%8F%8A%E6%B7%B7%E5%90%88%E5%90%AF%E5%8F%91%E5%BC%8F%E7%AE%97%E6%B3%95%E7%A0%94%E7%A9%B6&rft.jtitle=%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%BA%94%E7%94%A8%E7%A0%94%E7%A9%B6&rft.au=%E6%88%B4%E5%8D%93&rft.date=2017&rft.pub=%E4%B9%9D%E6%B1%9F%E5%AD%A6%E9%99%A2+%E7%94%B5%E5%AD%90%E5%95%86%E5%8A%A1%E5%AD%A6%E9%99%A2%2C%E6%B1%9F%E8%A5%BF+%E4%B9%9D%E6%B1%9F%2C332005&rft.issn=1001-3695&rft.volume=34&rft.issue=8&rft.spage=2349&rft.epage=2354&rft_id=info:doi/10.3969%2Fj.issn.1001-3695.2017.08.026&rft.externalDocID=jsjyyyj201708026 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F93231X%2F93231X.jpg http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fjsjyyyj%2Fjsjyyyj.jpg |