An improved multi-directional local search algorithm for vehicle routing problem with time windows and route balance

Feng, Bin; Wei, Lixin

doi:10.1007/s10489-022-04061-7

Cited by 6 publications

(8 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The constraint (11) ensures that the vehicle works within its maximum load. The constraint (12) means that the subtour is eliminated. The constraint (13) provides a mutable limit.…”

Section: Objective Optimization Functionmentioning

confidence: 99%

“…The exact algorithm can obtain the optimal solution, but its high computational complexity makes it unsuitable for solving largescale VRPs [9][10][11]. Heuristic algorithms can be further divided into neighborhood-based algorithms and population-based algorithms [12][13][14]. The neighborhood-based algorithms maintain a single solution during the search process and seek a more optimal solution by iterating between neighborhood solutions according to the strategy.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Novel Multistrategy-Based Differential Evolution Algorithm and Its Application

Jin-yin¹,

Shang

Jing

et al. 2022

Electronics

View full text Add to dashboard Cite

To address the poor searchability, population diversity, and slow convergence speed of the differential evolution (DE) algorithm in solving capacitated vehicle routing problems (CVRP), a new multistrategy-based differential evolution algorithm with the saving mileage algorithm, sequential encoding, and gravitational search algorithm, namely SEGDE, is proposed to solve CVRP in this paper. Firstly, an optimization model of CVRP with the shortest total vehicle routing is established. Then, the saving mileage algorithm is employed to initialize the population of the DE to improve the initial solution quality and the search efficiency. The sequential encoding approach is used to adjust the differential mutation strategy to legalize the current solution and ensure its effectiveness. Finally, the gravitational search algorithm is applied to calculate the gravitational relationship between points to effectively adjust the evolutionary search direction and further improve the search efficiency. Four CVRPs are selected to verify the effectiveness of the proposed SEGDE algorithm. The experimental results show that the proposed SEGDE algorithm can effectively solve the CVRPs and obtain the ideal vehicle routing. It adopts better search speed, global optimization ability, routing length, and stability.

show abstract

“…The constraint (11) ensures that the vehicle works within its maximum load. The constraint (12) means that the subtour is eliminated. The constraint (13) provides a mutable limit.…”

Section: Objective Optimization Functionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Novel Multistrategy-Based Differential Evolution Algorithm and Its Application

Jin-yin¹,

Shang

Jing

et al. 2022

Electronics

View full text Add to dashboard Cite

show abstract

“…The way Bektaş and Letchford (2020) used to work out a solution toward fairness was to use a modified objective function that involves p -norms. Feng and Wei (2023) addressed different equity functions to balance distribution costs and workloads and achieve important nonmonetary benefits with a more equitable distribution scheme. In particular, for covering tour problems, Glize et al (2020) described the study of Oliveira et al (2015) as the first to propose a variant of m-CTP that incorporates balance to enhance fairness between patrolling cars concerning visit balancing.…”

Section: Introductionmentioning

confidence: 99%

“…The issue of fairness has been assessed for VRP through equity functions (Matl et al, 2019;Bektaş and Letchford, 2020;Feng and Wei, 2023). Matl et al (2019) studied the impact of the workload resource subject to the balancing by evaluating how different equity functions affect the resulting VRP solutions.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A flow‐based model for the multivehicle covering tour problem with route balancing

Ota,

Fiorotto,

Ghidini

et al. 2023

Int Trans Operational Res

View full text Add to dashboard Cite

This paper introduces a new flow‐based mathematical formulation for the multivehicle covering tour problem. This problem determines a set of vehicle routes for the available fleet; therefore, the total distance traveled is minimal. In the proposed mathematical formulation, each vertex represents a location of interest, and these vertices belong to three sets: vertices that can be visited; vertices that must be visited; and vertices that must be covered, in the sense that each vertex must be close to a visited vertex in a route. The proposed formulation aims to find solutions with balanced routes (all the routes with an equal or similar number of visited nodes) and extends the previous formulations proposed in the literature by considering a two‐index vehicle flow formulation with a decision variable to find the balanced routes. It constitutes an NP‐hard integer programming problem based on a two‐commodity flow model, which is solved by applying the branch‐and‐cut and biased random‐key genetic algorithms. This paper reports computational results for some adapted instances from TSPLIB to evaluate the efficiency of the proposed model. The computational results validate the branch‐and‐cut and genetic algorithms, whereby the latter performs better in large‐size instances with reduced computational runtime. Finally, the used approaches obtained competitive solutions compared to the literature.

show abstract

Solving the cooperative scheduling problem of muck transport under time-segment restriction in an entire region

Wang,

Liu,

Chen

et al. 2023

Appl Intell

View full text Add to dashboard Cite

An improved multi-directional local search algorithm for vehicle routing problem with time windows and route balance

Cited by 6 publications

References 32 publications

A Novel Multistrategy-Based Differential Evolution Algorithm and Its Application

A Novel Multistrategy-Based Differential Evolution Algorithm and Its Application

A flow‐based model for the multivehicle covering tour problem with route balancing

Solving the cooperative scheduling problem of muck transport under time-segment restriction in an entire region

Contact Info

Product

Resources

About