Network design for time‐constrained delivery

DOI10.1002/NAV.20302zbMath1152.90351OpenAlexW2091766827MaRDI QIDQ5503760

Ann Melissa Campbell, Barrett W. Thomas, Hui Chen

Publication date: 16 January 2009

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20302

zbMATH Keywords

local searchnetwork designtime constraintstree-structure networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (13)

Hub location for time definite transportation ⋮ Tight bounds from a path based formulation for the tree of hub location problem ⋮ A two-level off-grid electric distribution problem on the continuous space ⋮ Improved algorithms for joint optimization of facility locations and network connections ⋮ A Stackelberg hub arc location model for a competitive environment ⋮ A biased random-key genetic algorithm for the tree of hubs location problem ⋮ General network design: a unified view of combined location and network design problems ⋮ Network design for time-constrained delivery using subgraphs ⋮ Modeling and solving the bi-objective minimum diameter-cost spanning tree problem ⋮ LTL logistics networks with differentiated services ⋮ Minimax flow tree problems ⋮ Flow shipment scheduling in an incomplete hub location-routing network design problem ⋮ The tree of hubs location problem

Uses Software

• MOD-DIST
• MENU-OKF
• Boost

Cites Work

• Unnamed Item
• Edge exchanges in the degree-constrained minimum spanning tree problem
• Multicommodity flow models for spanning trees with hop constraints
• The 2-hop spanning tree problem
• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• Approximation algorithms for some optimum communication spanning tree problems
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• Approximating \(k\)-hop minimum-spanning trees
• Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
• Minimax flow tree problems
• Optimum Communication Spanning Trees
• A novel modeling approach for express package carrier planning
• The complexity of the network design problem
• A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
• Network design for express shipment delivery

This page was built for publication: Network design for time‐constrained delivery