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

DOI10.1016/J.COR.2012.03.002zbMATH Open1349.90219OpenAlexW1967336054MaRDI QIDQ339640FDOQ339640

Authors Esa Hyytiä, Aleksi Penttinen, Reijo Sulonen 

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

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

Recommendations

• Dynamic multi-objective optimization for multi-objective vehicle routing problem with real-time traffic conditions
• Time-dependent route planning with generalized objective functions
• Dynamic vehicle routing with time windows in theory and practice
• A dynamic vehicle routing problem with time-dependent travel times
• Vehicle routing and scheduling with dynamic travel times
• Design and Optimization of Dynamic Routing Problems with Time Dependent Travel Times
• Route choice model based on multi-objective in a real-time environment
• Vehicle routing problem with pick-up and delivery under dynamic travel times
• Vehicle routing with space- and time-correlated stochastic travel times: evaluating the objective function

Cites work

• scientific article; zbMATH DE number 4051339 (Why is no real title available?)
• scientific article; zbMATH DE number 192876 (Why is no real title available?)
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 1514781 (Why is no real title available?)
• scientific article; zbMATH DE number 1452996 (Why is no real title available?)
• scientific article; zbMATH DE number 3338194 (Why is no real title available?)
• scientific article; zbMATH DE number 3361678 (Why is no real title available?)
• A Proof for the Queuing Formula: L = λW
• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• A general heuristic for vehicle routing problems
• A simple dynamic routing problem
• A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
• Dynamic pickup and delivery problems
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Optimality of the shortest line discipline
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• The General Pickup and Delivery Problem
• The dial-a-ride problem: Models and algorithms

Cited in

(7)

• Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems
• Comparison of anticipatory algorithms for a dial-a-ride problem
• New optimization guidance for dynamic dial-a-ride problems
• A stochastic model for a vehicle in a dial-a-ride system
• Reference policies for non-myopic sequential network design and timing problems
• Typology and literature review for dial-a-ride problems
• Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects

This page was built for publication: Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339640)