Heuristic Algorithms for the Handicapped Persons Transportation Problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1054963
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
Cited in
(40)- 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
- Modelling and solving the senior transportation problem
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- Typology and literature review for dial-a-ride problems
- Minimizing the maximal ergonomic burden in intra-hospital patient transportation
- The prisoner transportation problem
- A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment
- Dynamic transportation of patients in hospitals
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- Routing by ranking: a link analysis method for the constrained dial-a-ride problem
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- The dial-a-ride problem: Models and algorithms
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- A new VRPPD model and a hybrid heuristic solution approach for e-tailing
- Fast local search algorithms for the handicapped persons transportation problem
- 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)
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- Variable neighborhood search for the dial-a-ride problem
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- Competition and cooperation in pickup and multiple delivery problems
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- A comparison of column-generation approaches to the synchronized pickup and delivery problem
- An adaptive large neighborhood search for an E-grocery delivery routing problem
- Recent models and algorithms for one-to-one pickup and delivery problems
- scientific article; zbMATH DE number 1054963 (Why is no real title available?)
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
- The time‐consistent dial‐a‐ride problem
- Étude comparative de divers modèles pour le problème de transport à la demande
- Efficient GRASP solution approach for the prisoner transportation problem
- Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
- Local search heuristics for the probabilistic dial-a-ride problem
- Metaheuristics in combinatorial optimization
- An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services
This page was built for publication: Heuristic Algorithms for the Handicapped Persons Transportation Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367065)
