GENETIC ALGORITHM FOR THE CONTINUOUS LOCATION-ROUTING PROBLEM

IF 0.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Neural Network World Pub Date : 2019-01-01 DOI:10.14311/nnw.2019.29.012
Alena Rybičková, D. Mocková, D. Teichmann
{"title":"GENETIC ALGORITHM FOR THE CONTINUOUS LOCATION-ROUTING PROBLEM","authors":"Alena Rybičková, D. Mocková, D. Teichmann","doi":"10.14311/nnw.2019.29.012","DOIUrl":null,"url":null,"abstract":"This paper focuses on the continuous location-routing problem that comprises of the location of multiple depots from a given region and determining the routes of vehicles assigned to these depots. The objective of the problem is to design the delivery system of depots and routes so that the total cost is minimal. The standard location-routing problem considers a finite number of possible locations. The continuous location-routing problem allows location to infinite number of locations in a given region and makes the problem much more complex. We present a genetic algorithm that tackles both location and routing subproblems simultaneously.","PeriodicalId":49765,"journal":{"name":"Neural Network World","volume":"1 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neural Network World","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.14311/nnw.2019.29.012","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 11

Abstract

This paper focuses on the continuous location-routing problem that comprises of the location of multiple depots from a given region and determining the routes of vehicles assigned to these depots. The objective of the problem is to design the delivery system of depots and routes so that the total cost is minimal. The standard location-routing problem considers a finite number of possible locations. The continuous location-routing problem allows location to infinite number of locations in a given region and makes the problem much more complex. We present a genetic algorithm that tackles both location and routing subproblems simultaneously.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
连续定位路由问题的遗传算法
本文主要研究连续定位-路径问题,该问题包括给定区域内多个仓库的位置以及分配到这些仓库的车辆路线的确定。问题的目标是设计仓库和路线的交付系统,使总成本最小。标准位置路由问题考虑有限数量的可能位置。连续定位路径问题允许在给定区域内定位无限多个位置,使问题更加复杂。提出了一种同时解决定位子问题和路由子问题的遗传算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Neural Network World
Neural Network World 工程技术-计算机:人工智能
CiteScore
1.80
自引率
0.00%
发文量
0
审稿时长
12 months
期刊介绍: Neural Network World is a bimonthly journal providing the latest developments in the field of informatics with attention mainly devoted to the problems of: brain science, theory and applications of neural networks (both artificial and natural), fuzzy-neural systems, methods and applications of evolutionary algorithms, methods of parallel and mass-parallel computing, problems of soft-computing, methods of artificial intelligence.
期刊最新文献
Water quality image classification for aquaculture using deep transfer learning Enhanced QOS energy-efficient routing algorithm using deep belief neural network in hybrid falcon-improved ACO nature-inspired optimization in wireless sensor networks Vibration analyses of railway systems using proposed neural predictors A self-adaptive deep learning-based model to predict cloud workload Integration of railway infrastructure topological description elements from the microL2 to the macroN0,L0 level of detail
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1