A quasi-assignment algorithm for bus scheduling

DOI10.1002/net.3230170302zbMath0647.90048OpenAlexW1971732610MaRDI QIDQ3792474

I. M. Branco, José M. Pinto Paixão

Publication date: 1987

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230170302

zbMATH Keywords

vehicle routingtransportation problemHungarian methodComputational resultsassignment modelbus schedulingassigning busesbus depotlarge number of short trips in an urban areaquasi-assignment algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)

Related Items (6)

Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem ⋮ A decision support system for the single-depot vehicle rescheduling problem ⋮ Parallel Auction Algorithm for Bus Rescheduling ⋮ Vehicle and crew scheduling for urban bus lines ⋮ A new algorithm for the quasi-assignment problem ⋮ An exact algorithm for multiple depot bus scheduling

This page was built for publication: A quasi-assignment algorithm for bus scheduling