Heuristic Algorithms for the Handicapped Persons Transportation Problem
From MaRDI portal
Publication:4367065
DOI10.1287/trsc.31.1.60zbMath0888.90117OpenAlexW1987132101MaRDI QIDQ4367065
Publication date: 25 November 1997
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.31.1.60
transportationheuristictime windowspickup and delivery problemtabu thresholdingurban areafleet of vehicles
Transportation, logistics and supply chain management (90B06) Operations research and management science (90B99)
Related Items
A comparison of column-generation approaches to the synchronized pickup and delivery 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), A hybrid genetic algorithm for the heterogeneous dial-a-ride problem, An adaptive large neighborhood search for an E-grocery delivery routing problem, Vehicle routing problems with alternative paths: an application to on-demand transportation, Variable neighborhood search for the dial-a-ride problem, The prisoner transportation problem, An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services, A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem, An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows, The time‐consistent dial‐a‐ride problem, Étude comparative de divers modèles pour le problème de transport à la demande, A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network, Efficient GRASP solution approach for the prisoner transportation problem, Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics, 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, Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints, Competition and Cooperation in Pickup and Multiple Delivery Problems, Routing by ranking: a link analysis method for the constrained dial-a-ride problem, Local search heuristics for the probabilistic dial-a-ride problem, The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments, Minimizing the maximal ergonomic burden in intra-hospital patient transportation, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, The dial-a-ride problem: Models and algorithms, New mixed integer-programming model for the pickup-and-delivery problem with transshipment, A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM, Dynamic transportation of patients in hospitals, A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints, A heuristic two-phase solution approach for the multi-objective dial-a-ride problem, A new VRPPD model and a hybrid heuristic solution approach for e-tailing, 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, Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care, Metaheuristics in combinatorial optimization
