scientific article; zbMATH DE number 906535

zbMATH Open0847.90047MaRDI QIDQ4885616FDOQ4885616

Authors: Stephen M. Hart 

Publication date: 18 July 1996

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

Recommendations

• An effective and fast heuristic for the dial-a-ride problem
• A matheuristic for the dial-a-ride problem
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• Modeling and optimizing dynamic dial-a-ride problems
• HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM

zbMATH Keywords

simulated annealingheuristicmixed integer linear programmingdial-a-ride problem

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Cited In (3)

• A new VRPPD model and a hybrid heuristic solution approach for e-tailing
• Simulated annealing heuristic for the general share-a-ride problem
• An adaptive large neighborhood search for an E-grocery delivery routing 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 Q4885616)