Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives

DOI10.1016/j.cor.2012.03.002zbMath1349.90219OpenAlexW1967336054MaRDI QIDQ339640

Reijo Sulonen, Aleksi Penttinen, Esa Hyytiä

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.03.002

zbMATH Keywords

vehicle routingdynamic DARPM/M/1 queueMDP

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)

Related Items

Reference policies for non-myopic sequential network design and timing problems ⋮ Comparison of anticipatory algorithms for a dial-a-ride problem ⋮ Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems ⋮ Typology and literature review for dial-a-ride problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general heuristic for vehicle routing problems
• Dynamic pickup and delivery problems
• A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
• The dial-a-ride problem: Models and algorithms
• A Proof for the Queuing Formula: L = λW
• A simple dynamic routing problem
• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• Optimality of the shortest line discipline
• The General Pickup and Delivery Problem
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline