A hybrid estimation of distribution algorithm for the vehicle routing problem with time windows

Pérez-Rodríguez, Ricardo; Hernández-Aguirre, Arturo

doi:10.1016/j.cie.2019.02.017

Cited by 56 publications

(30 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Molina et al [21] propose an Ant Colony System (ACS) algorithm with local search for solving this problem. Perez-Rodriguez et al [22] propose an estimation of distribution algorithm for the problem. The algorithm uses the generalized Mallows distribution as a probability model to describe the distribution of the solution space.…”

Section: B Vrptwmentioning

confidence: 99%

An Improved Tabu Search Algorithm for the Stochastic Vehicle Routing Problem With Soft Time Windows

2020

IEEE Access

View full text Add to dashboard Cite

In real-world environments, vehicle travel and service time will be affected by unpredictable factors and present a random state. Because of this situation, this paper proposes the vehicle routing problem with soft time windows and stochastic travel and service time (SVRP-STW). The probability distribution of vehicle travel and service time are introduced into the model, and a stochastic programming model with modification is established to minimize the distribution cost. An Improved Tabu Search algorithm (I-TS) based on greedy algorithm is proposed, in which adaptive tabu length and neighborhood structure are introduced; the greedy algorithm is used instead of the random methods to generate the initial solution. Experiments on different scale instances prove the effectiveness and superiority of the proposed algorithm. INDEX TERMS Stochastic travel times, stochastic service times, soft time windows, stochastic programming model, tabu search.

show abstract

Section: B Vrptwmentioning

confidence: 99%

An Improved Tabu Search Algorithm for the Stochastic Vehicle Routing Problem With Soft Time Windows

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Once the fitness value of all individuals in the population list is calculated, it is summed up (line 3) in equation (11). Line 6 shows a fitness value is randomly selected from the total sum of fitness values using the equation (12).…”

Section: Figure 3 Individual (Chromosome)mentioning

confidence: 99%

“…However, the classical design of GA has its drawbacks [10], [11]. It is computationally expensive, requires parameter tuning and no guarantee of achieving the optimal result within a finite time [12], [13]. Despite these drawbacks, many applications still use GAs for deriving better solutions either by changing its internal structure [14], [15] or by combining with other algorithms [16], [17].…”

Section: Introductionmentioning

confidence: 99%

A Two-Phase Distributed Ruin-and-Recreate Genetic Algorithm for Solving the Vehicle Routing Problem With Time Windows

et al. 2020

View full text Add to dashboard Cite

Developing an algorithm that can solve the vehicle routing problem with time windows (VRPTW) and create near-optimal solutions with the least difference in magnitude is a challenging task. This task is evident from the fact that when an algorithm runs multiple times based on a given instance, the generated solutions deviate from each other and may not near-optimal. For this reason, an algorithm that can solve these problems is effective and highly sought after. This paper proposes a novel systematic framework using a two-phase distributed ruin-and-recreate genetic algorithm (RRGA). The two-phase consists of the RRGA phase and ruin-and-recreate (RR) phase, which is designed to run in the distributed computing environment that leveraging these networked resources. This combination of algorithms harnesses the strength of the search diversification and intensification, thereby producing very high-quality solutions. Experiments with Solomon's benchmark show the RRGA can produce results superior to the recently published hybrid algorithms, best-known solutions, and nine leading hybrid algorithms.

show abstract

“…Research on HazMat logistics problems is abundant and can be divided into three types: shortest path problems, dissimilar path problems and vehicle routing problems (VRP) [2]. As a common combinatorial optimisation problem in operations research, VRP has been widely applied in HazMat transportation problem (HTP) [3]. Dantzig and Ramser [4] proposed the first VRP for a gasoline transportation problem, the objective is to minimise the total shipment distance without considering the potential risk associated with the HazMat transportation.…”

Section: Introductionmentioning

confidence: 99%

Robust multi‐objective vehicle routing problem with time windows for hazardous materials transportation

Men

Jiang

et al. 2020

IET intell. transp. syst

View full text Add to dashboard Cite

A hybrid estimation of distribution algorithm for the vehicle routing problem with time windows

Cited by 56 publications

References 54 publications

An Improved Tabu Search Algorithm for the Stochastic Vehicle Routing Problem With Soft Time Windows

An Improved Tabu Search Algorithm for the Stochastic Vehicle Routing Problem With Soft Time Windows

A Two-Phase Distributed Ruin-and-Recreate Genetic Algorithm for Solving the Vehicle Routing Problem With Time Windows

Robust multi‐objective vehicle routing problem with time windows for hazardous materials transportation

Contact Info

Product

Resources

About