Routing Courier Delivery Services with Urgent Demand

DOI10.3138/INFOR.53.1.26MaRDI QIDQ6160118zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

heuristicsmulti-tripstochastic vehicle routingtime windows

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• City-courier routing and scheduling problems
• scientific article; zbMATH DE number 2130493
• A solution method for a two-dispatch delivery problem with stochastic customers
• A dynamic multi-period general routing problem arising in postal service and parcel delivery systems
• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service

Cites work

• A GA based heuristic for the vehicle routing problem with multiple trips
• A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• A review of dynamic vehicle routing problems
• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
• A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
• A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
• A variable neighborhood search heuristic for periodic routing problems
• A Vehicle Routing Problem with Stochastic Demand
• An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• Computer Solutions of the Traveling Salesman Problem
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Quantifying the benefits of route reoptimisation under stochastic customer demands
• Stochastic vehicle routing
• Stochastic vehicle routing problem with restocking
• The multi-shift vehicle routing problem with overtime
• The multi-trip vehicle routing problem
• The periodic vehicle routing problem with intermediate facilities
• Vehicle Routeing with Multiple Use of Vehicles

Cited in

(1)

• Aggregating courier deliveries

This page was built for publication: Routing Courier Delivery Services with Urgent Demand

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