Time window optimization for attended home service delivery under multiple sources of uncertainties
type: Item
instance of: scholarly article
title: Time window optimization for attended home service delivery under multiple sources of uncertainties
author: Xian Yu
author: Siqian Shen
author: Babak Badri-Koohi
author: Haitham Seada
published in: Computers \& Operations Research
publication date: 2022-12-19T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7634089
zbMATH Keywords: stochastic mixed-integer programming
zbMATH Keywords: attended in-home service
zbMATH Keywords: vehicle routing with time window optimization
zbMATH Keywords: \(K\)-means clustering
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.cor.2022.106045
OpenAlex ID: W4306958185
cites work: Separating capacity constraints in the CVRP using tabu search
cites work: The Traveling Salesman Problem: A Survey
cites work: Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
cites work: A 2-stage method for a field service routing problem with stochastic travel and service times
cites work: A branch-and-cut algorithm for the time window assignment vehicle routing problem
cites work: Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
cites work: Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
cites work: Home health care routing and scheduling: a review
cites work: Appointment scheduling and routing optimization of attended home delivery system with random customer behavior
cites work: Self-imposed time windows in vehicle routing problems
cites work: Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations
cites work: The vehicle routing problem: An overview of exact and approximate algorithms
cites work: What you should know about the vehicle routing problem
cites work: A parallel matheuristic for the technician routing and scheduling problem
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
cites work: The General Pickup and Delivery Problem
cites work: Q3244478
cites work: The discrete time window assignment vehicle routing problem
cites work: Effective heuristic procedures for a field technician scheduling problem
cites work: Minimum makespan vehicle routing problem with compatibility constraints
cites work: An approximation algorithm for vehicle routing with compatibility constraints
cites work: Vehicle routing and appointment scheduling with team assignment for home services
cites work: Home service routing and appointment scheduling with stochastic service times
DOI: 10.1016/J.COR.2022.106045
description: scientific article; zbMATH DE number 7634089