An online cost allocation model for horizontal supply chains

Dynamic vehicle routing with random requests: A literature review

“…For the papers which do not allow rejections, column ''PR'' is marked with ''-'' because no responses are sent to customers. A checkmark in parentheses in column ''REJ'' indicates that dynamic requests can only be implicitly rejected by offering customers high prices that are greater than their willingness-to-pay (Zou et al, 2021). Similarly, a ''(✓)'' in column ''DIV'' means that an implicit diversion strategy is adopted.…”

“…Some VRPDSR applications involve unpaired pickup and delivery requests, such as the one-to-many-to-one problems studied by Ninikas and Minis (2014) and Zhu et al (2016), but only pickup requests are accepted during the online phase. Zou et al (2021) study a VRPDSR based on a shared transportation system in which each vehicle is considered an individual service participant. Each time a customer places a dynamic request for collecting shipments, the system manager needs to properly allocate the service cost among vehicles and let the customer select a suitable vehicle to fulfill the request.…”

“…In most relevant papers, the decisions on acceptance or rejection are not immediately made upon request arrivals; instead, decision epochs are triggered at predefined time points or when a vehicle arrives at a customer location. In Table 2, only eight papers emphasize customer responsiveness: most of them run reoptimization procedures continuously, while Hong (2012), Zou et al (2021), andZhang et al (2022a) make immediate decisions each time a new request arrives. Unlike most of the relevant papers in which service providers make decisions explicitly, Zou et al (2021) propose several cost-sharing mechanisms which take customers' decisions into account.…”

“…In Table 2, only eight papers emphasize customer responsiveness: most of them run reoptimization procedures continuously, while Hong (2012), Zou et al (2021), andZhang et al (2022a) make immediate decisions each time a new request arrives. Unlike most of the relevant papers in which service providers make decisions explicitly, Zou et al (2021) propose several cost-sharing mechanisms which take customers' decisions into account. After placing a new request, the customer receives from the service provider an immediate response indicating its shared cost.…”

“…To convert an SVRP benchmark to a VRPDSR instance, the customer set should be divided into a subset of static requests and a subset of dynamic requests, and assumptions need to be made for the fleet size, planning horizon, the probability distribution of arrival times, etc. (see e.g., Ninikas and Minis, 2014;Zou et al, 2021). The interested reader is also referred to Kilby et al (1998) and Montemanni et al (2005) which present detailed methods of creating dynamic instances (DoD = 0.50) from SVRP benchmarks.…”