当前位置: 首页> 国外交通期刊数据库 >详情
原文传递 Memetic Algorithm for the Heterogeneous Fleet School Bus Routing Problem
题名: Memetic Algorithm for the Heterogeneous Fleet School Bus Routing Problem
其他题名: Barr,R.S.,B.L.Golden,J.P.Kelly,M.G.C.Resende,and W.R.Stewart Jr.1995."Designing and reporting on computational experiments with heuristic methods."J.Heuristics 1(1):9-32.https://doi.org/10.1007/BF02430363.
正文语种: 英文
作者: Leonardo de Pádua Agripa Sales
关键词: Evolutionary algorithms;Vehicle-routing problems;School bus transportation;Combinatorial optimization;Metaheuristics
摘要: The school bus routing problem is a hard, widely studied combinatorial optimization problem. However, little attention has been paid in the literature to the integration between the school bus routing problem and the design of the underlying network. This paper aims to present a new variant of the problem in which the following issues are taken into consideration: the determination of the set of stops to visit, the allocation of students to stops, the generation of routes, and the utilization of a heterogeneous fleet, with different fixed costs and capacities. It is presented as an integer programming formulation, a lower-bound technique, as well a greedy genetic and a memetic algorithm for the heterogenous fleet school bus routing problem (HFSBRP). The integer programming formulation has shown limited application to the solution of large size instances. Computational results on a set of 100 instances provide evidence of the quality of the solutions found by the memetic algorithm on large instances.
出版年: 2018
论文唯一标识: P-84Y2018V144N02016
英文栏目名称: TECHNICAL PAPERS
doi: 10.1061/(ASCE)UP.1943-5444.0000454
期刊名称: Journal of Urban Planning and Development
拼音刊名(出版物代码): P-84
卷: 144
期: 02
页码: 149-160
检索历史
应用推荐