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

DOI10.1287/trsc.24.4.245zbMath0723.90019OpenAlexW2035363092MaRDI QIDQ5202007

Vijay Singhal, Thomas L. Magnanti, Janny M. Y. 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

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

Related Items

Augmenting weighted graphs to establish directed point-to-point connectivity, Topological design of a two-level network with ring-star configuration, 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, Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs, On the point-to-point connection problem, The point-to-point delivery and connection problems: Complexity and algorithms, The convex hull of two core capacitated network design problems, 0-1 reformulations of the multicommodity capacitated network design problem, The computation of Cournot-Nash equilibria for the time-definite freight delivery industry under an oligopolistic market