A Request Clustering Algorithm for Door-to-Door Handicapped Transportation

DOI10.1287/trsc.29.1.63zbMath0826.90045OpenAlexW1972646085MaRDI QIDQ4836843

Irina Ioachim, Marius M. Solomon, Jacques Desrosiers, Yvan Dumas, Daniel Villeneuve

Publication date: 21 June 1995

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.29.1.63

zbMATH Keywords

approximate methodtime windowsmulti-vehicle pickup and delivery problemset of mini-clusters

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Related Items (22)

Event-based MILP models for ridepooling applications ⋮ Column generation approaches to ship scheduling with flexible cargo sizes ⋮ An effective and fast heuristic for the dial-a-ride problem ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation ⋮ Solving a selective dial-a-ride problem with logic-based Benders decomposition ⋮ Large-scale pickup and delivery work area design ⋮ Routing problems: A bibliography ⋮ A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem ⋮ Typology and literature review for dial-a-ride problems ⋮ A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows ⋮ Local search heuristics for the probabilistic dial-a-ride problem ⋮ Bi-dynamic constraint aggregation and subproblem reduction ⋮ Vehicle routing problems with simultaneous pick-up and delivery service. ⋮ The dial-a-ride problem: Models and algorithms ⋮ Designing the master schedule for demand-adaptive transit systems ⋮ A hybrid scatter search heuristic for personalized crew rostering in the airline industry ⋮ A tabu search heuristic for the dynamic transportation of patients between care units ⋮ A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints ⋮ A two-stage model for a day-ahead paratransit planning problem ⋮ The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method ⋮ A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service

This page was built for publication: A Request Clustering Algorithm for Door-to-Door Handicapped Transportation