{"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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
