Robust vehicle routing problem with hard time windows under demand and travel time uncertainty

Hu, Chenlian; Lu, Jie; Liu, X.; Zhang, G.

doi:10.1016/j.cor.2018.02.006

Cited by 107 publications

(56 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…100 * (P rof it CP LEX − P rof it GRASP ) P rof it GRASP (19) The new generated instances can be downloaded using this link: https://drive.google.com/drive/folders/ 1vFi5IgWH6S8LIrxZ0iwKhp7Ba41PqWy9?usp=sharing.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

A Robust Pickup and Delivery Problem with Uncertain Travel Time

Chami

Bechara

Manier

et al. 2018

2018 IEEE 30th International Conference on Tools With Artificial Intelligence (ICTAI)

View full text Add to dashboard Cite

This paper discusses a robust variant of the well known Pickup and Delivery Problem (PDP) which we called the Robust Selective PDP (RSPDP). In this problem, a fleet composed of several vehicles with a given capacity should satisfy a set of transportation requests while respecting various constraints in relation with the precedence between suppliers and customers, the capacity of vehicles, the opening and closing times of each site. Because of all these constraints, the honoring of all requests over a given period (for example, one day) is sometimes impossible so the selective aspect consists in choosing the sites to be served. This robust variant is characterized by the presence of different scenarios used to handle the uncertain traveling time for each arc. Subject to all scenarios and constraints, the goal is to find the best solution (with the higher profit) which validates all scenarios. This study introduces the mathematical formulation for this new variant. Then, an exact and a metaheuristic approaches will be used to solve it. Several tests have been done, on new generated instances for the considered problem, in order to show the efficiency of developed methods.

show abstract

Section: Resultsmentioning

confidence: 99%

“…So they finally offer a Pareto front to help decision makers. Recently, a two-stage algorithm based on a modified variable neighborhood search was developed to solve RVRP with demand and travel time uncertainties in [19].…”

Section: B Robust Routing Problemsmentioning

confidence: 99%

A Robust Pickup and Delivery Problem with Uncertain Travel Time

Chami

Bechara

Manier

et al. 2018

2018 IEEE 30th International Conference on Tools With Artificial Intelligence (ICTAI)

View full text Add to dashboard Cite

show abstract

“…Zhou et al suggested a location-routing problem with simultaneous home delivery and customer pickup [7]. Hu et al proposed a vehicle routing problem with hard time windows under demand and travel time uncertainty [8]. The object of the model is to minimize the number of vehicle routes and total travel distance.…”

Section: Last Mile Deliverymentioning

confidence: 99%

Pricing and Collaboration in Last Mile Delivery Services

Cho

Lee

2018

Sustainability

View full text Add to dashboard Cite

Recently, last mile delivery has emerged as an essential process that greatly affects the opportunity of obtaining delivery service market share due to the rapid increase in the business-to-consumer (B2C) service market. Express delivery companies are investing to expand the capacity of hub terminals to handle increasing delivery volume. As for securing massive delivery quantity by investment, companies must examine the profitability between increasing delivery quantity and price. This study proposes two strategies for a company’s decision making regarding the adjustment of market density and price by developing a pricing and collaboration model based on the delivery time of the last mile process. A last mile delivery time function of market density is first derived from genetic algorithm (GA)-based simulation results of traveling salesman problem regarding the market density. The pricing model develops a procedure to determine the optimal price, maximizing the profit based on last mile delivery time function. In addition, a collaboration model, where a multi-objective integer programming problem is developed, is proposed to sustain long-term survival for small and medium-sized companies. In this paper, sensitivity analysis demonstrates the effect of delivery environment on the optimal price and profit. Also, a numerical example presents four different scenarios of the collaboration model to determine the applicability and efficiency of the model. These two proposed models present managerial insights for express delivery companies.

show abstract

“…Chang [12] proposed the worst-case expected total flow time as the solution robustness criterion for the robust scheduling of a flowshop. Hu [13] took the travel time as the solution robustness criterion in scheduling vehicle routing.…”

Section: Introductionmentioning

confidence: 99%

A Construction Schedule Robustness Measure Based on Improved Prospect Theory and the Copula-CRITIC Method

Zhao

Wang

et al. 2020

Applied Sciences

View full text Add to dashboard Cite

A robustness measure is an effective tool to evaluate the anti-interference capacity of the construction schedule. However, most research focuses on solution robustness or quality robustness, and few consider a composite robustness criterion, neglecting the bounded rationality of subjective weights and inherent importance and nonlinear intercriteria correlations of objective weights. Therefore, a construction schedule robustness measure based on improved prospect theory and the Copula-criteria importance through intercriteria correlation (CRITIC) method is proposed. Firstly, a composite robustness criterion is established, including start time deviation rs and structural deviation rp for measuring solution robustness from project execution and completion probability rc for measuring quality robustness from the project result. Secondly, bounded rationality is considered, using prospect theory to calculate subjective weights, which is improved by the interval distance formula. Thirdly, the Copula-CRITIC method is proposed to determine objective weights incorporating both inherent importance and nonlinear intercriteria correlations. Finally, an information-entropy-based evidence reasoning method is applied to combine subjective and objective weights together while identifying their validity. An underground power station in China is used for a case study, whose robustness is measured using the proposed methods, single robustness criterion, and composite robustness criterion using traditional weighting methods. The comparison results verify the consistency, representativeness, and advantage of the proposed criterion and methods.

show abstract

Robust vehicle routing problem with hard time windows under demand and travel time uncertainty

Cited by 107 publications

References 51 publications

A Robust Pickup and Delivery Problem with Uncertain Travel Time

A Robust Pickup and Delivery Problem with Uncertain Travel Time

Pricing and Collaboration in Last Mile Delivery Services

A Construction Schedule Robustness Measure Based on Improved Prospect Theory and the Copula-CRITIC Method

Contact Info

Product

Resources

About