Subgradient Methods for the Service Network Design Problem

DOI10.1287/trsc.28.3.256zbMath0814.90023OpenAlexW2084989886MaRDI QIDQ4319316

Warren B. Powell, Judith M. Farvolden

Publication date: 11 January 1995

Published in: Transportation Science (Search for Journal in Brave)

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

zbMATH Keywords

routingsubgradientsservice network designmulticommodity network flowlocal-improvement heuristics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Queues and service in operations research (90B22)

Related Items (13)

Integrated shipment dispatching and packing problems: a case study ⋮ Near real-time loadplan adjustments for less-than-truckload carriers ⋮ Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions ⋮ Service network design for freight transportation: a review ⋮ A first multilevel cooperative algorithm for capacitated multicommodity network design ⋮ A metaheuristic for stochastic service network design ⋮ 0-1 reformulations of the multicommodity capacitated network design problem ⋮ Planning models for freight transportation ⋮ Service network design in freight transportation ⋮ Planning models for long-haul operations of postal and express shipment companies ⋮ The single-node dynamic service scheduling and dispatching problem ⋮ CORRELATIONS IN STOCHASTIC PROGRAMMING: A CASE FROM STOCHASTIC SERVICE NETWORK DESIGN ⋮ About Lagrangian methods in integer optimization

Uses Software

• KORBX
• MINOS

This page was built for publication: Subgradient Methods for the Service Network Design Problem