scientific article; zbMATH DE number 1361564

zbMATH Open0935.90018MaRDI QIDQ4699387FDOQ4699387

Authors: Ralf Borndörfer, Martin Grötschel, Fridolin Klostermeier, Christian Küttner 

Publication date: 1 February 2000

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 771804
• scientific article; zbMATH DE number 1424450
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives

zbMATH Keywords

clusteringset partitioningbranch-and-cut algorithmbus schedulingdial-a-ride system

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Case-oriented studies in operations research (90B90) Transportation, logistics and supply chain management (90B06)

Cited In (20)

• A new VRPPD model and a hybrid heuristic solution approach for e-tailing
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
• On the Hartman effect and velocity of propagating the electromagnetic wave in the tunneling process
• Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
• A comparison of column-generation approaches to the synchronized pickup and delivery problem
• A two-stage model for a day-ahead paratransit planning problem
• Measures of dynamism and urgency in logistics
• A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
• Pruning in column generation for service vehicle dispatching
• Recent models and algorithms for one-to-one pickup and delivery problems
• Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints
• The dial-a-ride problem: Models and algorithms
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Typology and literature review for dial-a-ride problems
• Local search heuristics for the probabilistic dial-a-ride problem
• A tabu search heuristic for the dynamic transportation of patients between care units
• A Two-stage Model for a Day-ahead Paratransit Planning Problem
• Title not available (Why is that?)
• A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network

This page was built for publication:

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