Niaz A. Wassan, S. Salhi, G. Nagy, Naveed Wassan, A. Wade
{"title":"Solving the Mixed Backhauling Vehicle Routing: Problem with Ants","authors":"Niaz A. Wassan, S. Salhi, G. Nagy, Naveed Wassan, A. Wade","doi":"10.4018/ijeoe.2013040105","DOIUrl":null,"url":null,"abstract":"The mixed vehicle routing problem with backhauls is investigated using ant system heuristic. This distribution problem seems to suffer from a lack of published work even though it has immense practical applicability especially within logistic systems. Some enhancements to the basic ant system algorithm are embedded into the search. In particular a focus is on the choice in the placement of ants, the use of site-dependent candidate list, the introduction of a look ahead-based visibility, and appropriate strategies for updating local and global trails. Encouraging computational results are reported when tested on benchmark data sets.","PeriodicalId":246250,"journal":{"name":"Int. J. Energy Optim. Eng.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Energy Optim. Eng.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/ijeoe.2013040105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
The mixed vehicle routing problem with backhauls is investigated using ant system heuristic. This distribution problem seems to suffer from a lack of published work even though it has immense practical applicability especially within logistic systems. Some enhancements to the basic ant system algorithm are embedded into the search. In particular a focus is on the choice in the placement of ants, the use of site-dependent candidate list, the introduction of a look ahead-based visibility, and appropriate strategies for updating local and global trails. Encouraging computational results are reported when tested on benchmark data sets.