Adapting the \textit{ng}-path relaxation for bike balancing problems

DOI10.1016/J.ORL.2022.02.005MaRDI QIDQ2157885zbMATH OpenOpenAlexFDO

Authors Christian Tilk

Publication date 22 July 2022

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2022.02.005

zbMATH Keywords

bike balancingbranch-and-pricepath relaxationsplit-deliverysplit-Pick-up

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• The static bike relocation problem with multiple vehicles and visits
• Bike sharing systems: solving the static rebalancing problem
• The static bicycle relocation problem with demand intervals
• Full-load route planning for balancing bike sharing systems by logic-based benders decomposition
• The one-station bike repositioning problem

Cites work

• A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
• Column Generation
• scientific article; zbMATH DE number 1452994 (Why is no real title available?)
• scientific article; zbMATH DE number 7124428 (Why is no real title available?)
• New Refinements for the Solution of Vehicle Routing Problems with Branch and Price
• New route relaxation and pricing strategies for the vehicle routing problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Shared mobility systems: an updated survey

This page was built for publication: Adapting the \textit{ng}-path relaxation for bike balancing problems

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