. Bibliographie, Cours transport : 2 -définition des coûts complets de transport. http://www.logistique-1.com/fr/2-formation-logistique- conseil-audit-transport-logistique/news/news-455-cours- transport-gratuit-:-2-definition-des-coûts-complets-de- transport.html -dernière visite le 17, 2013.

R. K. Ahuja, Ö. Ergun, J. B. Orlin, and A. P. Punnen, A survey of very large-scale neighborhood search techniques, Discrete Applied Mathematics, vol.123, issue.1-3, pp.75-102, 2002.
DOI : 10.1016/S0166-218X(01)00338-9

C. Barnhart and S. Shen, Logistics Service Network Design for Time-Critical Delivery, Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling, PATAT'04, pp.86-105, 2005.
DOI : 10.1007/11593577_6

T. G. Crainic, Service network design in freight transportation, European Journal of Operational Research, vol.122, issue.2, pp.272-288, 2000.
DOI : 10.1016/S0377-2217(99)00233-7

T. G. Crainic and K. H. Kim, Chapter 8 Intermodal Transportation, of Handbooks in Operations Research and Management Science, pp.467-537, 2007.
DOI : 10.1016/S0927-0507(06)14008-6

M. Daskin and S. Owen, Location Models in Transportation, of International Series in Operations Research & Management Science, pp.321-370, 2003.
DOI : 10.1007/0-306-48058-1_10

A. Erera, M. Hewitt, M. Savelsbergh, and Y. Zhang, Improved Load Plan Design Through Integer Programming Based Local Search, Transportation Science, vol.47, issue.3, pp.412-427, 2013.
DOI : 10.1287/trsc.1120.0441

L. R. Ford and D. R. Fulkerson, Maximal flow through a network, Journal canadien de math??matiques, vol.8, issue.0, pp.399-404, 1956.
DOI : 10.4153/CJM-1956-045-5

V. Gabrel, A. Knippel, and M. Minoux, Exact solution of multicommodity network optimization problems with general step cost functions, Operations Research Letters, vol.25, issue.1, pp.15-23, 1999.
DOI : 10.1016/S0167-6377(99)00020-6
URL : https://hal.archives-ouvertes.fr/hal-01150534

V. Gabrel, A. Knippel, and M. Minoux, A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem, Journal of Heuristics, vol.9, issue.5, pp.429-445, 2003.
DOI : 10.1023/B:HEUR.0000004812.23590.a2

V. Gabrel and M. Minoux, Lp relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions, Acta Mathematica Vietnamica, vol.22, issue.1, pp.123-145, 1997.

B. Gendron, T. Crainic, and A. Frangioni, Multicommodity Capacitated Network Design, Telecommunications Network Planning, pp.1-19, 1999.
DOI : 10.1007/978-1-4615-5087-7_1

R. E. Gomory and T. C. Hu, Multi-Terminal Network Flows, Journal of the Society for Industrial and Applied Mathematics, vol.9, issue.4, pp.551-570, 1961.
DOI : 10.1137/0109047

T. Grünert, H. Sebastian, and M. Thärigen, 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, 1999.
DOI : 10.1109/HICSS.1999.772628

T. Hu, Multi-Commodity Network Flows, Operations Research, vol.11, issue.3, pp.344-360, 1963.
DOI : 10.1287/opre.11.3.344

A. I. Jarrah, E. Johnson, and L. C. Neubert, Large-Scale, Less-than-Truckload Service Network Design, Operations Research, vol.57, issue.3, pp.609-625, 2009.
DOI : 10.1287/opre.1080.0587

N. Katayama, M. Chen, and M. Kubo, A capacity scaling heuristic for the multicommodity capacitated network design problem, Journal of Computational and Applied Mathematics, vol.232, issue.1, pp.90-101, 2009.
DOI : 10.1016/j.cam.2008.10.055

T. L. Magnanti and R. T. Wong, Network Design and Transportation Planning: Models and Algorithms, Transportation Science, vol.18, issue.1, pp.1-55, 1984.
DOI : 10.1287/trsc.18.1.1

M. Minoux, Networks synthesis and optimum network design problems: Models, solution methods and applications, Networks, vol.14, issue.3, pp.313-360, 1989.
DOI : 10.1002/net.3230190305

M. Minoux, Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods, Annals of Operations Research, vol.106, issue.1/4, pp.19-46, 2001.
DOI : 10.1023/A:1014554606793
URL : https://hal.archives-ouvertes.fr/hal-01149564

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

G. Schrimpf, J. Schneider, H. Stamm-wilbrandt, and G. Dueck, Record Breaking Optimization Results Using the Ruin and Recreate Principle, Journal of Computational Physics, vol.159, issue.2, pp.139-171, 2000.
DOI : 10.1006/jcph.1999.6413

P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, Principles and Practice of Constraint Programming?CP98, pp.417-431, 1998.
DOI : 10.1007/3-540-49481-2_30

J. Tomlin, Minimum-Cost Multicommodity Network Flows, Operations Research, vol.14, issue.1, pp.44-51, 1966.
DOI : 10.1287/opre.14.1.45