F. Al-khayyal and S. Hwang, Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, Part I: Applications and model, Network Flows : Theory, Algorithms, and Applications, pp.106-130, 2007.
DOI : 10.1016/j.ejor.2005.06.047

K. Alamur, S. Alamur, and B. Y. Kara, Network hub location problems: The state of the art, European Journal of Operational Research, vol.190, issue.1, pp.1-21, 2008.
DOI : 10.1016/j.ejor.2007.06.008

. Armacost, Composite Variable Formulations for Express Shipment Service Network Design, Transportation Science, vol.36, issue.1, p.43, 2002.
DOI : 10.1287/trsc.36.1.1.571

A. A. Assad, Multicommodity network flows???A survey, Networks, vol.15, issue.1, pp.37-91, 1978.
DOI : 10.1002/net.3230080107

P. Augerat, Approche Polyèdrale du Problème de Tournées de Véhicules, p.40, 1995.

. Augerat, Computational Results With a Branch and Bound Code for the Capacitated Vehicle Routing Problem, p.40, 1995.

T. Aykin, Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem, European Journal of Operational Research, vol.79, issue.3, pp.501-523, 1994.
DOI : 10.1016/0377-2217(94)90062-0

. Baldacci, An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation, Operations Research, vol.52, issue.5, pp.723-738, 2004.
DOI : 10.1287/opre.1040.0111

. Baldacci, Recent advances in vehicle routing exact algorithms, 4OR, vol.94, issue.1???3, pp.269-298, 2007.
DOI : 10.1007/s10288-007-0063-3

. Balinski, . Quandt, M. Balinski, and R. Quandt, On an Integer Program for a Delivery Problem, Operations Research, vol.12, issue.2, pp.300-304, 1964.
DOI : 10.1287/opre.12.2.300

. Bartholdi, . Gue, J. J. Bartholdi, and K. R. Gue, Reducing Labor Costs in an LTL Crossdocking Terminal, Operations Research, vol.48, issue.6, pp.823-832, 2002.
DOI : 10.1287/opre.48.6.823.12397

. Bartholdi, . Hackman, J. J. Bartholdi, and S. T. Hackman, Warehouse & Distribution Science, p.14, 2008.

R. Bellman, On a routing problem, Quarterly of Applied Mathematics, vol.16, issue.1, pp.87-90, 1958.
DOI : 10.1090/qam/102435

. Bonnans, Interior Point Methods with Decomposition for Multicommodity Flow Problems, p.51, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00072804

S. Bramel, J. Bramel, and D. Simchi-levi, A Location Based Heuristic for General Routing Problems, Operations Research, vol.43, issue.4, pp.649-660, 1995.
DOI : 10.1287/opre.43.4.649

S. Bramel, J. Bramel, and D. Simchi-levi, Setcovering-based algorithms for the capacitated VRP, The Vehicle Routing Problem, pp.85-108, 2002.

J. F. Campbell, Integer programming formulations of discrete hub location problems, European Journal of Operational Research, vol.72, issue.2, pp.387-405, 1994.
DOI : 10.1016/0377-2217(94)90318-2

. Cánovas, Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique, European Journal of Operational Research, vol.179, issue.3, pp.990-1007, 2007.
DOI : 10.1016/j.ejor.2005.08.028

. Carrabs, Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading, INFORMS Journal on Computing, vol.19, issue.4, pp.618-632, 2007.
DOI : 10.1287/ijoc.1060.0202

A. Chabrier, Vehicle Routing Problem with elementary shortest path based column generation, Computers & Operations Research, vol.33, issue.10, pp.2972-2990, 2006.
DOI : 10.1016/j.cor.2005.02.029

C. , T. Chang, C. Tsui, and L. Y. , Optimal Solution to a Dock Door Assignment Problem, Computers and Industrial Engineering, vol.23, pp.283-286, 1992.

. Choi, . Tcha, E. Choi, and D. Tcha, A column generation approach to the heterogeneous fleet vehicle routing problem, Computers & Operations Research, vol.34, issue.7, pp.2080-2095, 2007.
DOI : 10.1016/j.cor.2005.08.002

W. Clarke, G. Clarke, and J. Wright, Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research, vol.12, issue.4, pp.568-581, 1964.
DOI : 10.1287/opre.12.4.568

. Clochard, . Naddef, J. Clochard, and D. Naddef, Use of Path Inequalities for TSP, Proceedings of the Third Workshop on Integer Programming and Combinatorial Optimization, pp.291-312, 1993.

. Cordeau, . Laporte, J. Cordeau, and G. Laporte, The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms, Quarterly Journal of the Belgian, French and Italian Operations Research Societies, vol.1, issue.2, pp.89-101, 2003.
DOI : 10.1007/s10288-002-0009-8

T. G. Crainic, Long-Haul Freight Transportation, Handbook of Transportation Science, pp.433-491, 1999.

. Crainic, . Semet, T. G. Crainic, and F. Semet, Recherche Opérationnelle et transport de marchandises, Optimisation combinatoire : applications, pp.47-115, 2005.

. Croxton, Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs, Operations Research, vol.55, issue.1, pp.146-157, 2007.
DOI : 10.1287/opre.1060.0314

S. Cunha, C. B. Cunha, and M. R. Silva, A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil, European Journal of Operational Research, vol.179, issue.3, pp.747-758, 2007.
DOI : 10.1016/j.ejor.2005.03.057

. Czarnas, Parallel Simulated Annealing for Bricriterion Optimization Problems, Lecture Notes in Computer Science: Parallel Processing and Applied Mathematics, pp.233-240, 2004.

R. Dantzig, G. B. Dantzig, and J. H. Ramser, The Truck Dispatching Problem, Management Science, vol.6, issue.1, pp.80-91, 1959.
DOI : 10.1287/mnsc.6.1.80

[. Backer, Solving Vehicle Routing Problems using Constraint Programming and Metaheuristics, Journal of Heuristics, vol.6, issue.4, pp.501-523, 2000.
DOI : 10.1023/A:1009621410177

. Desaulniers, 9. VRP with Pickup and Delivery, The Vehicle Routing Problem, pp.225-242, 2002.
DOI : 10.1137/1.9780898718515.ch9

. Doerner, Time Constrained Full Truckload Transportation: Optimizing Fleet Size and Vehicle Movements. Working Paper POM 07, p.47, 2000.

. Dumas, 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

. Finke, A twocommodity network flow approach to the traveling salesman problem, Congress Numer, vol.41, pp.167-178, 1984.

J. Fisher, M. Fisher, and R. Jaikumar, A generalized assignment heuristic for vehicle routing, Networks, vol.21, issue.2, pp.109-124, 1981.
DOI : 10.1002/net.3230110205

S. Fournier, Modèles Mathématiques pour des Problèmes de Tournées de Véhicules avec Transbordement et Ramassage et Livraison Multi-Produits, Livre des Articles de la Conférence Conjointe Francoro V, pp.117-128, 2007.

J. Garey, M. R. Garey, and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, p.28, 1979.

. Golden, Routing Vehicles in the Real World: Applications, The Vehicle Routing Problem, pp.245-286, 2002.

. Golden, Implementing vehicle routing algorithms, Networks, vol.21, issue.2, pp.113-148, 1977.
DOI : 10.1002/net.3230070203

. Golden, A Heuristic Algorithm for the Vehicle Dispatch Problem, Operations Research, vol.22, pp.340-349, 1977.

. Grünert, The design of a letter-mail transportation network by intelligent techniques, Proceedings of the 32nd Annual Hawaii International Conference on Systems Sciences. 1999. HICSS-32. Abstracts and CD-ROM of Full Papers, pp.6030-6076, 1999.
DOI : 10.1109/HICSS.1999.772628

K. Holmberg and D. Yuan, A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation, INFORMS Journal on Computing, vol.15, issue.1, pp.42-57, 2003.
DOI : 10.1287/ijoc.15.1.42.15151

. Iori, An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints, Transportation Science, vol.41, issue.2, pp.41253-264, 2007.
DOI : 10.1287/trsc.1060.0165

S. Irnich, A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles, European Journal of Operational Research, vol.122, issue.2, pp.310-328, 2000.
DOI : 10.1016/S0377-2217(99)00235-0

J. , H. Jung, S. Haghani, and A. , Genetic Algorithm for a Pickup and Delivery Problem with Time Windows, Transportation Research Record, vol.1733, pp.1-7, 2000.

B. Kara, Modeling and analysis of issues in hub location problems, p.53, 1999.

R. M. Karp, Reducibility Among Combinatorial Problems, Complexity of Computers Computations, pp.85-103, 2003.

X. Kelly, J. P. Kelly, and J. Xu, A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem, INFORMS Journal on Computing, vol.11, issue.2, pp.161-172, 1999.
DOI : 10.1287/ijoc.11.2.161

J. L. Kennington, A Survey of Linear Cost Multicommodity Network Flows, Operations Research, vol.26, issue.2, pp.209-236, 1978.
DOI : 10.1287/opre.26.2.209

. Lapierre, Designing Distribution Networks: Formulations and Solution Heuristic, Transportation Science, vol.38, issue.2, pp.174-187, 2004.
DOI : 10.1287/trsc.1030.0064

S. Laporte, G. Laporte, and F. Semet, 5. Classical Heuristics for the Capacitated VRP, The Vehicle Routing Problem, pp.109-128, 2002.
DOI : 10.1137/1.9780898718515.ch5
URL : https://hal.archives-ouvertes.fr/inserm-00350907

Y. Larsson and D. Yuan, An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing, Computational Optimization and Applications, vol.27, issue.2, pp.187-215, 2004.
DOI : 10.1023/B:COAP.0000008652.29295.eb

. Li, Crossdocking???JIT scheduling with time windows, Journal of the Operational Research Society, vol.85, issue.12, pp.551342-1351, 2004.
DOI : 10.1007/s101070050067

S. Lin, Computer Solutions of the Traveling Salesman Problem, Bell System Technical Journal, vol.44, issue.10, pp.2245-2269, 1965.
DOI : 10.1002/j.1538-7305.1965.tb04146.x

D. Mahey, . Souza, P. Mahey, D. Souza, and M. C. , Local optimality conditions for multicommodity flow problems with separable piecewise convex costs, Operations Research Letters, vol.35, issue.2, pp.221-226, 2007.
DOI : 10.1016/j.orl.2006.02.005
URL : https://hal.archives-ouvertes.fr/hal-00125824

. Martelli and A. Martelli, An application of heuristic search methods to edge and contour detection, Communications of the ACM, vol.19, issue.2, pp.73-83, 1976.
DOI : 10.1145/359997.360004

S. Michel, Inventory Routing Problem, p.31, 2006.

J. E. Mitchell, Branch-and-Cut Algorithms for Combinatorial Optimization Problems, Handbook of Applied Optimization, pp.65-77, 2002.

S. Mitrovi?-mini?-]-mitrovi?-mini?, Pickup and Delivery Problem with Time Windows: A Survey, pp.31-37, 1998.

. Mues, C. Mues, and S. Pickl, Transshipment and Time Windows in Vehicle Routing, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), pp.113-119, 2005.
DOI : 10.1109/ISPAN.2005.88

R. Naddef, D. Naddef, and G. Rinaldi, 3. Branch-And-Cut Algorithms for the Capacitated VRP, The Vehicle Routing Problem, pp.53-84, 2002.
DOI : 10.1137/1.9780898718515.ch3

S. Nagy, 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

. Nowak, Pickup and Delivery with Split Loads, Transportation Science, vol.42, issue.1, pp.53-84, 2007.
DOI : 10.1287/trsc.1070.0207

]. Kelly and M. , HUB FACILITY LOCATION WITH FIXED COSTS, Papers in Regional Science, vol.71, issue.3, pp.293-306, 1992.
DOI : 10.1111/j.1435-5597.1992.tb01848.x

I. Or, Traveling Salesman-Type Combinatorial Optimization Problems and their Relation to the Logistics of Regional Blood Banking, p.44, 1976.

. Poot, A savings based method for real-life vehicle routing problems, Journal of the Operational Research Society, vol.53, issue.1, p.34, 1999.
DOI : 10.1057/palgrave/jors/2601252

H. N. Psaraftis, A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem, Transportation Science, vol.14, issue.2, pp.130-154, 1980.
DOI : 10.1287/trsc.14.2.130

W. Racunica, I. Racunica, and L. Wynter, Optimal Location of Intermodal Freight Hubs. Rapport de recherche INRIA-RR - 4088, p.53, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00072545

M. W. Savelsbergh, Computer Aided Routing, Centrum voor Wiskunde en Infomatica, p.27, 1988.

S. Savelsbergh, 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

. Shen, A computer assistant for vehicle dispatching with learning capabilities, Annals of Operations Research, vol.27, issue.1, pp.189-211, 1995.
DOI : 10.1007/BF02098288

. Sherali, . Shetty, H. D. Sherali, and C. Shetty, Optimization with Disjunctive Constraints, p.139, 1980.
DOI : 10.1007/978-3-642-48794-1

S. Sol, M. Sol, and M. W. Savelsbergh, A Branch-and-Price Algorithm for the Pickup and Delivery Problem with Time Windows, p.41, 1994.

. Tavakkoli-moghaddam, A New Capacitated Vehicle Routing Problem with Split Service for Minimizing Fleet Cost by Simulated Annealing, Journal of the Franklin Institute, vol.344, issue.5, pp.406-425, 2007.
DOI : 10.1016/j.jfranklin.2005.12.002

S. R. Thangiah, Vehicle Routing with Time Windows Using Genetic Algorithms, editor, Applications Handbook of Genetic Algorithms: New Frontiers, pp.253-277, 1995.

. Thompson, . Psaraftis, P. M. Thompson, and H. N. Psaraftis, Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems, Operations Research, vol.41, issue.5, pp.935-946, 1993.
DOI : 10.1287/opre.41.5.935

. Topcuoglu, Solving the uncapacitated hub location problem using genetic algorithms, Computers & Operations Research, vol.32, issue.4, pp.967-984, 2005.
DOI : 10.1016/j.cor.2003.09.008

V. Toth, 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

. Tu, Optimization of Water Distribution and Water Quality by Hybrid Genetic Algorithm, Journal of Water Resources Planning and Management, vol.131, issue.6, pp.131431-440, 2005.
DOI : 10.1061/(ASCE)0733-9496(2005)131:6(431)

. Van-breedam and A. Van-breedam, An Analysis of the Behaviour of Heuristics for the Vehicle Routing Problem for a Selection of Problems with Vehicle-Related, Customer-Related and Time-Related Constraints, p.44, 1994.

D. Bruggen, Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows, Transportation Science, vol.27, issue.3, pp.298-311, 1993.
DOI : 10.1287/trsc.27.3.298

K. Walkowiak, On Application of Ant Algorithms to Non-bifurcated Multicommodity Flow Problem, Lecture Notes in Computer Science: Artificial Intelligence and Soft Computing, pp.922-927, 2004.
DOI : 10.1007/978-3-540-24844-6_143

H. P. Williams, Model Building in Mathematical Programming, p.64, 1978.

. Xu, 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

. Zhu, An Improved Particle Swarm Optimization Algorithm for Vehicle Routing Problem with Time Windows, Proceedings of the IEEE Congress on Evolutionary Computation, pp.1386-1390, 2006.