Abstract
Article history: Received March 25, 2015 Received in revised format August 6 2015 Accepted August 21 2015 Available online August 29 2015 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 © 201
Highlights
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 (Archetti et al, 2006; Anh, 2014)
Belenguer et al (2000) presented a lower bound for the split delivery vehicle routing problem and Moreno et al (2010) improved the lower bounds for the split delivery vehicle routing problem
Archetti et al (2014) presented two exact branch-andcut algorithms for the Split delivery vehicle routing problem (SDVRP) based on two relaxed formulations that provide lower bounds to the optimum
Summary
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 (Archetti et al, 2006; Anh, 2014). Jin et al (2008), for instance, presented a column generation approach for the Split delivery vehicle routing problem (SDVRP). Stålhane et al (2012) offered a branch-price-and-cut method for a ship routing and scheduling problem with split loads. Archetti et al (2006) presented a tabu search algorithm for the split delivery vehicle routing problem. Archetti and Speranza (2012) considered vehicle routing problems with split deliveries. Stålhane et al (2012) offered a branch-price-and-cut method for a ship routing and scheduling problem with split loads. Belenguer et al (2000) presented a lower bound for the split delivery vehicle routing problem and Moreno et al (2010) improved the lower bounds for the split delivery vehicle routing problem. Archetti et al (2006) presented a tabu search algorithm for the split delivery vehicle routing problem. Archetti and Speranza (2012) considered vehicle routing problems with split deliveries. Archetti et al (2014) presented two exact branch-andcut algorithms for the SDVRP based on two relaxed formulations that provide lower bounds to the optimum. Boudia et al (2007) offered an effective memetic algorithm with population management for
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
