多目标问题聚类控制及其在电子商务中的应用

Liang Chen, Xingwei Wang, Jinwen Shi
{"title":"多目标问题聚类控制及其在电子商务中的应用","authors":"Liang Chen, Xingwei Wang, Jinwen Shi","doi":"10.5430/IJRC.V1N1P41","DOIUrl":null,"url":null,"abstract":"In the existing logistics distribution methods, the demand of customers is not considered. The goal of these methods is to maximize the vehicle capacity, which leads to the total distance of vehicles to be too long, the need for large numbers of vehicles and high transportation costs. To address these problems, a method of multi-objective clustering of logistics distribution route based on hybrid ant colony algorithm is proposed in this paper. Before choosing the distribution route, the customers are assigned to the unknown types according to a lot of customers attributes so as to reduce the scale of the solution. The discrete point location model is applied to logistics distribution area to reduce the cost of transportation. A mathematical model of multi-objective logistics distribution routing problem is built with consideration of constraints of the capacity, transportation distance, and time window, and a hybrid ant colony algorithm is used to solve the problem. Experimental results show that, the optimized route is more desirable, which can save the cost of transportation, reduce the time loss in the process of circulation, and effectively improve the quality of logistics distribution service.","PeriodicalId":448095,"journal":{"name":"International Journal of Robotics and Control","volume":"419 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Clustering Control of Multi-Objective Problems with Application to E-commerce\",\"authors\":\"Liang Chen, Xingwei Wang, Jinwen Shi\",\"doi\":\"10.5430/IJRC.V1N1P41\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the existing logistics distribution methods, the demand of customers is not considered. The goal of these methods is to maximize the vehicle capacity, which leads to the total distance of vehicles to be too long, the need for large numbers of vehicles and high transportation costs. To address these problems, a method of multi-objective clustering of logistics distribution route based on hybrid ant colony algorithm is proposed in this paper. Before choosing the distribution route, the customers are assigned to the unknown types according to a lot of customers attributes so as to reduce the scale of the solution. The discrete point location model is applied to logistics distribution area to reduce the cost of transportation. A mathematical model of multi-objective logistics distribution routing problem is built with consideration of constraints of the capacity, transportation distance, and time window, and a hybrid ant colony algorithm is used to solve the problem. Experimental results show that, the optimized route is more desirable, which can save the cost of transportation, reduce the time loss in the process of circulation, and effectively improve the quality of logistics distribution service.\",\"PeriodicalId\":448095,\"journal\":{\"name\":\"International Journal of Robotics and Control\",\"volume\":\"419 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Robotics and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5430/IJRC.V1N1P41\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Robotics and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5430/IJRC.V1N1P41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在现有的物流配送方式中,没有考虑到顾客的需求。这些方法的目标是使车辆容量最大化,这导致车辆总距离过长,需要大量车辆,运输成本高。针对这些问题,本文提出了一种基于混合蚁群算法的物流配送路径多目标聚类方法。在选择分销路线之前,根据大量客户属性将客户分配到未知类型,以减小解决方案的规模。将离散点定位模型应用于物流配送区域,以降低运输成本。建立了考虑容量、运输距离和时间窗约束的多目标物流配送路径问题数学模型,并采用混合蚁群算法求解该问题。实验结果表明,优化后的路线更加理想,可以节省运输成本,减少流通过程中的时间损失,有效提高物流配送服务质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Clustering Control of Multi-Objective Problems with Application to E-commerce
In the existing logistics distribution methods, the demand of customers is not considered. The goal of these methods is to maximize the vehicle capacity, which leads to the total distance of vehicles to be too long, the need for large numbers of vehicles and high transportation costs. To address these problems, a method of multi-objective clustering of logistics distribution route based on hybrid ant colony algorithm is proposed in this paper. Before choosing the distribution route, the customers are assigned to the unknown types according to a lot of customers attributes so as to reduce the scale of the solution. The discrete point location model is applied to logistics distribution area to reduce the cost of transportation. A mathematical model of multi-objective logistics distribution routing problem is built with consideration of constraints of the capacity, transportation distance, and time window, and a hybrid ant colony algorithm is used to solve the problem. Experimental results show that, the optimized route is more desirable, which can save the cost of transportation, reduce the time loss in the process of circulation, and effectively improve the quality of logistics distribution service.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信