A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet

Ochi, Luiz Satoru; Vianna, Dalessandro Soares; Drummond, Lúcia Maria de A.; Victor, André O.

doi:10.1016/s0167-739x(98)00034-x

Cited by 76 publications

(29 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Osman and Salhi (1996) proposed two algorithms; the first one based on a tabu search and the second is a modification of RPERT. Ochi et al (1998) presented an evolutionary hybrid metaheuristic which combines a parallel genetic algorithm with scatter search. Gendreau et al (1999) implemented a tabu search approach using GENIUS, initially developed by Gendreau et al (1992) for the TSP, and some search strategies from Gendreau et al (1994) as well as the adaptive memory procedure originally developed for the VRP by Rochat and Taillard (1995).…”

Section: Introductionmentioning

confidence: 99%

A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem

Imran

Salhi

Wassan

2009

European Journal of Operational Research

123

View full text Add to dashboard Cite

The heterogeneous fleet vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra's algorithm based on a cost network constructed by the sweep algorithm and the 2-opt. Our VNS algorithm uses several neighborhoods which are adapted for this problem. In addition, a number of local search methods together with a diversification procedure are used. Two VNS variants, which differ in the order the diversification and Dijkstra's algorithm are used, are implemented. Both variants appear to be competitive and produce new best results when tested on the data sets from the literature. We also constructed larger data sets for which benchmarking results are provided for future comparison.

show abstract

Section: Introductionmentioning

confidence: 99%

A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem

Imran

Salhi

Wassan

2009

European Journal of Operational Research

123

View full text Add to dashboard Cite

show abstract

“…The neighborhood is defined with three different moves; single insertion, double insertion and swap, and the method uses intensification and diversification procedures and allows infeasible solutions with a penalty during the search. Other methods to solve the FSMVRP are presented by Ochi et al [107,108], and Han and Cho [77]. Ochi et al [107] developed a hybrid metaheuristic that uses genetic algorithms (GA) [80] and scatter search (SS) [85] coupled with a decomposition-into-petals procedure.…”

Section: Standard Fleet Size and MIX Vehicle Routing Problemmentioning

confidence: 99%

“…Ochi et al [107] developed a hybrid metaheuristic that uses genetic algorithms (GA) [80] and scatter search (SS) [85] coupled with a decomposition-into-petals procedure. The same method used with parallel genetic algorithms based on the island model is presented in Ochi et al [108]. The method shows advantages on some instances when compared to Taillard [137], although Ochi et al [107,108] only present the test results by a graph and do not report the exact values.…”

Section: Standard Fleet Size and MIX Vehicle Routing Problemmentioning

confidence: 99%

“…The same method used with parallel genetic algorithms based on the island model is presented in Ochi et al [108]. The method shows advantages on some instances when compared to Taillard [137], although Ochi et al [107,108] only present the test results by a graph and do not report the exact values. Han and Cho [77] introduce a generic intensification and diversification search metaheuristic that incorporates concepts from deterministic variants of simulated annealing like threshold accepting [48] and the great deluge algorithm [47], in addition to intensification and diversification strategies.…”

Section: Standard Fleet Size and MIX Vehicle Routing Problemmentioning

confidence: 99%

See 1 more Smart Citation

Industrial aspects and literature survey: Fleet composition and routing

Hoff

Andersson

Christiansen

et al. 2010

Computers & Operations Research

301

150

View full text Add to dashboard Cite

The purpose of this paper is to describe industrial aspects of combined fleet composition and routing in maritime and road-based transportation, and to present the current status of research in the form of a comprehensive literature review. With a backdrop of industrial aspects, a categorized survey of relevant literature since the first published papers in the 1950's is given. First, the literature review discusses some early seminal and application-oriented papers, presents a classification of problems, and then focuses on a basic definition of combined fleet composition and routing: the fleet size and mix vehicle routing problem. Three basic mathematical formulations from the literature are presented and compared. Further, the literature of extended and related problems is described and categorized. Surveys of application oriented research in road-based and maritime transportation conclude the review. Finally, we contrast the literature with aspects of industrial applications from a critical, but constructive stance. Major issues for future work are suggested.

show abstract

“…Then tabu search approaches for this problem family are developed in [11,12,13]. Ochi et al [14] propose Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2009) 10-12 August 2009, Dublin, Ireland a parallel genetic algorithm in conjunction of scatter search. Tarantilis et al [15,16] present a list-based threshold accepting metaheuristic where a randomly selected solution is accepted only if the difference between the cost of the new solution and the cost of the current one is less than a control parameter that is reduced during the search process in a non-monotonic schedule.…”

Section: Related Workmentioning

confidence: 99%

Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs

Ceschia

Gaspero

Schaerf

2010

J Sched

View full text Add to dashboard Cite

In this work we formalize a new complex variant of the classical vehicle routing problem arising from a real-world application. Our formulation includes a heterogeneous fleet, a multi-day planning horizon, a complex carrier-dependent cost function for the vehicles, and the possibility of leaving orders unscheduled.We propose a metaheuristic approach based on tabu search and on a complex combination of neighborhood relations. Finally, we perform an experimental analysis to tune and compare different combinations, highlighting the most important features of the algorithm.

show abstract

A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet

Cited by 76 publications

References 8 publications

A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem

A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem

Industrial aspects and literature survey: Fleet composition and routing

Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs

Contact Info

Product

Resources

About