Fragment-based solution of two skip pickup and delivery problems

DOI10.1016/J.EJOR.2026.03.020MaRDI QIDQ7349325zbMATH OpenFDO

Authors Michael Forbes, Thomas Whitaker, Sanne Wøhlk

Publication date 16 September 2026

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2026.03.020

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A branch-and-cut algorithm for a skip pick-up and delivery problem
• A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
• Adaptive large neighborhood search for drayage routing problems involving longer combination vehicles
• An asymmetric vehicle routing problem arising in the collection and disposal of special waste
• scientific article; zbMATH DE number 2130494 (Why is no real title available?)
• Optimal sequencing of skip collections and deliveries
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
• The Rollon-Rolloff vehicle routing problem
• The rollon-rolloff waste collection vehicle routing problem with time windows
• Transport of skips between recycling centers and treatment facilities
• Waste collection routing: a survey on problems and methods

This page was built for publication: Fragment-based solution of two skip pickup and delivery problems

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