A queueing framework for routing problems with time-dependent travel times

DOI10.1007/s10852-006-9054-1zbMath1255.90050OpenAlexW2043356830MaRDI QIDQ2369970

Laoucine Kerbache, Herbert Peremans, Nico J. Vandaele, Tom Van Woensel

Publication date: 21 June 2007

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/670326fd-fbe9-4ee1-a05f-dc6f143bfe3b

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (6)

Dealing with time in the multiple traveling salespersons problem with moving targets ⋮ MODELING TRAFFIC FLOWS WITH QUEUEING MODELS: A REVIEW ⋮ Impact analysis of travel time uncertainty on AGV catch-up conflict and the associated dynamic adjustment ⋮ A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping ⋮ Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries ⋮ A stochastic approach to traffic congestion costs

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Empirical validation of a queueing approach to uninterrupted traffic flows
• Validating state-dependent queueing models for uninterrupted traffic flows using simulation
• The vehicle routing problem: An overview of exact and approximate algorithms
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
• Stochastic vehicle routing
• General local search methods
• Separating capacity constraints in the CVRP using tabu search
• An improved ant system algorithm for the vehicle routing problem
• Vehicle dispatching with time-dependent travel times
• A computer assistant for vehicle dispatching with learning capabilities
• Sensitivity Analysis for Mean-Variance Portfolio Problems
• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• Modeling Vehicular Traffic Flow using M/G/C/C State Dependent Queueing Models
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Robust Optimization of Large-Scale Systems
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• Dynamic Vehicle Dispatching: Optimal Heavy Traffic Performance and Practical Insights
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers

This page was built for publication: A queueing framework for routing problems with time-dependent travel times