ARTÍCULOS
Description of the classification of publications and the models used in solving of the vehicle routing problem with pickup and delivery
Descripción de la clasificación de publicaciones y los modelos utilizados en la solución del problema de enrutamiento vehicular con entregas y recogidas
Pedro Pablo Ballesteros Silva*; Antonio Hernando Escobar Zuluaga**
* Dr. (c), Profesor Titular, Coordinador Especialización en Logística Empresarial, Facultad de Tecnología, Universidad Tecnológica de Pereira. Colombia. Grupo Logística: estrategia de la cadena de suministro. Email: ppbs@utp.edu.co
** Dr., Profesor Titular, Facultad de Tecnología, Universidad Tecnológica de Pereira. Colombia. Email: aescobar@utp.edu.co
Recibido: 28/09/2015
Aceptado: 11/12/2015
ABSTRACT
It is presented in this review paper, the description of the state of the art of the vehicle routing problem with pickups and deliveries, VRPPD, product obtained from the literature review of most of the models reported in the international technical literature and used for many years by specialized researchers in the field. This classification considers the different solution methods, the treatment of the problem in time and future trends of the same in its formulation and proposal of new methods of solution, as the metaheuristics caused by the complexity of the problem. Finally, several elements are left to make a discussion about existing and available tools for solving this problem
KEY WORDS
complexity of the problem, mathematical programming, methods of solution, modeling tools, vehicle routing problem with delivery and pickups, future trends and treatment of the problem.
RESUMEN
Esta revisión presenta la descripción del estado de arte del problema de enrutamiento vehicular con entregas y recogidas (VRPPD), producto obtenido de la revisión de literatura de la mayoría de modelos reportados en la literatura técnica internacional y utilizados por muchos años por investigadores especializados en el campo. Esta clasificación considera los diferentes métodos de solución, el tratamiento del problema en el tiempo y las futuras tendencias del mismo en cuanto a su formulación y propuesta de nuevos métodos de solución como la metaheurística causada por la complejidad del problema. Finalmente, se dejan para discusión diferentes elementos sobre herramientas existentes y disponibles para la solución de este problema.
PALABRAS CLAVE
Complejidad del problema; programación matemática; métodos de solución; herramientas de modelado; problema de enrutamiento vehicular con entregas y recogidas; futuras tendencias y tratamiento del problema.
INTRODUCCIÓN
In recent years, particularly from 2002 onwards, research on vehicle routing problem [1] has increased significantly; in addition, there has been a substantial intellectual production in the different versions of the problem. Technical literature has published important documents and works including new models, solution methods and the use of new optimization algorithms that use more efficient computers to obtain good results in relatively short computation times.
Paper [2] show this is a difficult problem of combinatorial optimization of the NP type. This means that the solution cannot be found in polynomial time.
In this paper, an updated review of the literature concerning the most prominent of vehicle routing problem with deliveries and pick-ups are presented, considering the different solution methods, as well as future trends in the development and use of metaheuristics, following the complexity of the problem.
Content analysis of these publications provides a holistic view that includes knowledge of the various models used by researchers to solve the problem, the set of possibilities from simple situations to complex problems that currently are the subject of important research, with a corresponding interpretation of their results, and an identification of the different routes of vehicles that provide a service to several clients in the most appropriate way possible, in the development and implementation of processes related to the supply and distribution. The objective of the problem is to find a set of good solutions obtained by applying heuristics or metaheuristics, conditioned by a variety of constraints related to the number of vehicles, capacity, destination sites and demand, delivery time and pickup, length of route, use of multiple depots, mixed fleet of vehicles, among others. If the problem is very complex and has sufficient technological and computing resources, it is possible to obtain the optimal solution.
Because of space limitations, many of the reviewed papers on the subject are just quoted including some Master and PhD thesis work. However, the decision to exclude this material was taken because of its length to be documented exhaustively in this paper. Of the total papers in the database the most 112 relevant were classified under the following criteria: year of publication, authors, country of origin of the research group or University, to which the authors belong, and the methodology or the proposed solution algorithm. This information is the basis for building a historical review and state of the art of the problem.
Authors like Berblegia et al [3] make a proposal for a general classification scheme of delivery and pickup problems with their characteristics.
The classification has three groups: The first group consists of the graph ''many to many problems'', where any vertex can be used as source or destination. Its structure is similar to the vehicle routing problem with simultaneous pickup and delivery - VRPSPD. The second group includes the problems of ''one-to - many to one ''. It means that all delivery demands are initially located at the depot and all pickup demands are delivered at the depot. An application of this case is the delivery of full bottles and the collection of empty ones in a bottling industry. Its equivalent is the mixed vehicle routing problem with pickup and delivery (MVRP). Here it appears that clients request only one of the two services. The third group consists of the routing problems one - to -one - where each product is considered a request that comes from a source and has a defined destination. This problem is identical to the traveling salesman with mixed deliveries and pickups.
The scenarios in which this problem can be analyzed by Berbeglia et al [4] are: Static environment: where all the input data of the problem is known before the construction or design of routes. In this scenario, the planning horizon is limited; and dynamic environment, where some input data is known or updated during the period in which operations perform delivery and pickup of products or goods. The planning horizon in this scenario is unlimited. Most delivery and pickup problems have focused on the static scenario and few authors have worked the dynamics of the problem.
Variations of the classic VRP consider the problem with a mix of nodes that require delivery only, pickup only or both delivery and pickup [5]. In the VRP with simultaneous pickup and delivery, all vehicles or conveyances returning to a depot (source) and all clients (nodes) will be visited only once. The design of the route seeks to be the path of minimum cost or minimum distance, and the vehicle load must not exceed its capacity along the route.
The objective of the VRP with deliveries and selective pickups that includes time windows (VRPDSPTW) is to minimize the difference between routing costs and revenues associated with the pickups. In this scenario, there are five variants of the problem [6]: VRP with mixed delivery and pickup; VRP with pickup and delivery with backhaul; VRP with pickup and delivery with individual visits; VRP with pickup and delivery with multiple visits and routes mixture; VRP with pickup and delivery with backhauls allowed.
On the other hand, some authors consider the factor of time window [7] within the routing problem with simultaneous delivery and pick-up, and developed a mathematical model from a genetic algorithm penalizing delays [8]. Others, such as the exact method, among other techniques, apply the branch and price, with the comparison of instances up to 100 clients. The VRP with partial delivery and pickup with multiple visits (mixed route) includes the integer programming solution with competitive decision algorithm (CDA) [9]. In 2014, [10] developed a local search algorithm based on the variable neighborhood search (VNS) method to improve the performance of the heuristic. An adaptive local search algorithm for the vehicle routing problem with simultaneous and mixed pick-ups and deliveries was presented in 2015 [11]. The vehicle routing problem with simultaneous pick-ups and deliveries with two-dimensional loading constraints is introduced and solved in 2016 [12].
The paper is organized as follows: Introduction, methodology, brief description of the theoretical framework, future trends, conclusions and bibliography review.
1. THEORETICAL FRAMEWORK
This document deals with the VRP with deliveries and pickups, including one of the early researches about the problem arises VRPSPD the year 1989 [13].
Following, a taxonomy of problem is presented, considering the formulation of mathematical models and the solution methods employed:
1.1. According to the methods of solving
A sample of 98 papers was classified by solution method into the following categories: exact methods (24 papers), heuristics (29 papers), metaheuristics (35 papers) and hybrid (exact method, heuristics and metaheuristics (10 papers) :
1.1.1. Exact methods
The following methods were found: branch and cut algorithm (5 papers) [14-18]; branch and price algorithm (2 papers) [19, 20]; branch and bound algorithm (1 paper), 21] dynamic programming (5 papers) [22-26]; mixed integer linear programming (5 papers) [27-31]; design of experiments (1 papers) [32]; column generation scheme (4 papers) [33-36]; classical theory of programming and graph theory (1 paper) [37].
Aspects of these methods are described below:
Branch and cut algorithm: was first applied in 1997 by Ruland and Rodin and consists of a fleet of vehicles serving a set of customers. It is a restricted version of the multiple traveling salesman problem and the optimal solution for 2392 cities (destinations) served from a single deposit. In 2011, the same algorithm was applied with restrictions that ensure that the capacity is not exceeded in the middle of the route incorporating an approximate separation. The test was done in 87 cases between 50 and 200 customers, improving the lower bounds and showing new optimal solutions [16]. Then, 17] in the same year, they present a work related with the search of locations and the design of routes of the vehicles, so that the delivery and pick up are carried out in the same vehicle, reducing the total cost. The application was made for 88 clients and 8 depots, obtaining optimal solution in a reasonable time. In 2013, this problem was treated as a special case of the pickup and delivery problem with time windows in two parts, evaluating the method on the generated instances and real-world, considering 193 transport requests. The optimum is achieved with a maximum of 87 clients in a computation time of one hour [16].
Branch and price algorithm: in 2010, this method was applied using time windows and a set of homogeneous vehicles [19]. The optimal solution was obtained for instances that contain a deposit and up to 100 clients. Concurrently, the problem ''A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading'' was resolved for three exact branch-price-and-cut algorithms [20].
Dynamic programming: a stochastic and dynamic model for the vehicle routing problem with deliveries and pickups was proposed and developed by [22] in 1999, considering vehicles with unit capacity and variable capacity, seeking to reduce the waiting time in the system demands. In 2009, 23] they developed a model similar to the schedule with setup times in the sequence and timing of release times, with the novelty to combine or separate delivery and pickup operations.
In 2011, [25] proposed solutions for multiproduct dynamic programming with pickups and capacitated deliveries. Non-optimal solutions were found. By 2013 [26] worked dynamic programming algorithm, considering the problem in a horizon of finite and infinite time with a predefined customer sequence for both delivery and for collection. The objective was to find the optimal path of least cost.
Mixed integer linear programming: Here, the problem is studied using special graphics as trees, polynomial algorithms in cycles and store graphics, satisfying requests for pickup and delivery of customers within the constraints of vehicle capacity is studied when depots are considered exogenous and endogenous [27]; a new mixed integer linear programming (MILP) approach is presented under uncertainty by taking greenhouse emissions into consideration [28]; a variant of the many-to-many location-routing problem, where hub facilities have to be located and customers with either pickup or delivery demands have to be combined in vehicle routes [29]; a single vehicle routing problem with pickups and deliveries, continuous random demands and the customers are served according to a particular order [30]; in 2016, 31] proposes two mixed integer linear programming (milp) models for solving the green vehicle routing problems with pickups and deliveries in a semiconductor supply chain (G-VRPPD-SSC). Design of experiments: in 2009 [32] do an experiment associated to split load in the delivery and pickup that is affected by the average size, number of sources relating to the destinations, grouping of depots and customer locations.
Column generation scheme: this method is applied in 1999, when the problem of delivery and pickup of goods out with time windows looked for the shortest route on a scenario of multiple warehouses and different types of vehicles [33]. By 2009, the problem of incorporating the generation time in the care of deliveries and pickups to customers was considered, with restrictions in allocation drivers and vehicles to customer requests [34]. By 2013, [36] increase the scope of the problem, by working residential and commercial networks, applying this scheme, which are significantly reduced when the two networks are combined fully or partially.
Classical theory of programming and graph theory: In 2009, using this procedure, [37] designed an algorithm programming and delivering tasks in hospitals, making efforts to accelerate health care, and reducing waiting time and patient costs.
1.1.2. Heuristics
It is known that the heuristic solutions are procedures which usually show good quality through a restricted search space research.
Today, heuristic methods are an alternative to mathematical optimization models. Heuristics is associated with invention or creation, and it is used to describe the techniques which, instead of using a classical optimization approach, there is a step by step construction process, evaluating and selecting different options with or without help from the user, to perform local searches under the guidance of the rules and / or logical or empirical sensibilities.
The heuristics found in the revised data bases explored papers dealing with a classification into two construction methods and phases given by [38] in 2011:
• Construction methods: are based on the traveling salesman problem 1994, [39]; transfer opportunity in 1996 [40]; dynamic routing 1996 [41]; split routes, 1998 [42]; single and multiple depot, 2005 [43]; search shortest path, 2006, [44]; approach for a vehicle routing problem on a tree-shaped network with a single depot, with free delivery and pick up on request, 2006 [45]; time windows and waiting time, 2006 [46], 2011 [47]; Nearest neighbor search, 2006, [48]; Variable nearest neighbor search, 2012, [49]; hybrid approach to adaptive predictive control (HAPC), 2008 [50]; problem solving of routing single vehicle deliveries and pickups, 2007 [51]; selective pickup and delivery, 2008 [52]; route search with stowage planning in three dimensions, 2008 [53]; TSPPD with first-in, first-out loading (TSPPDF) 2009 [54]; grouping, 2009 [55]; parallel heuristics, 2010 [56]; Variable local search (VNS), 2011 [57]; heuristic approach 2012 [58]; algorithm NPFDS, 2013 [59]; political dynamics of the nearest neighbor (DNN), 2013 [60]; fleet size and the vehicle routing problem mixed, 2013 [61]; Scanning, 2013 [62] ; split for simultaneous deliveries and pickup, 2009 [63], 2010 [64]; pheromones, 2009 [65]; hybrid heuristics, 2010 [66].
• Methods phase's multiphase constructive heuristics: these are group nodes with proximity criterion, using the shrink algorithm with generalized vehicle allocation genetic algorithm with application in the last search, 2007, [67].
1.1.3. Metaheuristics
They are defined as methods or approximate iterative procedures of general purpose, designed as superior strategies to guide the heuristics methods in the achievement of feasible solutions, appropriately combining the different concepts, to explore with intensification or diversification the search space in the domains where the problems are complex. It is usually applied to solve complex problems NP or NP complete problems associated with combinatorial optimization.
In table 1 you can see the different metaheuristics that were found in the bibliography review.
1.1.4. Hybrid (heuristics and metaheuristics, exact and heuristic or metaheuristics)
Eleven hybrid methods found in the papers consulted, combining metaheuristics and exact methods heuristics to obtain better solutions to the problem are presented in table 2.
1.2. Depending on the formulation of mathematical models
The vehicle routing problem with deliveries and pickups was studied first in 1989 by H. Min, who proposed a three-phase heuristic [13]. It has been observed that the interest of researchers in this problem has been increasing after year 2006. For the literature review it was found that from 1981 to 2005 15 papers were written and in the 2006-2016 period, the intellectual production reached 97 papers in the selected sample.
Both the general formulation for the vehicle routing problem VRPs and the case of the vehicle routing problem with deliveries and pickups, are still regarded as a combinatorial optimization problem and most versions are considered NP-problem
A summary of the relevant variants that has had this problem for 1981-2016 are presented in table 3.
2. FUTURE TRENDS
With respect to the formulation of the problem, according to recent research carried out in 2013, it is considered that the scenario is an infinite horizon with multiple vehicles and multiple customers [14], which used 2392 cities, and the optimal solution was found ensuring service level of 100% in deliveries and pickups. Here, it doesn't matter whether the vehicle can interrupt his to return to depot, return the picked-up products listed and make new deliveries replenishment, retaking the remaining routes, working in dynamic environments.
If this is the solution method, it shows a marked tendency to use metaheuristics, precisely because of the complexity of the problem.
On the other hand, there remains the concern to consolidate or create many research lines that may be aimed at developing effective local search strategies associated with local searches to reduce the computational effort while maintaining a good level of quality in the solutions, while using algorithms that are able to solve large problems where it is possible to design new variants of the problem. Also, the algorithms applied in this problem can be used in other cases of combinatorial optimization and scheduling of single and multiple machines or grouping problems; in the research of alternative hybridization between heuristic approaches and exact forms. Finally, it is important to consider the incorporation of environmental variables such as reducing the impact of greenhouse emissions, fuel consumption and costs of emission of carbon, trying to address the problem of routing at its green version and clean scenarios [28, 31 and 69].
3. METHODOLOGY
A detailed review of a sample of more than 100 papers of the VRP with pickup and delivery (VRPPD), published in the last two decades in international databases was made, taking into account the methods of solution with new optimization algorithms.
4. CONCLUSIONS
• It was noted in this paper that most of the methods used in solving the different variations of the problem correspond to metaheuristics, because of the growing complexity of the problem over time, followed by the heuristics; then there are exact methods and finally mixed methods.
• It was possible to show that the scope of the vehicle routing problem is very wide in all real economic sectors in both manufacturing and services, either discrete or continuous events, which makes the application of solution techniques become more interesting.
• In this bibliography review it was noted that there are important contributions of the authors to solve the problem, while we verify that a strong and growing research is advancing worldwide in combinatorial optimization as well as in the area of operations research. We found that some researchers designed their own algorithms.
• When comparing the resulting instances, it was noted that although there is an attempt to improve results, in the case of the exact methods the runtime of the algorithm that solves the problem is crucial to decide which method is the best solution.
• The references submitted, without being complete, are prime examples for the authors and the general public to address this exciting area of research.
5. ACKNOWLEDGMENT
The scientific and technical contributions of Antonio Escobar from the Universidad Tecnológica de Pereira are also gratefully acknowledged.
REFERENCES
1 P. Toth, D. Vigo, ''The Vehicle Routing Problem''. Society of Industrial and Applied Mathematics (SIAM) monographs on discrete mathematics and applications. Philadelphia, USA, pp. 1-23, 109-149, 2002.
2 J. K. Lenstra, A. H. G. Rinnooy Kant. ''Complexity of vehicle routing and scheduling problems''. Networks. 11 (2), pp. 221-227, 1981.
3 A. Subramanian. ''Heuristics exact and hybrid approaches for vehicle routing problems''. Universidad Federal Fluminense. Tesis Doctoral. Niteroi, pp. 13, 17, 19, 2012.
4 G. Berbeglia, J. F. Cordeau, G. Laporte. ''Dynamic pick up and delivery problems''. European Journal of Operational Research- ELSEVIER, pp. 8-15, 2009.
5 K. Ganesh, T. T. Narendram. ''Cloves: A cluster and search heuristic to solve the vehicle routing problem with delivery and pick-up''. European Journal of Operational Research- ELSEVIER, pp. 699-717, 2009.
6 G. Gutiérrez, G. Desaulniers, G. Laporte, V. Marianov. ''A branch and price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows''. European Journal of Operational Research-ELSEVIER, pp. 341-349, 2010.
7 Z. Liu, N. Li, X. Mi, B. Zhang, H. Ma. ''Improvement Research on Vehicle Routing Problem with Simultaneous Delivery and Pickup with time windows for Barreled Water''. IEEE, pp. 1347-1350, 2010.
8 L. Chun-Hua, Z. Hong, Z. Jian. ''Vehicle Routing Problem with Time Windows and Pickups and Deliveries''. IEEE, pp. 685-689, 2009.
9 K. Wang, C. Ye, A. Ning. ''Competitive Decision Algorithm for the Split Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows''. International Conference on Future Technology and Management Engineering. IEEE, pp. 371-375, 2010.
10 Q. Chen, K. Li, Z. Liu. ''Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads''. Transportation Research Part E: Logistics and Transportation Review, Volume 69, pp. 218-235, 2014.
11 M. Avci, S. Topaloglu. ''An Adaptive Local Search Algorithm for Vehicle Routing Problem with Simultaneous and Mixed Pickups and Deliveries''. Computers & Industrial Engineering, Volume 83, pp. 15-29, 2015.
12 E. Zachariadis, C. Tarantilis, C. Kiranoudis. '' The Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries and Two-Dimensional Loading Constraints'', European Journal of Operational Research - ELSEVIER, Volume 251, Issue 2, 1, pp. 369-386, 2016.
13 H. Min. ''The multiple vehicle routing problem with simultaneous delivery and pick up points''. Transportation Research.Vol. 23. No. 5, pp. 377-386, 1989.
14 K.K. Ruland, E. Y. Rodin. ''The pickup and delivery problem: Faces and branch and cut algorithm''. European Journal of Operational Reserarch – ELSEVIER. Vol. 33. No. 12, pp. 1-13, 1997.
15 H. Hernandez Perez, J. J. ''A branch and cut algorithm for a traveling salesman problem with pickup and delivery''. European Journal of Operational Research-ELSEVIER, pp. 126-139, 2004.
16 A. Subramanian, E. Uchoa, A. Alves Pessoa, L. Satoru Ochi. ''Branch and cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery''. European Journal of Operational Research-ELSEVIER, pp. 338-341, 2011.
17 I. Karaoglan, F. Altiparmak, I. Kara, B. Dengiz. ''A branch and cut algorithm for the location routing problem with simultaneous pickup and delivery''. European Journal of Operational Research-ELSEVIER, pp. 318-332, 2011.
18 R. Masson, S. Ropke, F. Lehuédé, O. Péton. ''A branch and cut and price approach for the pickup and delivery problem with shuttle routes''. European Journal of Operational Research-ELSEVIER, articulo en proceso, 2013.
19 G. Gutiérrez Jarpa, G. Desaulniers, G. Laporte, V. Mariano. ''A branch and price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows''. European Journal of Operational Research-ELSEVIER, pp. 341-349, 2010.
20 M. Cherkesly, G. Desaulniers, G. Laporte. ''A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading''. Computers & Operations Research, Volume 62, pp. 23-35, 2015.
21 P. Venkateshan, K. Mathur. ''An efficient column generation based algorithm for solving a pickup and delivery problem''. European Journal of Operational Research-ELSEVIER, pp.1647-1655, 2011.
22 M. R. Swihart, J. D. Papastavrou. ''A stochastic and dynamic model for the single vehicle pickup and delivery problem''. European Journal of Operational Research-ELSEVIER, 1999. pp. 447-464, 1999.
23 C. Y. Lee, X. Qi.'' Vehicle scheduling with combinable delivery and pickup operations''. European Journal of Operational Research-ELSEVIER, pp. 399-404, 2009.
24 I. Minis, A. Tatarakis. ''Stochastic single vehicle routing problem with delivery and pickup and a predefined customer sequence''. European Journal of Operational Research-ELSEVIER, pp. 37-51, 2011.
25 H. N. Psaraftis. ''A multi-commodity, capacitated pickup and delivery problem: The single and two vehicle cases''. European Journal of Operational Research-ELSEVIER, pp. 572-580, 2011.
26 M. Mahmoudi, X. Zhou. ''Finding optimal solutions for Vehicle Routing Problem with Pickup and Delivery Services with Time Windows: A dynamic programming approach based on state–space–time network representations''. Transportation Research Part B: Methodological, Volume 89, pp. 19-42, 2016.
27 T. E. Tzore, D. Granot, F. Granot, G. Sosic. ''The vehicle routing problem with pickups and deliveries on some special graphs''. European Journal of Operational Research-ELSEVIER, pp. 193-229, 2002.
28 N. Tajik, R. Tavakkoli-Moghaddam, B. Vahdani, S. Meysam Mousavi. ''A robust optimization approach for pollution routing problem with pickup and delivery under uncertainty''. Journal of Manufacturing Systems, Volume 33, Issue 2, pp. 277-286, 2014.
29 J. Rieck, C. Ehrenberg, J. Zimmermann. ''Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery''. European Journal of Operational Research – ELSEVIER. Volume 236, Issue 3, pp. 863-878, 2014.
30 T.D. Dimitrakos, E.G. Kyriakidis. ''A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order''. European Journal of Operational Research – ELSEVIER. Volume 244, Issue 3, 1, pp. 990-993, 2015.
31 S. Madankumar, C. Rajendran. ''Mathematical models for green vehicle routing problems with pickup and delivery: A case of semiconductor supply chain''. Computers & Operations Research, available online 4 April 2016. Paper in Press.
32 M. Nowak, O. Ergun, C. White III Chelsea. ''An empirical study on the benefit of split loads with the pickup and delivery problem''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 734-740, 2009.
33 Y. Dumas, J. Desrosiers, F. Soumis. ''The pickup and delivery problem with time windows''. European Journal of Operational Research-ELSEVIER. Vol. 54, pp. 7-22, 1991.
34 E. Domenjoud, C. Kirchner, J. Zhou. ''Generating Feasible Schedules for a Pickup and Delivery Problem''. European Journal of Operational Research-ELSEVIER, pp.1-12, 2009.
35 Y. Gajpal, A. Prakash. ''An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup''. European Journal of Operational Research-ELSEVIER, pp. 321-322, 2009.
36 J. F. Bard, A. I. Jarrah. ''Integrating commercial and residential pickup and delivery networks: A case study''. European Journal of Operational Research-ELSEVIER, pp. 706-720, 2013.
37 C. Fiegl, C. Pontow. ''Online scheduling of pickup and delivery tasks in hospitals'' European Journal of Operational Research-ELSEVIER, pp. 624-632, 2009.
38 L.B. Rocha, E.C Gonzalez, C. J. A Orjuela. ''Una revisión al estado del arte del problema de ruteo de vehículos: Evolución histórica y métodos de solución''. Ingeniería Universidad Distrital. Vol. 16. No.2, pp. 45, 2011.
39 G. Mosheiov. ''The Travelling Salesman Problem with pickup and delivery''. European Journal of Operational Research-ELSEVIER. Vol. 79. Issue 2, pp. 299-310, 1994.
40 J. S. Shang, C. K. Cuff. ''Multicriteria pickup and delivery problem with transfer opportunity''. European Journal of Operational Research-ELSEVIER. Vol. 30. No. 4, pp. 631-645, 1996.
41 R. Hall. ''Pickup and delivery systems for overnight carriers''. European Journal of Operational Research-ELSEVIER. Vol. 30. No. 3, pp. 173-187, 1996.
42 G. Mosheiov. ''Vehicle routing with pickup and delivery: Tour partitioning heuristics''. European Journal of Operational Research-ELSEVIER. Vol. 34. No. 3, pp. 669-684, 1998.
43 G. Nagy, S. Salhi. '' Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries''. European Journal of Operational Research-ELSEVIER, pp. 126-141, 2005.
44 C.G Lee, M.A. Epelman, C.C. White III, Y. A. Bozer. ''A shortest path approach to the multiple-vehicle routing problem with split pickups''. European Journal of Operational Research-ELSEVIER, Part B 40. pp. 265-284, 2006.
45 N. Katoh, T. Yano. ''An approximation algorithm for the pickup and delivery vehicle routing problem on trees''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 265–284, 2006.
46 A. Fabri, P. Recht. ''On dynamic pickup and delivery vehicle routing with several time windows and waiting times''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 335–350, 2006.
47 C. K. Y. Lin. ''A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 1596-1609, 2011.
48 Gendreau, F. Guertin, J. Potvin, R. Seguin. ''Neighborhood search heuristics for a dynamic vehicle dispatching problem with pickups and deliveries''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 157-174, 2006.
49 N. Mladenovi?, D. Urosevic, S. Hanafi, A. Ili?.''A general variable neighborhood search for the one-commodity pickup and delivery travelling salesman problem''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 270-285, 2012.
50 D. Sáeza, C. Cortés, E. Núñez. ''A. Hybrid adaptive predictive control for the multi-vehicle dynamic pickup and delivery problem based on genetic algorithms and fuzzy clustering''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 3412-3438, 2008.
51 I. Gribkovskaia, O. Halskau, G. Laporte, M. Vicek. ''General solutions to the single vehicle routing problem with pickups and deliveries.'' European Journal of Operational Research- ELSEVIER, Part B 40, pp. 568-584, 2007.
52 I. Gribkovskaiaa, G. Laporte, A. Shyshou. ''The single vehicle routing problem with deliveries and selective pickups''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 2908-2924, 2008.
53 T. Sheng Chang, Y. F. Liao. ''Path finding with stowage planning consideration in a mixed pickup delivery and specified-node network''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 970-985, 2008.
54 G. Erdogan, J. F. Cordeau, G. Laporte. ''The pickup and delivery traveling salesman problem with first in first out loading''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 1800-1808, 2009.
55 J. F. Bard, A. I. Jarrah. ''Large scale constrained clustering for rationalizing pickupand delivery operations''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 542-561, 2009.
56 A. Subramanian, L. M. A Drummond, C. Bentes, L. S. Och, R. Farias. ''A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 1899-1911, 2010.
57 Y. Li, A. Lim, W. Chong Oon, H. Qin., D. Tu. ''The tree representation for the pickup and delivery traveling salesman problem with LIFO loading''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 482-496, 2011.
58 I. Karaoglan, F. Altiparmak, I. Kara, B. Dengiz. '' The location routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 465-477, 2012.
59 P. Y. Yang, J. F Tang, Y. Yu, J. X. Pei. ''Minimizing Carbon Emissions through Vehicle Routing and Scheduling in the Shuttle Service of Picking up and Delivering Customers to the Airport''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 424-432, 2013.
60 P. K. Sheridan, E. Gluck, Q. Guan, T. Pickles, B. Balc?oglu, B. Benhabib. '' The dynamic nearest neighbor policy for the multivehicle pickup and delivery problem''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 178-194, 2013.
61 P. Bel?orea, H. Yoshizaki. ''Heuristic methods for the ?eet size and mix vehicle routing problem with time windows and split deliveries''. European Journal of Operational Research-ELSEVIER. 2013. Part B 40, pp. 589-601, 2013.
62 R. Dondo, J. Cerdá. ''A sweep heuristic based formulation for the vehicle routing problem with cross-docking''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 293-311, 2013.
63 G. Tang, A. Ning, K. Wang, X. Qi. ''A Practical Split Vehicle Routing Problem with Simultaneous Pickup and Delivery''. The Institute of Electrical and Electronics Engineers. IEEE, pp. 26-30, 2009.
64 K. Wangl, C. Vel., A. Ning. ''Competitive Decision Algorithm for the Split Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows''. The Institute of Electrical and Electronics Engineers. IEEE, pp. 371-375, 2010.
65 T. Zhang, Y. J. Zhang, W. Lai, J. Y. Hu. ''Research on Time Dependent Vehicle Routing Problem with Simultaneous Delivery and Pickup''. The Institute of Electrical and Electronics Engineers. IEEE, pp. 66-70, 2009.
66 C. Shi Liu, Q. J. Tang. ''A Hybrid Heuristics for Vehicle Routing Problem with Simultaneous Pickup and Delivery Service''. The Institute of Electrical and Electronics Engineers. IEEE, pp. 1422-1426, 2010.
67 K. Ganesh, T. T. Narendran. ''CLOVES: A cluster and search heuristic to solve the vehicle routing problem with delivery and pickup''. European Journal of Operational Research-ELSEVIER, Part B 40, pp. 699-717, 2007.
68 W. Nanry, J. W. Barnes.'' Solving the pickup and delivery problem with time windows using reactive tabu search''. European Journal of Operational Research-ELSEVIER, Part B 34, pp. 107-121, 2000.
69 F. Ferrucci, S. Bock. ''Real-time control of express pickup and delivery processes in a dynamic environment''. Transportation Research Part B: Methodological, Volume 63, pp. 1-14, 2014.
70 M. Jin, K. Liu, R.O. Bowden. ''A two stage algorithm with valid inequalities for the split delivery vehicle routing problem''. European Journal of Operational Research-ELSEVIER, pp. 228-242, 2007.
71 A. Hoff, I. Gribkovskaia, G. Laporte, A. Lokketangen. ''Lasso solution strategies for the vehicle routing problem with pickups and deliveries''. European Journal of Operational Research-ELSEVIER, pp. 755-766, 2009.
72 J. Fan. ''The Vehicle Routing Problem with Simultaneous Pickup and Delivery Based on Customer Satisfaction''. European Journal of Operational Research-ELSEVIER, pp. 5284- 5289, 2011.
73 N. Bianchessi, G. Righini. ''Heuristic algorithms for the vehicle routing problem with simultaneous pick up and delivery''. European Journal of Operational Research-ELSEVIER, pp. 578-594, 2007.
74 G. Erdogan, M. Battarra, G. Laporte, D. Vigo. ''Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs''. European Journal of Operational Research-ELSEVIER, pp. 1074-1086, 2012.
75 D. Ai-min, M. Chao, Z. Yan-ting. ''Optimizing Research of an Improved Simulated Annealing Algorithm to Soft Time Windows Vehicle Routing Problem with Pickup and Delivery''. Systems Engineering Theory & Practice, pp. 186-194, 2009.
76 E. Zachariadis, C. Tarantilis, C. Kiranoudis. ''A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service''. European Journal of Operational Research-ELSEVIER, pp. 1074-1086, 2012.
77 L. Meng, X. Guo. ''A new hybrid metaheuristics for the vehicle routing problem with simultaneous pick-up and delivery''. Institute of Electrical and Electronics Enginners-IEEE, pp. 1198-1202, 2008.
78 M. Karlafti, K. Kepaptsoglou, E. Sambracos. ''Containership routing with time deadlines and simultaneous deliveries and pickups''. European Journal of Operational Research– ELSEVIER. Part E: Logistics and Transportation, pp. 210-221, 2009.
79 Y. Gajpal, P. Abad. ''An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup''. European Journal of Operational Research-ELSEVIER. Computers & Operations Research, pp. 3215-3223, 2009.
80 E. Zachariadis, C. Tarantilis, C. Kiranoudis. ''An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries''. European Journal of Operational Research-ELSEVIER, pp. 401- 411, 2010.
81 B. Çatay. ''A new saving based ant algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery''. European Journal of Operational Research-ELSEVIER. Experts Systems with Aplications, pp. 6809-6817, 2010.
82 L. Boubahri, A. Addouche, E. Mhamedi. ''Multi-Ant Colonies algorithms for the VRPSPDTW''. Institute of Electrical and Electronics Enginners-IEEE, pp. 1-6, 2011.
83 L. Mingyong, C. Erbao. ''An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows''. European Journal of Operational Research-ELSEVIER. Engineering Applications of Artificial Intelligence, pp. 188-195, 2010.
84 E. Zachariadis, C. Kiranoudis. ''A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pickups and deliveries''. Experts Systems with Applications: An International Journal. Vol. 38. N° 3, pp. 2717-2726, 2011.
85 L. Chun-Hua, Z. Hong, Z. Jian. ''Vehicle Routing Problem with Time Window and Simultaneous Pickups and Deliveries''. Industrial Engineering and Engineering Management. IE&EM '09. 16th International Conference on 2009. pp. 685-689.
86 L. Hou, H. Zhou. ''Stochastic Vehicle Routing Problem with Uncertain Demand and Travel Time and Simultaneous Pickups and Deliveries''. Industrial Engineering and Engineering Management. IEEE, pp. 32-35, 2010.
87 Z. Liu, N. Li, X Mi, B. Zhang, H. Ma. ''Improvement Research on Vehicle Routing Problem with Simultaneous Delivery and Pickup with time windows for Barreled Water''. Industrial Engineering and Engineering Management. IEEE, pp. 1347-1350, 2010.
88 A. Serdar Tasana, M. Gen. ''A genetic algorithm based approach to vehicle routing problem with simultaneous pickup and deliveries''. European Journal of Operational Research- ELSEVIER. Computers & Industrial Engineering, pp. 755-761, 2012.
89 T. Zhanga, W. A. Chaovalitwongse, Y. Zhang. ''Scatter search for the stochastic travel time vehicle routing problem with simultaneous pick-ups and deliveries''. European Journal of Operational Research-ELSEVIER. Computers & Operations Research, pp. 2277-2290, 2012.
90 H. Wang, Y. Chen. ''A genetic algorithm for the simultaneous delivery and pickup problems with time windows''. European Journal of Operational Research-ELSEVIER. Computers & Industrial Engineering, pp. 84-85, 2012.
91 H. Wang, Y. Chen. ''A coevolutionary algorithm for the ?exible delivery and pickup problem with time windows''. European Journal of Operational Research-ELSEVIER. International Journal of Production Economics, pp. 4-13, 2013.
92 Y. Chen. ''Fuzzy Flexible Delivery and Pickup Problem with Time Windows''. European Journal of Operational Research-ELSEVIER. Procedia Computer Science, pp. 379-386, 2013.
93 M. ?ahin, G. Çavu?lar, T. Öncan, G. ?ahin, T. Aksu. ''An efficient heuristic for the Multi-vehicle One to one Pickup and Delivery Problem with Split Loads''. European Journal of Operational Research-ELSEVIER. Transportation Research Part C. Emerging Technologies, pp. 169-188, 2013.
94 C. Ting, X. Liao. ''The selective pickup and delivery problem: Formulation and a memetic algorithm''. European Journal of Operational Research-ELSEVIER. International Journal of Production Economics, pp. 199-211, 2013.
95 F. Goksal, F. Altiparmak, I. Karaoglan. ''A Hybrid Particle Swarm Optimization for Vehicle Routing Problem with Simultaneous Pickup and Delivery''. Industrial Engineering and Enginnersing Management. IEEE, pp. 1-6, 2010.
96 I. Karaoglan, F. Altiparmak. ''A Hybrid Genetic Algorithm for the Location Routing Problem with Simultaneous Pickup and Delivery''. Institute of Electrical and Electronics Enginners Management-IEEE.Computers and Industrial Engineering, pp. 1-6, 2010.
97 F. Zhao, D. Mei, J. Sun, W. Liu. ''A hybrid genetic algorithm for the vehicle routing problem with simultaneous pickup and delivery''. Institute of Electrical and Electronics Enginners-IEEE. Control and Decision Conference, pp. 3928-3933, 2009.
98 N. Zhang, G. Sun, Y. Wu, F. Geng. ''A modified particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery''. Institute of Electrical and Electronics Enginners-IEEE. Asian Control Conference, pp. 1679-1684, 2009.
99 H. Feng-jun, W. Bin. ''Quantum Evolutionary Algorithm for Vehicle Routing Problem with Simultaneous Delivery and Pickup''. Institute of Electrical and Electronics Enginners- IEEE. Decision and Control, 28th Chinese Control conference, pp. 5097-5101, 2009.
100 T. Jin Ai, V. Kachitvichyanukul. ''A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery''. European Journal of Operational Research-ELSEVIER, Computers & Operations Research, pp. 1693-1702, 2009.
101 M. Avci, S. Topaloglu. ''A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery''. Expert Systems with Applications, Volume 53, pp. 160-171, 2016.
102 S. Mitrovi? Mini?, G. Laporte. ''Waiting strategies for the dynamic pickup and delivery problem with time windows''. European Journal of Operational Research-ELSEVIER. Transportation Research Part B. Methodological, pp. 635-655, 2004.
103 C.K.Y. Lin. ''A cooperative strategy for a vehicle routing problem with pickup and delivery time windows''. European Journal of Operational Research-ELSEVIER. Computers & Industrial Engineering, pp. 766-782, 2008.
104 G. Berbeglia, G. Hahn. ''Counting feasible solutions of the traveling salesman problem with pickups and deliveries is NP-complete''. European Journal of Operational Research-ELSEVIER. Discrete Applied Mathematics, pp. 2541-2547, 2009.
105 D. Männel, A. Bortfeldt. ''A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints''. European Journal of Operational Research – ELSEVIER, Volume 254, Issue 3, 1, pp. 840-858, 2016.
106 R. C. Cruz, T. C. B. Silva, M J. F. Souza, V. N. Coelho, M. T. Mine, A. X. Martins. ''GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous''. European Journal of Operational Research- ELSEVIER. Electronics Notes in Discrete Mathematics, pp. 217-224, 2012.
107 S. N. D'Souza Omkar, J. Senthilnath. ''Pickup and delivery problem using metaheuristics techniques''. European Journal of Operational Research-ELSEVIER. Experts Systems with Applications, pp. 328-334, 2012.
108 R. Liu, X. Xie, V. Augusto, C. Rodríguez. ''Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care''. European Journal of Operational Research-ELSEVIER, pp. 475-486, 2013.
109 Y. Qu, J. F. Bard. ''The heterogeneous pickup and delivery problem with configurable vehicle capacity''. European Journal of Operational Research-ELSEVIER. Transportation Research Part C. Emerging Technologies, pp. 1-20, 2013.
110 P. Chen, H. Huang, X. Dong. ''An Ant Colony System Based Heuristic Algorithm for the Vehicle Routing Problem with Simultaneous Delivery and Pickup''. Institute of Electrical and Electronics Enginners-IEEE. Industrial Electronics and Applications, pp. 136-141, 2007.
111 T. Zhang, Y. J. Zhang,, Q. I. Chen, Y. Sun. ''The Mixed Algorithm for vehicle routing problem with simultaneous pickup and delivery''. Institute of Electrical and Electronics Enginners-IEEE, Machine Learning and Cybernetics, pp. 1871-1876, 2009.
112 A. Subramanian. ''Metaheristica Iterated Local Search aplicada ao problema de Rotetamento de veículos com coleta e entrega Simultanâa. Master's Thesis, Programa de Pósgraduçâo em Engenharia de Produçâo. Universidade Federal da Paraiba, João Pessoa, PB. Brazil, (in Portuguese), 2008.