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

引用次数: 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.

查看原文本刊更多论文

连续定位路由问题的遗传算法

本文主要研究连续定位-路径问题，该问题包括给定区域内多个仓库的位置以及分配到这些仓库的车辆路线的确定。问题的目标是设计仓库和路线的交付系统，使总成本最小。标准位置路由问题考虑有限数量的可能位置。连续定位路径问题允许在给定区域内定位无限多个位置，使问题更加复杂。提出了一种同时解决定位子问题和路由子问题的遗传算法。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Neural Network World 工程技术-计算机：人工智能

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

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.