Shipment Routing Algorithms with Tree Constraints

DOI10.1287/TRSC.26.3.230MaRDI QIDQ4021786zbMATH OpenOpenAlexFDO

Authors Warren Powell, Ioannis A. Koskosidis

Publication date 17 January 1993

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.26.3.230

zbMATH Keywords

local improvement heuristicnetwork designprimal-dual algorithmsshipment routingtrucking networks

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Recommendations

• An Algorithmic Framework for Routeing LTL Shipments
• Routing models and solution procedures for regional less-than-truckload operations
• Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics
• Dynamic routing for priority shipments in LTL service networks
• scientific article; zbMATH DE number 3952495

Cited in

(10)

• Service network design in freight transportation
• A heuristic algorithm for the truckload and less-than-truckload problem
• Routing models and solution procedures for regional less-than-truckload operations
• Dynamic routing for priority shipments in LTL service networks
• Minimax flow tree problems
• Large-scale, less-than-truckload service network design
• An Algorithmic Framework for Routeing LTL Shipments
• Alternate mode dispatching: the impact of cost minimisation
• Multi-routing for transport-matching in cooperative, full truckload, relay networks
• An algorithm for optimal shipments with given frequencies

This page was built for publication: Shipment Routing Algorithms with Tree Constraints

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