 Saving based algorithm for multi-depot version of vehicle routing problem with simultaneous pickup and deliveryY. Gajpal and P.L. Abad International Journal of Enterprise Network Management, 2009, vol. 3, issue 3, 201-222 Abstract: The paper presents saving based algorithm for the multi-depot version of VRPSPD. We developed four saving based algorithms for the problem. These algorithms are: 1) partition based algorithm; 2) nearest depot algorithm; 3) saving algorithm; 4) Tillman's saving algorithm. In the saving heuristics, a new route is created by merging two routes. Checking the feasibility of new route obtained after merging two routes is difficult because of the fluctuating load on the route. We use cumulative-net pick approach for checking the feasibility when two existing routes are merged. Numerical experiment is performed on benchmark problem instances available in literature. The numerical results show that the performance of the proposed heuristics is qualitatively better than the existing insertion based heuristics. Keywords: vehicle routing problems; transportation; multi-depots; simultaneous pickup; simultaneous delivery; VRPSPD; partition based algorithms; nearest depot algorithms; Tillman; saving algorithms; route mergers; fluctuating loads; cumulative-net pick approach; insertion based heuristics; enterprise network management; data analysis; SCM; supply chain management. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijenma:v:3:y:2009:i:3:p:201-222 Access Statistics for this article More articles in International Journal of Enterprise Network Management from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.