scientific article; zbMATH DE number 771804

MaRDI QIDQ4838170zbMATH OpenFDO

Authors Doris Tesch

Publication date 9 July 1995

zbMATH Keywords

designing schedulesdial-a-ride-taxifacet-defining inequalitiesheuristicroute- planningset partitioningtravelling salesperson

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 1361564
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• An effective and fast heuristic for the dial-a-ride problem
• Computer-aided transit scheduling. Proceedings of the fourth international workshop on computer-aided scheduling of public transport, held in Hamburg, FRG, 28th -- 31st July 1987
• scientific article; zbMATH DE number 2153292

Cited in

(3)

• Scheduling taxi services for a team of car relocators
• scientific article; zbMATH DE number 2153292 (Why is no real title available?)
• scientific article; zbMATH DE number 1361564 (Why is no real title available?)

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 Q4838170)