On constructing a family of student delivery routes in minimal time

DOI10.1134/S0005117914070029MaRDI QIDQ893919zbMATH OpenOpenAlexFDO

Authors Efim M. Bronshteĭn, D. M. Vagapova, A. V. Nazmutdinova

Publication date 23 November 2015

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0005117914070029

zbMATH Keywords

exact algorithmschool bus routinglinear partially integer modelsimple heuristic algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Applications of optimal control and differential games (49N90) Traffic problems in operations research (90B20)

Recommendations

• The school bus routing problem: a case study
• School-bus routing for program scheduling
• The school bus routing problem: an analysis and algorithm
• scientific article; zbMATH DE number 975355
• Scheduling School Buses

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• The school bus problem on trees
• The school bus routing problem: a review
• The truck dispatching problem

Cited in

(2)

• scientific article; zbMATH DE number 1683927 (Why is no real title available?)
• Same-day delivery with fair customer service

This page was built for publication: On constructing a family of student delivery routes in minimal time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893919)