Package routing in transportation networks with fixed vehicle schedules

DOI10.1002/(SICI)1097-0037(199601)27:1%3C81::AID-NET7%3E3.0.CO;2-AMaRDI QIDQ4887737zbMATH OpenOpenAlexFDO

Authors

Publication date 9 December 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199601)27:1%3C81::aid-net7%3E3.0.co;2-a

zbMATH Keywords

approximation algorithmsmulticommodity flow problemNP-completerelaxed linear programming formulationrouting of packagessensitivitytransportation networks

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Linear programming (90C05) Applications of mathematical programming (90C90)

Recommendations

• Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics
• Packet Routing on the Grid
• Packet Routing: Complexity and Algorithms
• scientific article; zbMATH DE number 3952495
• A Network Flow Based Heuristic for Bulk Pickup and Delivery Routing

Cited in

(2)

• Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics
• Intra market optimization for express package carriers with station to station travel and proportional sorting

This page was built for publication: Package routing in transportation networks with fixed vehicle schedules

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