T. J. Ai and V. Kachitvichyanukul, A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery, Computers & Operations Research, vol.36, issue.5, pp.1693-1702, 2009.
DOI : 10.1016/j.cor.2008.04.003

A. Tang-montané, F. Galvão, and R. D. , A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service, Computers & Operations Research, vol.33, issue.3, pp.595-619, 2006.
DOI : 10.1016/j.cor.2004.07.009

E. Angelelli and R. Mansini, The vehicle routing problem with time windows and simultaneous pick-up and delivery. Quantitative approaches to distribution logistics and supply chain management, pp.249-267, 2002.

R. Baldacci, E. Hadjiconstantinou, and A. Mingozzi, An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections, Networks, vol.47, issue.1, pp.26-41, 2003.
DOI : 10.1002/net.10079

J. J. Bentley, Fast Algorithms for Geometric Traveling Salesman Problems, ORSA Journal on Computing, vol.4, issue.4, pp.387-411, 1992.
DOI : 10.1287/ijoc.4.4.387

G. Berbeglia, J. F. Cordeau, I. Gribkovskaia, and G. Laporte, Static pickup and delivery problems: a??classification scheme and survey, TOP, vol.41, issue.2, pp.1-31, 2007.
DOI : 10.1007/s11750-007-0009-0

N. Bianchessi and G. Righini, Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery, Computers & Operations Research, vol.34, issue.2, pp.578-594, 2007.
DOI : 10.1016/j.cor.2005.03.014

J. Côté and J. Potvin, A tabu search heuristic for the vehicle routing problem with private fleet and common carrier, European Journal of Operational Research, vol.198, issue.2, pp.464-469, 2009.
DOI : 10.1016/j.ejor.2008.09.009

J. F. Chen and T. H. Wu, Vehicle routing problem with simultaneous deliveries and pickups, Journal of the Operational Research Society, vol.17, issue.2, pp.579-587, 2005.
DOI : 10.1287/inte.17.2.52

J. Cordeau, A Branch-and-Cut Algorithm for the Dial-a-Ride Problem, Operations Research, vol.54, issue.3, pp.573-586, 2006.
DOI : 10.1287/opre.1060.0283

J. Cordeau and G. Laporte, A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transportation Research Part B: Methodological, vol.37, issue.6, pp.579-594, 2003.
DOI : 10.1016/S0191-2615(02)00045-0

J. Cordeau, M. Gendreau, and G. Laporte, A tabu search heuristic for periodic and multi-depot vehicle routing problems, Networks, vol.30, issue.2, pp.105-119, 1997.
DOI : 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G

J. F. Cordeau, G. Laporte, and A. Mercier, A unified tabu search heuristic for vehicle routing problems with time windows, Journal of the Operational Research Society, vol.52, issue.8, pp.928-936, 2001.
DOI : 10.1057/palgrave.jors.2601163
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.7933

J. Crispim and J. Brandão, Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls, Journal of the Operational Research Society, vol.24, issue.11, pp.1296-1302, 2005.
DOI : 10.1016/S0305-0548(97)00031-2

M. Dell-'amico, A. Lodi, and F. Maffioli, Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method, Journal of Heuristics, vol.5, issue.2, pp.123-143, 1999.
DOI : 10.1023/A:1009647225748

M. Dell-'amico, G. Righini, and M. Salani, A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection, Transportation Science, vol.40, pp.235-247, 2006.

J. Dethloff, Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls, Journal of the Operational Research Society, vol.53, issue.1, pp.115-118, 2002.
DOI : 10.1057/palgrave/jors/2601263

M. Diana and M. M. Dessouky, A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows, Transportation Research Part B: Methodological, vol.38, issue.6, pp.539-557, 2004.
DOI : 10.1016/j.trb.2003.07.001

C. Duhamel, J. Y. Potvin, and J. M. Rousseau, A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows, Transportation Science, vol.31, issue.1, pp.49-59, 1997.
DOI : 10.1287/trsc.31.1.49

Y. Dumas, J. Desrosiers, and F. Soumis, The pickup and delivery problem with time windows, European Journal of Operational Research, vol.54, issue.1, pp.7-22, 1991.
DOI : 10.1016/0377-2217(91)90319-Q

E. Tzoreff, T. Granot, D. Granot, F. So?i?, and G. , The vehicle routing problem with pickups and deliveries on some special graphs, Discrete Applied Mathematics, vol.116, issue.3, pp.193-229, 2002.
DOI : 10.1016/S0166-218X(00)00283-3

S. Gélinas, M. Desrochers, J. Desrosiers, and M. M. Solomon, A new branching strategy for time constrained routing problems with application to backhauling, Annals of Operations Research, vol.17, issue.1, pp.91-109, 1995.
DOI : 10.1007/BF02098283

Y. Gajpal and P. Abad, An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup, Computers & Operations Research, vol.36, issue.12, pp.3215-3223, 2009.
DOI : 10.1016/j.cor.2009.02.017

Y. Gajpal and P. Abad, Multi-ant colony system (MACS) for a vehicle routing problem with backhauls, European Journal of Operational Research, vol.196, issue.1, pp.102-117, 2009.
DOI : 10.1016/j.ejor.2008.02.025

H. Gehring and J. Homberger, A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows, 1999.

M. Gendreau, A. Hertz, and G. Laporte, A Tabu Search Heuristic for the Vehicle Routing Problem, Management Science, vol.40, issue.10, pp.1276-1290, 1994.
DOI : 10.1287/mnsc.40.10.1276

M. Goetschalckx and C. Jacobs-blecha, The vehicle routing problem with backhauls, European Journal of Operational Research, vol.42, issue.1, pp.39-51, 1989.
DOI : 10.1016/0377-2217(89)90057-X

T. Hasama, H. Kokubugata, and H. Kawashima, A heuristic approach based on the string model to solve vehicle routing problem with backhauls, 1998.

A. Hertz, G. Laporte, and M. Mittaz, A Tabu Search Heuristic for the Capacitated arc Routing Problem, Operations Research, vol.48, issue.1, pp.129-135, 2000.
DOI : 10.1287/opre.48.1.129.12455

M. Hokey, The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Research Part A: General, pp.377-386, 1989.

J. J. Jaw, A. R. Odoni, H. N. Psaraftis, and N. H. Wilson, A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows, Transportation Research Part B: Methodological, vol.20, issue.3, pp.243-257, 1986.
DOI : 10.1016/0191-2615(86)90020-2

G. Kontoravdis and J. F. Bard, A GRASP for the Vehicle Routing Problem with Time Windows, ORSA Journal on Computing, vol.7, issue.1, pp.10-10, 1995.
DOI : 10.1287/ijoc.7.1.10

H. Li and A. Lim, A Metaheuristic for the Pickup and Delivery Problem with Time Windows, Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence, p.160, 2001.

Q. Lu and M. Dessouky, A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows, European Journal of Operational Research, vol.175, issue.2, pp.672-687, 2006.
DOI : 10.1016/j.ejor.2005.05.012

O. B. Madsen, H. F. Ravn, and J. M. Rygaard, A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives, Annals of Operations Research, vol.12, issue.1, pp.193-208, 1995.
DOI : 10.1007/BF02031946

A. Mingozzi, S. Giorgi, and R. Baldacci, An Exact Method for the Vehicle Routing Problem with Backhauls, Transportation Science, vol.33, issue.3, pp.315-329, 1999.
DOI : 10.1287/trsc.33.3.315

L. Mingyong and C. Erbao, An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows, Engineering Applications of Artificial Intelligence, vol.23, issue.2, pp.188-195, 2010.
DOI : 10.1016/j.engappai.2009.09.001

G. Nagy and S. Salhi, Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries, European Journal of Operational Research, vol.162, issue.1, pp.126-141, 2005.
DOI : 10.1016/j.ejor.2002.11.003

W. P. Nanry, W. Barnes, and J. , Solving the pickup and delivery problem with time windows using reactive tabu search, Transportation Research Part B: Methodological, vol.34, issue.2, pp.107-121, 2000.
DOI : 10.1016/S0191-2615(99)00016-8

I. H. Osman and N. A. Wassan, A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls, Journal of Scheduling, vol.11, issue.4, pp.263-285, 2002.
DOI : 10.1002/jos.122

G. Pankratz, A Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows, OR Spectrum, vol.27, issue.1, pp.21-41, 2005.
DOI : 10.1007/s00291-004-0173-7

S. Parragh, K. Doerner, and R. Hartl, A survey on pickup and delivery problems, Journal f??r Betriebswirtschaft, vol.1667, issue.2, pp.81-117, 2008.
DOI : 10.1007/s11301-008-0036-4

S. N. Parragh, K. F. Doerner, and R. F. Hartl, Variable neighborhood search for the dial-a-ride problem, Computers & Operations Research, vol.37, issue.6, pp.1129-1138, 2010.
DOI : 10.1016/j.cor.2009.10.003

C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem, Computers & Operations Research, vol.31, issue.12, 1985.
DOI : 10.1016/S0305-0548(03)00158-8

R. , M. Doerner, K. Hartl, and R. F. , Insertion based ants for Vehicle Routing problems with Backhauls and time windows, Lecture Notes in Computer Science, pp.135-148, 2002.

M. Reimann and H. Ulrich, Comparing backhauling strategies in vehicle routing using Ant Colony Optimization, Central European Journal of Operations Research, vol.11, issue.2, pp.105-123, 2006.
DOI : 10.1007/s10100-006-0163-8

S. Ropke and J. F. Cordeau, Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows, Transportation Science, vol.43, issue.3, pp.267-286, 2009.
DOI : 10.1287/trsc.1090.0272

S. Ropke, J. F. Cordeau, and G. Laporte, Models and branch-and-cut algorithms for pickup and delivery problems with time windows, Networks, vol.46, issue.4, pp.258-272, 2007.
DOI : 10.1002/net.20177

S. Ropke and D. Pisinger, An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows, Transportation Science, vol.40, issue.4, pp.455-472, 2006.
DOI : 10.1287/trsc.1050.0135

H. Süral and J. H. Bookbinder, The single-vehicle routing problem with unrestricted backhauls, Networks, vol.41, issue.3, pp.127-136, 2003.
DOI : 10.1002/net.10067

K. Sörensen and M. Sevaux, MAPM: memetic algorithms with population management, Computers & Operations Research, vol.33, issue.5, pp.1214-1225, 2006.
DOI : 10.1016/j.cor.2004.09.011

S. Salhi and G. Nagy, A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling, Journal of the Operational Research Society, vol.50, issue.10, pp.1034-1042, 1999.
DOI : 10.1057/palgrave.jors.2600808

M. Savelsbergh and M. Sol, Drive: Dynamic Routing of Independent Vehicles, Operations Research, vol.46, issue.4, pp.474-490, 1998.
DOI : 10.1287/opre.46.4.474

M. W. Savelsbergh and M. Sol, The General Pickup and Delivery Problem, Transportation Science, vol.29, issue.1, pp.17-29, 1995.
DOI : 10.1287/trsc.29.1.17

M. Sigurd and D. Pisinger, Scheduling Transportation of Live Animals to Avoid the Spread of Diseases, Transportation Science, vol.38, issue.2, pp.197-209, 2004.
DOI : 10.1287/trsc.1030.0053

M. M. Solomon, Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints, Operations Research, vol.35, issue.2, pp.254-265, 1987.
DOI : 10.1287/opre.35.2.254

A. Subramanian, L. Drummond, C. Bentes, L. Ochi, and R. Farias, A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery, Computers & Operations Research, vol.37, issue.11, pp.1899-1911, 2010.
DOI : 10.1016/j.cor.2009.10.011

R. Tavakkoli-moghaddam, A. Saremi, and M. Ziaee, A memetic algorithm for a vehicle routing problem with backhauls, Applied Mathematics and Computation, vol.181, issue.2, pp.1049-1060, 2006.
DOI : 10.1016/j.amc.2006.01.059

S. R. Thangiah, J. Y. Potvin, and T. Sun, Heuristic approaches to vehicle routing with backhauls and time windows, Computers & Operations Research, vol.23, issue.11, pp.1043-1057, 1996.
DOI : 10.1016/0305-0548(96)00018-4

P. Toth and D. Vigo, An Exact Algorithm for the Vehicle Routing Problem with Backhauls, Transportation Science, vol.31, issue.4, pp.372-385, 1997.
DOI : 10.1287/trsc.31.4.372

P. Toth and D. Vigo, Heuristic Algorithms for the Handicapped Persons Transportation Problem, Transportation Science, vol.31, issue.1, pp.60-71, 1997.
DOI : 10.1287/trsc.31.1.60

P. Toth and D. Vigo, A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls, European Journal of Operational Research, vol.113, issue.3, pp.528-543, 1999.
DOI : 10.1016/S0377-2217(98)00086-1

A. Wade and S. Salhi, An Ant System Algorithm for the Mixed Vehicle Routing Problem with Backhauls, pp.699-719, 2004.
DOI : 10.1007/978-1-4757-4137-7_33

H. Wang and Y. Chen, A genetic algorithm for the simultaneous delivery and pickup problems with time window, Computers & Industrial Engineering, vol.62, issue.1, pp.84-95, 2012.
DOI : 10.1016/j.cie.2011.08.018

C. A. Woodward, J. Abelson, S. Tedford, and B. Hutchison, What is important to continuity in home care?, Social Science & Medicine, vol.58, issue.1, pp.177-192, 2004.
DOI : 10.1016/S0277-9536(03)00161-8

H. Xu, Z. L. Chen, S. Rajagopal, and S. Arunapuram, Solving a Practical Pickup and Delivery Problem, Transportation Science, vol.37, issue.3, pp.347-364, 2003.
DOI : 10.1287/trsc.37.3.347.16044

C. A. Yano, T. J. Chan, L. K. Richter, T. Cutler, K. G. Murty et al., Vehicle Routing at Quality Stores, Interfaces, vol.17, issue.2, pp.52-63, 1987.
DOI : 10.1287/inte.17.2.52

E. E. Zachariadis, C. D. Tarantilis, and C. T. Kiranoudis, A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints, European Journal of Operational Research, vol.195, issue.3, pp.729-743, 2009.
DOI : 10.1016/j.ejor.2007.05.058

Y. Zhong and M. H. Cole, A vehicle routing problem with backhauls and time windows: a guided local search solution, Transportation Research Part E: Logistics and Transportation Review, vol.41, issue.2, pp.131-144, 2005.
DOI : 10.1016/j.tre.2003.12.003