Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics

DOI10.1287/TRSC.24.4.245MaRDI QIDQ5202007zbMATH OpenOpenAlexFDO

Authors Thomas L. Magnanti, Vijay Singhal, Janny Leung

Publication date 1990

Published in Transportation Science (Search for Journal in Brave)

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

zbMATH Keywords

Lagrangian relaxationheuristic techniqueslarge scale delivery systemsmixed-integer multicommodity flow problempoint-to-point route planning

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Recommendations

• scientific article; zbMATH DE number 3952495
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
• Split delivery routing
• Package routing in transportation networks with fixed vehicle schedules
• Vehicle routing considerations in distribution system design

Cited in

(23)

• The convex hull of two core capacitated network design problems
• Shipment Routing Algorithms with Tree Constraints
• Route planning for a mixed delivery system in long distance transportation and comparison with pure delivery systems
• scientific article; zbMATH DE number 3896656 (Why is no real title available?)
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
• Topological design of a two-level network with ring-star configuration
• Package routing in transportation networks with fixed vehicle schedules
• The computation of Cournot-Nash equilibria for the time-definite freight delivery industry under an oligopolistic market
• The point-to-point connection problem - analysis and algorithms
• A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem
• scientific article; zbMATH DE number 3952495 (Why is no real title available?)
• scientific article; zbMATH DE number 1568945 (Why is no real title available?)
• Operational planning of a large-scale multi-modal transportation system.
• Combination of geographical information system and efficient routing algorithms for real life distribution operations.
• An Algorithmic Framework for Routeing LTL Shipments
• 0-1 reformulations of the multicommodity capacitated network design problem
• Delivery itineraries and distribution capacity of a freight network with time slots
• Heuristics for routes generation in pickup and delivery problem
• Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
• Augmenting weighted graphs to establish directed point-to-point connectivity
• On the point-to-point connection problem
• Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition
• The point-to-point delivery and connection problems: Complexity and algorithms

This page was built for publication: Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics

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