A single-phase method based on evolution calculation for vehicle routing problem

Takeo Takeno, Y. Tsujimura, G. Yamazaki
{"title":"A single-phase method based on evolution calculation for vehicle routing problem","authors":"Takeo Takeno, Y. Tsujimura, G. Yamazaki","doi":"10.1109/ICCIMA.2001.970451","DOIUrl":null,"url":null,"abstract":"This paper is concerned with a transportation system in which vehicles deliver a piece of luggage to customers distributed on a service area. An important problem of operating such a system is to determine an assignment of the luggage into each vehicle. Problem to obtain the assignment is called vehicle routing problem (VRP) and it is one of hard combinatorial optimization problems. And VRP is characterized with two properties, geometrical and time structures. The main purpose of this work is to propose an evolution calculation method for VRP. In the method, four search operators that utilize geometrical and time structures are introduced. Numerical experiments for an actual system are presented to examine the method.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIMA.2001.970451","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

This paper is concerned with a transportation system in which vehicles deliver a piece of luggage to customers distributed on a service area. An important problem of operating such a system is to determine an assignment of the luggage into each vehicle. Problem to obtain the assignment is called vehicle routing problem (VRP) and it is one of hard combinatorial optimization problems. And VRP is characterized with two properties, geometrical and time structures. The main purpose of this work is to propose an evolution calculation method for VRP. In the method, four search operators that utilize geometrical and time structures are introduced. Numerical experiments for an actual system are presented to examine the method.
基于演化计算的车辆路径问题单相求解方法
本文研究的是一种运输系统,其中车辆将一件行李运送到分布在服务区的顾客手中。操作这种系统的一个重要问题是确定将行李分配到每辆车上。求解分配的问题称为车辆路径问题(VRP),是一种难组合优化问题。VRP具有几何结构和时间结构两种特征。本文的主要目的是提出一种VRP的演化计算方法。在该方法中,引入了四种利用几何结构和时间结构的搜索算子。给出了一个实际系统的数值实验来验证该方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信