Time window optimization for attended home service delivery under multiple sources of uncertainties

DOI10.1016/j.cor.2022.106045OpenAlexW4306958185MaRDI QIDQ2108142

Haitham Seada, Babak Badri-Koohi, Xian Yu, Siqian Shen

Publication date: 19 December 2022

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

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

zbMATH Keywords

\(K\)-means clusteringstochastic mixed-integer programmingattended in-home servicevehicle routing with time window optimization

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• VRP

Cites Work

• Unnamed Item
• Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints
• The discrete time window assignment vehicle routing problem
• A 2-stage method for a field service routing problem with stochastic travel and service times
• A parallel matheuristic for the technician routing and scheduling problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• Separating capacity constraints in the CVRP using tabu search
• Home health care routing and scheduling: a review
• A branch-and-cut algorithm for the time window assignment vehicle routing problem
• Appointment scheduling and routing optimization of attended home delivery system with random customer behavior
• Vehicle routing and appointment scheduling with team assignment for home services
• Effective heuristic procedures for a field technician scheduling problem
• Minimum makespan vehicle routing problem with compatibility constraints
• Self-imposed time windows in vehicle routing problems
• Home service routing and appointment scheduling with stochastic service times
• An approximation algorithm for vehicle routing with compatibility constraints
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• What you should know about the vehicle routing problem
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations
• The General Pickup and Delivery Problem
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• The Traveling Salesman Problem: A Survey

This page was built for publication: Time window optimization for attended home service delivery under multiple sources of uncertainties