The collaborative consistent vehicle routing problem with workload balance

Mancini, Susanna; Gansterer, Margaretha; Hartl, Richard F.

doi:10.1016/j.ejor.2020.12.064

Cited by 60 publications

(25 citation statements)

References 59 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results show that workload equity among drivers can be achieved at a reasonable cost. Finally, Mancini et al (2021) recently considered workload balance and service consistency in a collaborative multi-period VRP, where the number of clients assigned to a carrier over the planning horizon is constrained. They also examined how workload balance and service consistency impact the total solution cost.…”

Section: Related Studiesmentioning

confidence: 99%

Workload Equity in Multi-Period Vehicle Routing Problems

Nekooghadirli¹,

Gendreau²,

Potvin³

et al. 2022

Preprint

View full text Add to dashboard Cite

An equitable distribution of workload is essential when deploying vehicle routing solutions in practice. For this reason, previous studies have formulated vehicle routing problems with workload-balance objectives or constraints, leading to trade-off solutions between routing costs and workload equity. These methods consider a single planning period; however, equity is often sought over several days in practice. In this work, we show that workload equity over multiple periods can be achieved without impact on transportation costs when the planning horizon is sufficiently large.To achieve this, we design a two-phase method to solve multi-period vehicle routing problems with workload balance. Firstly, our approach produces solutions with minimal distance for each period.Next, the resulting routes are allocated to drivers to obtain equitable workloads over the planning horizon. We conduct extensive numerical experiments to measure the performance of the proposed approach and the level of workload equity achieved for different planning-horizon lengths. For horizons of five days or more, we observe that near-optimal workload equity and optimal routing costs are jointly achievable.

show abstract

Section: Related Studiesmentioning

confidence: 99%

Workload Equity in Multi-Period Vehicle Routing Problems

Nekooghadirli¹,

Gendreau²,

Potvin³

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…e collaboration and resource sharing of logistics facilities in a logistics network attracts researchers and practitioners as they contribute to cost savings and efficiency improvement [23,24]. In recent years, many scholars have studied the collaboration and resource sharing of logistics facilities in the MDVRP with simultaneous pickup and delivery problems (PDP) [25,26].…”

Section: Collaboration and Logistics Resource Sharingmentioning

confidence: 99%

“…and(24) ensure that a delivery vehicle serving DCs' customers originates from a DC to serve customers and returns to the DC when it completed a task. Constraint(25) imposes the balance of delivery vehicles entering and leaving the delivery customers served by DCs.…”

mentioning

confidence: 99%

Two-Echelon Multidepot Logistics Network Design with Resource Sharing

Luo

Wang

Tang

et al. 2021

Journal of Advanced Transportation

View full text Add to dashboard Cite

Resource sharing within a logistics network offers an effective way to solve problems resulting from inefficient and costly operations of individual logistics facilities. However, the existing analysis of resource sharing and profit allocation is still limited. Therefore, this study aims to model resource sharing in two-echelon delivery and pickup logistics networks to improve the overall efficiency and decrease the total network operating cost. A bi-objective integer programming model is first proposed for two-echelon collaborative multidepot pickup and delivery problems with time windows (2E-CMDPDTW) to seek the minimization of operating costs and number of vehicles. Integrating a customer clustering algorithm, a greedy algorithm, and an improved nondominated sorting genetic algorithm-II (Im-NSGA-II), a hybrid method is then designed to handle the 2E-CMDPDTW model. The customer clustering and the greedy algorithms are employed to generate locally optimized initial solutions to accelerate the calculating velocity and guarantee the diversity of feasible solutions. The Im-NSGA-II combines the order crossover operation and the polynomial mutation process to find the optimal solution of the 2E-CMDPDTW. The comparative results show that the proposed hybrid method outperforms the NSGA-II and the multiobjective genetic algorithm. Furthermore, a Shapley value method is used for allocating total profits of established alliances and finding an optimal coalition sequence of the logistics facilities joining alliances based on the strictly monotonic path strategy. Finally, a case study of 2E-CMDPDTW in Chongqing China is conducted to validate the feasibility. Results indicate that this study contributes to long-term partnerships between logistics facilities within multi-echelon logistics networks in practice and contributes to the long-term sustainability of urban logistics pickup and delivery networks’ development.

show abstract

“…Recently, Haniyeh and Rahmati [42] addressed the algorithms for the load-balanced capacitated vehicle routing problem. Mancini et al [43] examined the collaborative vehicle routing problem with time and service consistency and workload balance. ey found that workload balancing will benefit in collaborating among carriers almost without additional cost.…”

Section: Introductionmentioning

confidence: 99%

A Biobjective Vehicle Routing Problem with Stochastic Demand and Split Deliveries

Zhou

Zhang

et al. 2022

Scientific Programming

View full text Add to dashboard Cite

This study addresses a biobjective vehicle routing problem with stochastic demand and split deliveries. Apart from minimizing the total travel cost that is widely considered in classical vehicle routing problems, we aim to balance the workload of all routes. A recourse policy for paired vehicles that allows the distribution service to fail once and meet part of the demand of customers first is provided. To solve the proposed biobjective vehicle routing problem, an adaptive large neighborhood search embedded with an improved optimization method is developed. The objective value is calculated based on the normalized values of two goals using the improved weighted sum approach. To evaluate the proposed optimization model and corresponding algorithm, some experiments modified from Solomon’s instances are conducted. Computational results show that the performance of the proposed heuristic approach is effective.

show abstract

The collaborative consistent vehicle routing problem with workload balance

Cited by 60 publications

References 59 publications

Workload Equity in Multi-Period Vehicle Routing Problems

Workload Equity in Multi-Period Vehicle Routing Problems

Two-Echelon Multidepot Logistics Network Design with Resource Sharing

A Biobjective Vehicle Routing Problem with Stochastic Demand and Split Deliveries

Contact Info

Product

Resources

About