Appointment scheduling and routing optimization of attended home delivery system with random customer behavior
type: Item
instance of: scholarly article
title: Appointment scheduling and routing optimization of attended home delivery system with random customer behavior
zbMATH Open document ID: 1375.90125
author: Ling Zhao
author: Kui Chen
author: Zong-wei Luo
author: Deepa Mishra
author: Shuihua Han
published in: European Journal of Operational Research
publication date: 2017-12-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 6816195
zbMATH Keywords: logistics
zbMATH Keywords: attended home delivery
zbMATH Keywords: appointment scheduling
zbMATH Keywords: vehicle routing problem with time window
zbMATH Keywords: random customer behavior
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.03.060
OpenAlex ID: W2600345685
cites work: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
cites work: Machine scheduling with job delivery coordination
cites work: The truck dispatching problem
cites work: A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times
cites work: A new tabu search heuristic for the open vehicle routing problem
cites work: Scheduling Arrivals to Queues: A Single-Server Model with No-Shows
cites work: Minimizing Total Cost in Scheduling Outpatient Appointments
cites work: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
cites work: Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
cites work: Vehicle Routing
cites work: Scatter search for the vehicle routing problem with time windows
cites work: Q3156770
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: How to choose ``last mile'' delivery modes for E-fulfillment
cites work: A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
DOI: 10.1016/J.EJOR.2017.03.060
description: scientific article; zbMATH DE number 6816195