Complexity of scheduling for DARP with soft ride times

DOI10.1007/978-3-030-17402-6_13MaRDI QIDQ2294048zbMATH OpenOpenAlexFDO

Authors Janka Chlebíková, Clément Dallard, Niklas Paulsen

Publication date 6 February 2020

Full work available at URL https://researchportal.port.ac.uk/portal/en/publications/complexity-of-scheduling-for-darp-with-soft-ride-times(11e1c8f3-cfc4-4cf5-8881-c648b7d77fec).html

zbMATH Keywords

schedulingtime windowsNP-hardnessVehicle Routing Problemdial-a-rideride times

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems
• Efficient feasibility testing for dial-a-ride problems
• Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed
• Computer-aided complexity classification of dial-a-ride problems
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms

Cited in

(1)

• Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems

This page was built for publication: Complexity of scheduling for DARP with soft ride times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294048)