随机需求软时间窗车辆路径问题的遗传算法

Proceedings of the 2004 IEEE Systems and Information Engineering Design Symposium, 2004. Pub Date : 2004-04-16 DOI:10.1109/SIEDS.2004.239880

Matthew H. Jones, S. Patek, B. Tawney

{"title":"随机需求软时间窗车辆路径问题的遗传算法","authors":"Matthew H. Jones, S. Patek, B. Tawney","doi":"10.1109/SIEDS.2004.239880","DOIUrl":null,"url":null,"abstract":"We study the stochastic vehicle routing problem with soft time windows (SVRPSTW). Vehicles with limited capacity are routed from the central depot to a set of geographically dispersed customers with unknown demands, predefined presence probability and time windows. The late arrival at the customer is allowed by adding a penalty to the objective value. A mathematical model is developed to describe the behavior of this kind of delivery system. A novel age based genetic scheduling algorithm is proposed as an optimization tool to solve this intractable vehicle routing problem in order to minimize the total cost. The effectiveness of the proposed scheduling algorithm is illustrated by using a set of randomly generated numerical examples. The results indicate that the proposed genetic approach is a simple but effective means for solving these problems","PeriodicalId":287496,"journal":{"name":"Proceedings of the 2004 IEEE Systems and Information Engineering Design Symposium, 2004.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"A genetic algorithm for vehicle routing problems with stochastic demand and soft time windows\",\"authors\":\"Matthew H. Jones, S. Patek, B. Tawney\",\"doi\":\"10.1109/SIEDS.2004.239880\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the stochastic vehicle routing problem with soft time windows (SVRPSTW). Vehicles with limited capacity are routed from the central depot to a set of geographically dispersed customers with unknown demands, predefined presence probability and time windows. The late arrival at the customer is allowed by adding a penalty to the objective value. A mathematical model is developed to describe the behavior of this kind of delivery system. A novel age based genetic scheduling algorithm is proposed as an optimization tool to solve this intractable vehicle routing problem in order to minimize the total cost. The effectiveness of the proposed scheduling algorithm is illustrated by using a set of randomly generated numerical examples. The results indicate that the proposed genetic approach is a simple but effective means for solving these problems\",\"PeriodicalId\":287496,\"journal\":{\"name\":\"Proceedings of the 2004 IEEE Systems and Information Engineering Design Symposium, 2004.\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2004 IEEE Systems and Information Engineering Design Symposium, 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIEDS.2004.239880\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2004 IEEE Systems and Information Engineering Design Symposium, 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIEDS.2004.239880","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 25

摘要

研究了带软时间窗的随机车辆路径问题。容量有限的车辆从中央仓库路由到一组地理上分散的客户，这些客户的需求未知，预定义的存在概率和时间窗口。通过在目标值上加一个惩罚，允许客户迟到。建立了一个数学模型来描述这种输送系统的行为。提出了一种新的基于年龄的遗传调度算法，作为求解这一棘手的车辆路径问题的优化工具，以最小化总成本。通过一组随机生成的数值算例说明了所提调度算法的有效性。结果表明，所提出的遗传方法是解决这些问题的一种简单而有效的方法

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

查看原文本刊更多论文

A genetic algorithm for vehicle routing problems with stochastic demand and soft time windows

We study the stochastic vehicle routing problem with soft time windows (SVRPSTW). Vehicles with limited capacity are routed from the central depot to a set of geographically dispersed customers with unknown demands, predefined presence probability and time windows. The late arrival at the customer is allowed by adding a penalty to the objective value. A mathematical model is developed to describe the behavior of this kind of delivery system. A novel age based genetic scheduling algorithm is proposed as an optimization tool to solve this intractable vehicle routing problem in order to minimize the total cost. The effectiveness of the proposed scheduling algorithm is illustrated by using a set of randomly generated numerical examples. The results indicate that the proposed genetic approach is a simple but effective means for solving these problems

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 2004 IEEE Systems and Information Engineering Design Symposium, 2004.

自引率

0.00%

发文量