Routing Courier Delivery Services with Urgent Demand
From MaRDI portal
Publication:6160118
DOI10.3138/infor.53.1.26OpenAlexW2322772548MaRDI QIDQ6160118
No author found.
Publication date: 9 May 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3138/infor.53.1.26
Cites Work
- Unnamed Item
- An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
- A GA based heuristic for the vehicle routing problem with multiple trips
- The multi-shift vehicle routing problem with overtime
- Stochastic vehicle routing
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
- The periodic vehicle routing problem with intermediate facilities
- A review of dynamic vehicle routing problems
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A variable neighborhood search heuristic for periodic routing problems
- Stochastic Vehicle Routing Problem with Restocking
- Quantifying the benefits of route reoptimisation under stochastic customer demands
- The multi-trip vehicle routing problem
- A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
- A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- Vehicle Routeing with Multiple Use of Vehicles
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- Computer Solutions of the Traveling Salesman Problem
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: Routing Courier Delivery Services with Urgent Demand
