A two-stage model for a day-ahead paratransit planning problem
From MaRDI portal
Publication:1014313
DOI10.1007/s00186-008-0262-5zbMath1179.90242OpenAlexW2031630918MaRDI QIDQ1014313
Maria L. A. G. Cremers, Willem K. Klein Haneveld, Maarten H. van der Vlerk
Publication date: 27 April 2009
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-008-0262-5
Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
The dial-a-ride problem with private fleet and common carrier ⋮ Typology and literature review for dial-a-ride problems ⋮ The stochastic programming heritage of Maarten van der Vlerk
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A genetic algorithm for the multidimensional knapsack problem
- A genetic algorithm for the generalised assignment problem
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- Approximation algorithms for the multiple knapsack problem with assignment restrictions
- Stochastic linear programming. Models, theory, and computation
- A genetic algorithm for the vehicle routing problem
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- Solving the Dial-a-Ride problem using genetic algorithms
- Algorithms for the Multi-Resource Generalized Assignment Problem
- Introduction to Stochastic Programming
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- Heuristics for the multi-resource generalized assignment problem
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
