Complexity of routing problems with release dates and deadlines

DOI10.1016/j.ejor.2017.09.020zbMath1403.90163OpenAlexW2756654598MaRDI QIDQ1754053

Damián Reyes, Alan L. Erera, Savelsbergh, Martin W. P.

Publication date: 30 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.09.020

zbMATH Keywords

computational complexitydynamic programmingroutingdynamic deliveryrelease dates and deadlines

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Dynamic programming (90C39)

Related Items (9)

Simultaneous product and service delivery vehicle routing problem with time windows and order release dates ⋮ Multi-trip vehicle routing problem with order release time ⋮ An iterated local search for the traveling salesman problem with release dates and completion time minimization ⋮ The traveling salesman problem with release dates and drone resupply ⋮ Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery ⋮ The vehicle routing problem with release dates and flexible time windows ⋮ Heterogeneous instant delivery orders scheduling and routing problem ⋮ Optimization of two-echelon last-mile delivery via cargo tunnel and a delivery person ⋮ Dynamic traveling salesman problem with stochastic release dates

Cites Work

• Complexity of routing problems with release dates
• Dynamic pickup and delivery problems
• A dynamic vehicle routing problem with multiple delivery routes
• A review of dynamic vehicle routing problems

This page was built for publication: Complexity of routing problems with release dates and deadlines