A Two-stage Model for a Day-ahead Paratransit Planning Problem

DOI10.1016/J.ENDM.2006.06.059MaRDI QIDQ3439463zbMATH OpenOpenAlexFDO

Authors Maria L. A. G. Cremers, Willem K. Klein Haneveld, Maarten H. van der Vlerk

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://pure.rug.nl/ws/files/63159255/A_two_stage_model_for_a_day_ahead_paratransit_planning_problem.pdf

zbMATH Keywords

genetic algorithmsstochastic programmingparatransit transport

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15)

Recommendations

• A two-stage model for a day-ahead paratransit planning problem
• A dynamic day-ahead paratransit planning problem
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• Modelling and solving the senior transportation problem
• scientific article; zbMATH DE number 1361564

Cited in

(3)

• A dynamic day-ahead paratransit planning problem
• Modelling and solving the senior transportation problem
• A two-stage model for a day-ahead paratransit planning problem

This page was built for publication: A Two-stage Model for a Day-ahead Paratransit Planning Problem

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