scientific article; zbMATH DE number 1054963

MaRDI QIDQ4350083zbMATH OpenFDO

Authors Paolo Toth, Daniele Vigo

Publication date 28 August 1997

zbMATH Keywords

local searchtime windowsheuristic algorithmspickup and delivery problemurban areaoptimal schedulefleet of vehicles

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Transportation, logistics and supply chain management (90B06)

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

Cited in

(14)

• Vehicle routing problems with alternative paths: an application to on-demand transportation
• 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
• A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
• Recent models and algorithms for one-to-one pickup and delivery problems
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
• Daily aircraft routing for amphibious ready groups
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The dial-a-ride problem: Models and algorithms
• Dynamic transportation of patients in hospitals
• A new VRPPD model and a hybrid heuristic solution approach for e-tailing
• A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
• Designing the master schedule for demand-adaptive transit systems
• Fast local search algorithms for the handicapped persons transportation problem

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)