累积校车路线问题:多项式大小公式

IF 1.6 4区计算机科学 Q4 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Networks Pub Date : 2023-08-10 DOI:10.1002/net.22179

Farnaz Farzadnia, T. Bektaş, Jens Lysgaard

{"title":"累积校车路线问题:多项式大小公式","authors":"Farnaz Farzadnia, T. Bektaş, Jens Lysgaard","doi":"10.1002/net.22179","DOIUrl":null,"url":null,"abstract":"This article introduces the cumulative school bus routing problem, which concerns the transport of students from a school using a fleet of identical buses. The objective of the problem is to select a drop‐off point for each student among potential locations within a certain walking distance and to generate routes such that the sum of arrival times of all students from their school to their homes is minimized. The article describes six polynomial‐size mixed integer linear programming formulations based on original and auxiliary graphs, and the formulations are numerically compared on real instances. The article reports the results of computational experiments performed to evaluate the performance of the proposed models.","PeriodicalId":54734,"journal":{"name":"Networks","volume":" ","pages":""},"PeriodicalIF":1.6000,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The cumulative school bus routing problem: Polynomial‐size formulations\",\"authors\":\"Farnaz Farzadnia, T. Bektaş, Jens Lysgaard\",\"doi\":\"10.1002/net.22179\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article introduces the cumulative school bus routing problem, which concerns the transport of students from a school using a fleet of identical buses. The objective of the problem is to select a drop‐off point for each student among potential locations within a certain walking distance and to generate routes such that the sum of arrival times of all students from their school to their homes is minimized. The article describes six polynomial‐size mixed integer linear programming formulations based on original and auxiliary graphs, and the formulations are numerically compared on real instances. The article reports the results of computational experiments performed to evaluate the performance of the proposed models.\",\"PeriodicalId\":54734,\"journal\":{\"name\":\"Networks\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2023-08-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1002/net.22179\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1002/net.22179","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}

引用次数: 0

摘要

本文介绍了累积校车路线问题，该问题涉及使用相同的校车车队从学校运送学生。该问题的目标是在一定步行距离内的潜在地点中为每个学生选择一个下车点，并生成路线，使所有学生从学校到家的到达时间总和最小。本文描述了六种基于原始图和辅助图的多项式大小的混合整数线性规划公式，并在实例上进行了数值比较。本文报告了计算实验的结果，以评估所提出的模型的性能。

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

查看原文本刊更多论文

The cumulative school bus routing problem: Polynomial‐size formulations

This article introduces the cumulative school bus routing problem, which concerns the transport of students from a school using a fleet of identical buses. The objective of the problem is to select a drop‐off point for each student among potential locations within a certain walking distance and to generate routes such that the sum of arrival times of all students from their school to their homes is minimized. The article describes six polynomial‐size mixed integer linear programming formulations based on original and auxiliary graphs, and the formulations are numerically compared on real instances. The article reports the results of computational experiments performed to evaluate the performance of the proposed models.

求助全文

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

来源期刊

Networks 工程技术-计算机：硬件

CiteScore

4.40

自引率

9.50%

发文量

审稿时长

12 months

期刊介绍： Network problems are pervasive in our modern technological society, as witnessed by our reliance on physical networks that provide power, communication, and transportation. As well, a number of processes can be modeled using logical networks, as in the scheduling of interdependent tasks, the dating of archaeological artifacts, or the compilation of subroutines comprising a large computer program. Networks provide a common framework for posing and studying problems that often have wider applicability than their originating context. The goal of this journal is to provide a central forum for the distribution of timely information about network problems, their design and mathematical analysis, as well as efficient algorithms for carrying out optimization on networks. The nonstandard modeling of diverse processes using networks and network concepts is also of interest. Consequently, the disciplines that are useful in studying networks are varied, including applied mathematics, operations research, computer science, discrete mathematics, and economics. Networks publishes material on the analytic modeling of problems using networks, the mathematical analysis of network problems, the design of computationally eﬃcient network algorithms, and innovative case studies of successful network applications. We do not typically publish works that fall in the realm of pure graph theory (without signiﬁcant algorithmic and modeling contributions) or papers that deal with engineering aspects of network design. Since the audience for this journal is then necessarily broad, articles that impact multiple application areas or that creatively use new or existing methodologies are especially appropriate. We seek to publish original, well-written research papers that make a substantive contribution to the knowledge base. In addition, tutorial and survey articles are welcomed. All manuscripts are carefully refereed.