A memetic algorithm for a vehicle routing problem with backhauls

Tavakkoli–Moghaddam, Reza; Saremi, Alireza; Ziaee, Mohammad Sadegh

doi:10.1016/j.amc.2006.01.059

Cited by 55 publications

(26 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Brandao (2006) presents a tabu A C C E P T E D M A N U S C R I P T 4 search based procedure. Tavakkoli-Moghaddam et al (2006) and Saremi et al (2007) publish memetic algorithms. Neural network based approaches are presented in Ghaziri and Osman (2006).…”

Section: Metaheuristic Approaches For the Vrpcbmentioning

confidence: 97%

Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints

Bortfeldt

Hahn

Männel

et al. 2015

European Journal of Operational Research

View full text Add to dashboard Cite

Section: Metaheuristic Approaches For the Vrpcbmentioning

confidence: 97%

Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints

Bortfeldt

Hahn

Männel

et al. 2015

European Journal of Operational Research

View full text Add to dashboard Cite

“…The traditional study of the VRPB assumes that travel speed of the vehicle is constant, which is an approximation of real-world conditions in order to simplify the model of computing [2]. But in the real-world, this assumption is not very reasonable, especially in urban city conditions.…”

Section: Introductionmentioning

confidence: 97%

A novel two-phase heuristic method for vehicle routing problem with backhauls

Wang¹,

Wang²

2009

Computers & Mathematics with Applications

View full text Add to dashboard Cite

a b s t r a c tThis paper raises a novel two-phase heuristic method to solve vehicle routing problems with backhauls. Differing from other vehicle routing problems, we consider the travel speed of vehicle to be time dependent, which will be used for the model of rush hour in an urban city. In the first phase, the original solution is generated by extending traditional heuristic methods and in the second phase, the reactive tabu search algorithm is used to optimize the original solution. We verified that this algorithm is efficient in a number of standard test cases. After comparison with the closest neighboring search algorithm, we found that the results of two-phase heuristic methods are more reasonable.

show abstract

“…During the past few years, several efficient metaheuristics such as tabu searches [33][34][35], threshold accepting [36], ant systems [32], and memetic algorithms [1,[20][21][22]31] have been suggested for the problem. Applications of memetic algorithms to other routing problems can be found, e.g., in [9,16,19,37].…”

Section: Introductionmentioning

confidence: 99%

Edge assembly‐based memetic algorithm for the capacitated vehicle routing problem

Nagata¹,

Bräysy²

2009

Networks

View full text Add to dashboard Cite

Vehicle routing problems are at the heart of most decision support systems for real-life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e., fleet of vehicles) located at one or several points (e.g., depots, warehouses) to efficiently service a number of demand or supply points. In this article a new memetic algorithm is suggested for the standard capacitated vehicle routing problem. The proposed algorithm combines the edge assembly (EAX) crossover with wellknown local searches and allows for infeasible solutions with respect to capacity and route duration constraints after invoking the crossover. To address the constraint violation, an efficient modification algorithm is also suggested. Experimental tests on 47 standard benchmarks demonstrate that the suggested method is robust and competitive, finding new best-known solution to 20 wellstudied instances and repeating the existing best-known solution for 24 problems in a reasonable computing time.

show abstract

A memetic algorithm for a vehicle routing problem with backhauls

Cited by 55 publications

References 12 publications

Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints

Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints

A novel two-phase heuristic method for vehicle routing problem with backhauls

Edge assembly‐based memetic algorithm for the capacitated vehicle routing problem

Contact Info

Product

Resources

About