The Continuous-Time Service Network Design Problem
From MaRDI portal
Publication:4598647
DOI10.1287/opre.2017.1624zbMath1380.90069OpenAlexW2737966930MaRDI QIDQ4598647
Luke Marshall, Savelsbergh, Martin W. P., Mike Hewitt, Natashia Boland
Publication date: 15 December 2017
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ba4d2d1be7984eae6376aa83f2ac38961953b284
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (26)
Layered graph approaches for combinatorial optimization problems ⋮ Scheduling activities with time-dependent durations and resource consumptions ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems ⋮ A General Branch-and-Cut Framework for Rotating Workforce Scheduling ⋮ The transit time constrained fixed charge multi-commodity network design problem ⋮ Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes ⋮ A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem ⋮ Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery ⋮ Optimizing the changing locations of mobile parcel lockers in last-mile distribution ⋮ Mathematical formulations for multi-period network design with modular capacity adjustments ⋮ An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem ⋮ An exact algorithm for the service network design problem with hub capacity constraints ⋮ A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation ⋮ Scalable timing-aware network design via Lagrangian decomposition ⋮ A continuous‐time service network design and vehicle routing problem ⋮ A hybrid algorithm for large-scale service network design considering a heterogeneous fleet ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries ⋮ Perspectives on integer programming for time-dependent models ⋮ Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design ⋮ An exact algorithm for a class of geometric set-cover problems ⋮ Fleet management for autonomous vehicles using flows in time-expanded networks ⋮ Models and algorithms for the traveling salesman problem with time-dependent service times ⋮ Solving a dial-a-flight problem using composite variables ⋮ An iterative graph expansion approach for the scheduling and routing of airplanes
This page was built for publication: The Continuous-Time Service Network Design Problem
