Adaptive memory programming for a class of demand responsive transit systems

MaRDI QIDQ2759920zbMATH OpenFDO

Authors Federico Malucelli, Maddalena Nonato, Teodor Gabriel Crainic, François Guertin

Publication date 18 December 2001

zbMATH Keywords

public transportation system

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Recommendations

• Meta-heuristics for a class of demand-responsive transit systems
• Designing the master schedule for demand-adaptive transit systems
• scientific article; zbMATH DE number 1867329
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
• Modeling and optimizing dynamic dial-a-ride problems

Cited in

(7)

• Designing the master schedule for demand-adaptive transit systems
• Meta-heuristics for a class of demand-responsive transit systems
• Sensitivity analyses over the service area for Mobility Allowance Shutte Transit (MAST) services
• scientific article; zbMATH DE number 1867329 (Why is no real title available?)
• A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops
• Étude comparative de divers modèles pour le problème de transport à la demande
• A demand‐responsive feeder service with a maximum headway at mandatory stops

This page was built for publication: Adaptive memory programming for a class of demand responsive transit systems

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