scientific article; zbMATH DE number 906535

MaRDI QIDQ4885616zbMATH OpenFDO

Authors Stephen M. Hart

Publication date 18 July 1996

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)

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

Cited in

(3)

• An adaptive large neighborhood search for an E-grocery delivery routing problem
• Simulated annealing heuristic for the general share-a-ride problem
• A new VRPPD model and a hybrid heuristic solution approach for e-tailing

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)