Abstract
Purpose
The purpose of this paper is to present a specific variant of vehicle routing problem with simultaneous full pickup and delivery problem (VRPSFPD) known as one-to-many-to-one (1-M-1) problem with several vehicles, where every customer can receive and send goods simultaneously, which has added the notion of the totality for the pickup goods. Currently, hybrid metaheuristics have become more popular because they offer the best solutions to several combinatorial optimization problems. Therefore, due to the complexity of 1-M-1 a hybrid genetic algorithm with variable neighborhood descent (HGAVND) local search is proposed. To improve the solution provided by the HGAVND the authors suggest applying a structure OR-Opt. To test the performance of the algorithm the authors have used a set of benchmarks from the literature and apply the HGAVND algorithm to solve the real case of distribution of soft drink in Tunisia. The experimental results indicate that the algorithm can outperform all other algorithms proposed in literature with regard to solution quality and processing time. Moreover, the authors improve the best known solution of the majority of benchmark instances taken from the literature.
Design/methodology/approach
Due to the complexity of 1-M-1 a HGAVND local search is proposed.
Originality/value
First, in the presence of full pickup constraints, the problem becomes more complex, this implies that the choice of a good metaheuristic can provide good results. Second, the best contribution consists in a specific variant of VRPSFPD problem as 1-M-1 which the paper present the first application of metaheuristics to solve the specific 1-M-1 and to apply it in real case of distribution of soft drink.
Subject
Management Science and Operations Research,General Business, Management and Accounting
Reference42 articles.
1. Angelelli, E. and Mansini, R. (2002), “The vehicle routing problem with time windows and simultaneous pick-up and delivery”, in Klose, A., Speranza, M.G. and Van Wassenhove, L.N. (Eds), Quantitative Approaches to Distribution Logistics and Supply Chain Management, Springer, Berlin, pp. 249-267.
2. The general EOQ problem with vehicle routing costs;European Journal of Operations Research,1994
3. The vehicle routing problem with delivery and back-haul options;Naval Research Logistics,1996
4. Augerat, P., Belenguer, J.M., Benavent, E., Corberan, A., Naddef, D. and Rinaldi, G. (1995), “Computational results with a branch-and-cut code for the capacitated vehicle routing problem”, Research Report No. 949-M, Universite Joseph Fourier, Grenoble.
5. An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries;Computers & Industrial Engineering,2015
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献