The min–max split delivery multi-depot vehicle routing problem with minimum service time requirement

Wang, Xingyin; Golden, Bruce L.; Wasil, Edward; Zhang, Rui

doi:10.1016/j.cor.2016.01.008

Cited by 27 publications

(13 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A variant of the MDVRP, the min-max Split Delivery MDVRP with Minimum Service Time Requirement (min-max SDMDVRP-MSTR) was solved using a heuristic approach by Wang et al which operates in the following three stages (X. Wang et al, 2016). 1) Initialize a feasible solution without splits 2) Improve the longest routes by splitting service times 3) Ensure all minimum service time requirements are satisfied A novel real life problem related to heterogeneous fleet, a Multi-Depot Multi-Period VRP was studied in (Mancini, 2016) by Simona Mancini.…”

Section: Heuristic and Meta-heuristic Methodsmentioning

confidence: 99%

Five years of multi-depot vehicle routing problems

Jayarathna¹,

Lanel

Juman

2020

J. sustain. dev. transp. logist.

View full text Add to dashboard Cite

show abstract

Section: Heuristic and Meta-heuristic Methodsmentioning

confidence: 99%

Five years of multi-depot vehicle routing problems

Jayarathna¹,

Lanel

Juman

2020

J. sustain. dev. transp. logist.

View full text Add to dashboard Cite

show abstract

“…However, depending on the problem, additional assumptions, and restrictions on vehicle paths, such as time windows or repeated visits at certain vertices, can be presented. Wang et al [7] proposed an exact method and a constructive heuristic approach from the min-max split delivery multi-depot vehicle routing problem with a minimum service time requirement. In this problem, each customer requires a specified amount of service time.…”

Section: Literature Reviewmentioning

confidence: 99%

A Hybrid and Self-Adaptive Differential Evolution Algorithm for the Multi-Depot Vehicle Routing Problem in Egg Distribution

et al. 2021

View full text Add to dashboard Cite

This paper presents the Hybrid and Self-Adaptive Differential Evolution algorithms (HSADE) to solve an egg distribution problem in Thailand. We introduce and formalize a model for a multi-product, multi-depot vehicle routing problem with a time window, a heterogeneous fleet and inventory restrictions. The goal of the problem is to minimize the total cost. The multiple products comprise customers’ demands with different egg sizes. This paper presents a Mixed Integer Linear Programming (MILP) model, an initial solution-based constructive heuristic, a new self-adaptive mutation strategy, and a neighborhood search structure with the probability to improve DE. The two measurements of criteria are the heuristic performance (HP) compared with the solution obtained by MILP and the relative improvement (RI) of the solution compared with Thailand’s current egg distribution practice. The computational results show that the performance of HSADE is better than the current practice, and HSADE can provide on average a 14.13% improvement in total cost. Additionally, our proposed algorithm can be applied to similar agriculture logistics in Thailand and worldwide.

show abstract

“…Oliveira et al [28] decomposed the problem into subproblems with a single depot, simultaneously obtained the partial solutions and formed a complete solution to the problem via the proposed method similarly to that of GA and local search. Wang et al [29] solved split delivery MDVRP with minimum service time requirement. Their objective is to minimize the duration of the longest route.…”

Section: Literature Reviewmentioning

confidence: 99%

Minimum total distance clustering and balanced distance clustering in northern Thailand's corn crop residue management system

Phonin¹,

Likasiri²

2019

4open

View full text Add to dashboard Cite

The authors study the corn crop residue management system for 16 provinces in northern Thailand encompassing 127 agricultural cooperatives (co-ops), 974 corn fields and 274 customers. To solve the system's problems, we find clusters where co-ops will pick up crop residues from corn fields, process them into biomass fuel and sell the fuel to customers. Each cluster consists of a co-op, a set of corn fields and a set of customers, the latter two being on separate routes from the co-op. To minimize the system's transportation cost and balance transportation cost between clusters, we propose a mathematical model with two objective functions, construct two heuristics, and apply the two heuristics to solve the problem.

show abstract

The min–max split delivery multi-depot vehicle routing problem with minimum service time requirement

Cited by 27 publications

References 18 publications

Five years of multi-depot vehicle routing problems

Five years of multi-depot vehicle routing problems

A Hybrid and Self-Adaptive Differential Evolution Algorithm for the Multi-Depot Vehicle Routing Problem in Egg Distribution

Minimum total distance clustering and balanced distance clustering in northern Thailand's corn crop residue management system

Contact Info

Product

Resources

About