Meta-heuristics for a class of demand-responsive transit systems

DOI10.1287/IJOC.1030.0051MaRDI QIDQ2890452zbMATH OpenOpenAlexWikidataFDO

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

Publication date 8 June 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1030.0051

zbMATH Keywords

GRASPmeta-heuristicspublic transporttabu search hybrids

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Fuzzy control/observation systems (93C42)

Recommendations

• scientific article; zbMATH DE number 1683925
• A tabu search based heuristic method for the transit route network design problem
• Designing the master schedule for demand-adaptive transit systems
• A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
• A matheuristic for the dial-a-ride problem

Cited in

(8)

• Designing the master schedule for demand-adaptive transit systems
• Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive
• VNS as an upper bound for an exact method to solve a class of on-demand transit transportation systems
• scientific article; zbMATH DE number 1683924 (Why is no real title available?)
• scientific article; zbMATH DE number 1683925 (Why is no real title available?)
• scientific article; zbMATH DE number 1867329 (Why is no real title available?)
• É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: Meta-heuristics 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 Q2890452)