Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics
heuristic techniquesLagrangian relaxationlarge scale delivery systemsmixed-integer multicommodity flow problempoint-to-point route planning
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)
- 0-1 reformulations of the multicommodity capacitated network design problem
- The point-to-point delivery and connection problems: Complexity and algorithms
- The point-to-point connection problem - analysis and algorithms
- Combination of geographical information system and efficient routing algorithms for real life distribution operations.
- Operational planning of a large-scale multi-modal transportation system.
- Augmenting weighted graphs to establish directed point-to-point connectivity
- Topological design of a two-level network with ring-star configuration
- The computation of Cournot-Nash equilibria for the time-definite freight delivery industry under an oligopolistic market
- Heuristics for routes generation in pickup and delivery problem
- scientific article; zbMATH DE number 3896656 (Why is no real title available?)
- scientific article; zbMATH DE number 3952495 (Why is no real title available?)
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
- Shipment Routing Algorithms with Tree Constraints
- An Algorithmic Framework for Routeing LTL Shipments
- scientific article; zbMATH DE number 978512 (Why is no real title available?)
- scientific article; zbMATH DE number 1568945 (Why is no real title available?)
- Package routing in transportation networks with fixed vehicle schedules
- Route planning for a mixed delivery system in long distance transportation and comparison with pure delivery systems
- Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition
- A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem
- On the point-to-point connection problem
- The convex hull of two core capacitated network design problems
- Delivery itineraries and distribution capacity of a freight network with time slots
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)