scientific article; zbMATH DE number 1054963
From MaRDI portal
Publication:4350083
zbMATH Open0877.90035MaRDI QIDQ4350083FDOQ4350083
Authors: Paolo Toth, Daniele Vigo 
Publication date: 28 August 1997
Title of this publication is not available (Why is that?)
Recommendations
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- Fast local search algorithms for the handicapped persons transportation problem
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
local searchtime windowsheuristic algorithmspickup and delivery problemurban areaoptimal schedulefleet of vehicles
Learning and adaptive systems in artificial intelligence (68T05) Transportation, logistics and supply chain management (90B06)
Cited In (14)
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- Étude comparative de divers modèles pour le problème de transport à la demande
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- Fast local search algorithms for the handicapped persons transportation problem
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- A new VRPPD model and a hybrid heuristic solution approach for e-tailing
- Daily aircraft routing for amphibious ready groups
- Designing the master schedule for demand-adaptive transit systems
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- Recent models and algorithms for one-to-one pickup and delivery problems
- Dynamic transportation of patients in hospitals
- 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)
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 Q4350083)
