A Genetic Algorithm for the Split Delivery Vehicle Routing Problem

Wilck, Joseph; Cavalier, Tom M.

doi:10.4236/ajor.2012.22024

Cited by 31 publications

(24 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It can be observed that SplitILS was capable of improving the result of 243 instances and equal the result of another 55. [38]. e Moreno et al [28].…”

Section: Summary Of the Resultsmentioning

confidence: 96%

See 1 more Smart Citation

An iterated local search heuristic for the split delivery vehicle routing problem

Silva

Subramanian

Ochi

2015

Computers & Operations Research

122

View full text Add to dashboard Cite

a b s t r a c tThis paper concerns the Split Delivery Vehicle Routing Problem (SDVRP). This problem is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) since the customers' demands are allowed to be split. We deal with the cases where the fleet is unlimited (SDVRP-UF) and limited (SDVRP-LF). In order to solve them, we implemented a multi-start Iterated Local Search (ILS) based heuristic that includes a novel perturbation mechanism. Extensive computational experiments were carried out on benchmark instances available in the literature. The results obtained are highly competitive, more precisely, 55 best known solutions were equaled and new improved solutions were found for 243 out of 324 instances, with an average and maximum improvement of 1.15% and 2.81%, respectively.

show abstract

“…It can be observed that SplitILS was capable of improving the result of 243 instances and equal the result of another 55. [38]. e Moreno et al [28].…”

Section: Summary Of the Resultsmentioning

confidence: 96%

“…More recently, Wilck IV and Cavalier [37] developed a two-phase constructive procedure for the SDVRP-LF. They also proposed a Genetic Algorithm [38] for the same variant.…”

Section: Related Workmentioning

confidence: 98%

An iterated local search heuristic for the split delivery vehicle routing problem

Silva

Subramanian

Ochi

2015

Computers & Operations Research

122

View full text Add to dashboard Cite

show abstract

“…It is not hard to find that the value of [ min , max ] has not much influence on solutions, and average gap between [2,4], when 40 < / ≤ 100, the value is [3,5] or [3,6], and when / is more than 100, the value is [3,7].…”

Section: Computational Experimentsmentioning

confidence: 99%

“…In common sense, Vehicle Routing Problem is defined as follows: how to determine appropriate delivery routes between series of collection and reception terminals and guarantee delivery vehicles in a proper order, so as to satisfy some requirements (e.g., shortest distance, minimum cost, delivery time, and needed vehicles) within kinds of constraints, such as amount of goods, sending time, vehicle capacity, mileage restriction, and time limitation. Currently, VRPs have been identified in many applications, such as products outbound distribution scheduling [1], home care crew scheduling [2], newspaper delivery [3], school bus routing [4], cargo routing [5], airline crew scheduling [6], waste collection scheduling [7], service system design [8], and computer system integration [9].…”

Section: Introductionmentioning

confidence: 99%

A Framing Link Based Tabu Search Algorithm for Large-Scale Multidepot Vehicle Routing Problems

Zhang

Zhong

Liu

et al. 2014

Mathematical Problems in Engineering

View full text Add to dashboard Cite

A framing link (FL) based tabu search algorithm is proposed in this paper for a large-scale multidepot vehicle routing problem (LSMDVRP). Framing links are generated during continuous great optimization of current solutions and then taken as skeletons so as to improve optimal seeking ability, speed up the process of optimization, and obtain better results. Based on the comparison between pre- and postmutation routes in the current solution, different parts are extracted. In the current optimization period, links involved in the optimal solution are regarded as candidates to the FL base. Multiple optimization periods exist in the whole algorithm, and there are several potential FLs in each period. If the update condition is satisfied, the FL base is updated, new FLs are added into the current route, and the next period starts. Through adjusting the borderline of multidepot sharing area with dynamic parameters, the authors define candidate selection principles for three kinds of customer connections, respectively. Link split and the roulette approach are employed to choose FLs. 18 LSMDVRP instances in three groups are studied and new optimal solution values for nine of them are obtained, with higher computation speed and reliability.

show abstract

“…Derigs et al (2010) and Wen et al (2015) presented a local search-based metaheuristics for the SDVRP. Wilck IV et al (2012) offered a genetic algorithm for the split delivery vehicle routing problem while Khmelev and Kochetov (2015) built a hybrid VND method for this problem. Zhang et al (2012) studied SDVRP for emergency logistics and proposed an evolutionary heuristic approach to solve such problem.…”

Section: Introductionmentioning

confidence: 99%

A new memetic algorithm for solving split delivery vehicle routing problem

Bozorgi-Amiri¹,

Mahmoodian²,

Fahimnia³

et al. 2015

10.5267/j.msl

View full text Add to dashboard Cite

Split delivery vehicle routing problem is one of the traditional types of routing problems in which the demand of different points can be divided among vehicles and the objective is to minimize the path length, which vehicles travel. In this paper, fuel cost of vehicles which is assumed to be dependent on their traveled path and load is considered as the objective functions. Namely, the cost of the consumed fuel is proportionate to the unit of load carried per unit of distance. In order to solve the proposed model a new memetic algorithm is developed which has two rows. The performance of the proposed algorithm for 21 standard problems is compared with the optimum solutions obtained from mathematical programming standard solver and the solutions of the same algorithm with single row solution representation. The results express the efficiency of developed algorithm.Growing Science Ltd. All rights reserved. 5

show abstract

A Genetic Algorithm for the Split Delivery Vehicle Routing Problem

Cited by 31 publications

References 37 publications

An iterated local search heuristic for the split delivery vehicle routing problem

An iterated local search heuristic for the split delivery vehicle routing problem

A Framing Link Based Tabu Search Algorithm for Large-Scale Multidepot Vehicle Routing Problems

A new memetic algorithm for solving split delivery vehicle routing problem

Contact Info

Product

Resources

About