A. Figure, 5 ? Détail des informations associées à une tournée Dans la figure précédente, le chauffeur sait qu'il doit visiter trois clients. Pour chaque client la date et l'heure d'arrivée est spécifiée ainsi que l'opération qui y sera effectuée. Cette opération peut être un chargement , un déchargement

B. Majid, D. Maged, and M. , Hybrid scheduling methods for paratransit operations, Computers & Industrial Engineering, vol.45, issue.1, pp.75-96, 2003.

E. M. Beale, Branch and Bound Methods for Mathematical Programming Systems, Discrete Optimization II Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, pp.201-219, 1979.
DOI : 10.1016/S0167-5060(08)70351-0

[. Russell and H. Van, A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows, Computers & Operations Research, vol.33, issue.54, pp.875-893, 2006.

[. Gerardo, C. Jean-françois, G. Irina, and L. Gilbert, Static pickup and delivery problems : a classification scheme and survey, TOP, vol.15, issue.1, pp.1-31, 2007.

[. Gerardo, C. Jean-françois, and G. Laporte, Dynamic pickup and delivery problems, European Journal of Operational Research, vol.202, issue.57, pp.8-15, 2010.

[. Ulrich, H. Winfried, O. Peter, W. Gerhard, and J. , Steiner diagrams and k-star hubs, Selected papers from Ad Hoc Now 2005 Ad Hoc Now 2005. (Cité page 67, pp.622-634, 2007.

[. Panagiotis, S. Dimitris, D. Theodore, and S. Timos, Dynamic pickup and delivery with transfers, Advances in Spatial and Temporal Databases, pp.112-129, 2011.

[. Nils and F. Malte, Cross dock scheduling : Classification, literature review and research agenda, Omega, vol.38, issue.6, pp.413-422, 2010.

[. François, Transport de messagerie Techniques de l'ingénieur Transport et logistique, base documentaire : TIB123DUO.(ref. article : ag8151), p.2014

M. Branke2005-]-branke-jürgen, N. Martin, D. Guntram, and M. Maged, Waiting strategies for dynamic vehicle routing, Transportation Science, vol.39, issue.3, pp.298-312, 2005.

[. Olli and G. Michel, Tabu search heuristics for the vehicle routing problem with time windows, Top, vol.10, issue.2, pp.211-237, 2002.

M. Brewer2001-]-brewer-ann, J. Button-kenneth, H. David, and A. , Handbook of logistics and supply-chain management, 2001.

. Cazier2007, J. A. Cazier, and R. G. Poluha, Application of the SCOR Model in Supply Chain Management, 2007.

[. Wen-chyuan and R. Roberta, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Annals of Operations Research, vol.63, issue.1, pp.3-27, 1996.

S. Chopra and P. Meindl, Supply Chain Management. Strategy, Planning & Operation, 2007.
DOI : 10.1007/978-3-8349-9320-5_22

[. Jean-françois and L. Gilbert, 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.

E. Cortes2010-]-cortés-cristián, C. Matamala-martín, and . Claudio, The pickup and delivery problem with transfers : Formulation and a branch-and-cut solution method, European Journal of Operational Research, vol.200, issue.66, pp.711-724, 2010.

R. J. Dakin, A tree-search algorithm for mixed integer programming problems, The Computer Journal, vol.8, issue.3, pp.250-255, 1965.
DOI : 10.1093/comjnl/8.3.250

[. George, B. Ramser, and J. H. , The truck dispatching problem, Management Science, vol.10, issue.6, pp.80-91, 1959.

G. Desaulniers, J. Desrosiers, and S. M. , Column Generation. Cahiers du GERAD, 2005.

[. Ludovic, La gestion des transports et les tms, pp.2010-2025

H. Dominguez and R. S. Lashkari, Model for integrating the supply chain of an appliance company: a value of information approach, International Journal of Production Research, vol.21, issue.11, pp.2113-2140, 2004.
DOI : 10.1287/opre.14.3.486

D. Dumas-yvan, S. Jacques, and . François, 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

[. Rémy, H. Tiente, and G. Gilles, Chapter 14. metaheuristics for the solution of vehicle routing problems in a dynamic context, Metaheuristics for production scheduling. ISTE WISLEY, pp.2013-52

[. Dominique, G. Michel, M. Andrés, L. , W. Jose et al., A note on branch-and-cut-andprice, Operations Research Letters, vol.38, issue.5, pp.346-353

[. Sylvain, Outils pour des Problèmes Industriels de Tournées de Véhicules avec Transbordement. Phd, Université Joseph-Fourier -Grenoble I, pp.65-68, 2008.

[. Michael, R. , H. James, A. , and H. Sean, An investigation of the value of cross-docking for supply chain management, Journal of Business Logistics, vol.29, issue.1, pp.225-239, 2008.

[. Michel and P. Jean-yves, Handbook of Metaheuristics, 2010.

[. Fred, Tabu search ? part i, ORSA Journal on Computing, vol.1, issue.3, pp.190-206, 1989.

[. Fred, Tabu search, Encyclopedia of Operations Research and Management Science, pp.821-827, 2001.

[. Fred and M. Rafael, Tabu search, Metaheuristic Procedures for Training Neutral Networks, pp.53-69, 2006.

[. David and E. , Genetic Algorithms in Search, Optimization and Machine Learning, 1989.

[. Ingeli, N. Viswanath, and R. R. , Minimum makespan multi-vehicle dial-a-ride, Lecture Notes in Computer Science, vol.5757, pp.540-552, 2009.

[. Pierre and N. Mladenovi´cmladenovi´c, Variable neighborhood search : Principles and applications, European Journal of Operational Research, vol.130, issue.3, pp.449-467, 2001.

[. William, D. , G. Matthew, and L. , Limited discrepancy search, Proceedings of the 14th International Joint Conference on Artificial Intelligence IJCAI'95, pp.607-613, 1995.

S. C. Ho and D. Haugland, A tabu search heuristic for the vehicle routing problem with time windows and split deliveries, Computers & Operations Research, vol.31, issue.12, pp.1947-1964, 2004.
DOI : 10.1016/S0305-0548(03)00155-2

[. John and H. , Adaptation in Natural and Artificial Systems : An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence, 1992.

[. Bahman, H. Arthur, V. , A. Sant, and R. , An algorithm for the traveling salesman problem with pickup and delivery customers, European Journal of Operational Research, vol.22, issue.3, pp.377-386, 1985.

R. S. Kaplan and D. P. Norton, Le tableau de bord prospectif. Eyrolles-Éd. d'Organisation, 2003.

H. L. Kerivin, M. Lacroix, A. R. Mahjoub, and A. Quilliot, The splittable pickup and delivery problem with reloads, European J. of Industrial Engineering, vol.2, issue.2, pp.112-133, 2008.
DOI : 10.1504/EJIE.2008.017347

[. Scott, C. D. Gelatt, and M. P. Vecchi, Optimization by simulated annealing, Science, vol.220, issue.4598, pp.671-680, 1983.

[. Scott, Optimization by simulated annealing : Quantitative studies, Journal of Statistical Physics, vol.34, pp.5-6975, 1984.

[. Victor, B. , and C. Fang-tzu, The benefits of a crossdocking delivery strategy : a supply chain collaboration approach, Production Planning & Control, vol.19, issue.3, pp.229-241, 2008.

[. Gilbert, The vehicle routing problem : An overview of exact and approximate algorithms, European Journal of Operational Research, vol.59, issue.3, pp.345-358

E. L. Lawler and D. E. Wood, Branch-and-Bound Methods: A Survey, Operations Research, vol.14, issue.4, pp.699-719, 1966.
DOI : 10.1287/opre.14.4.699

[. Hau, L. , and B. Corey, Material management in decentralized supply chains, Operations Research, vol.41, issue.5, pp.835-847, 1993.

[. Hae, J. J. Woo, and L. K. Min, Vehicle routing scheduling for cross-docking in the supply chain, Computers & Industrial Engineering, vol.51, issue.2, pp.247-256, 2006.

H. Li and A. Lim, A metaheuristic for the pickup and delivery problem with time windows, Proceedings of the 13th International Conference on, pp.160-167, 2001.

[. , L. Yaoming, S. Stephen, and C. , Vehicle routing with cross-docking in the supply chain, Expert Syst. Appl, vol.37, issue.10, pp.6868-6873, 2010.

D. C. Little1963-]-little-john, M. Katta, G. Sweeney-dura, W. , and K. Caroline, An algorithm for the traveling salesman problem, Operations Research, vol.11, issue.6, pp.972-989, 1963.

K. F. Man1999-]-man, K. S. Tang, and S. Kwong, Genetic Algorithms : Concepts and Designs with Disk, 1999.

[. Renaud, Problèmes de collectes et livraisons avec transferts, École des Mines de Nantes -Nantes, pp.65-69, 2012.

[. John, T. , D. William, K. James, S. et al., Defining supply chain management, Journal of Business Logistics, vol.22, issue.2, pp.1-25, 2001.

G. Meyer2009-]-meyer-gerben, F. Kary, and H. , Intelligent products : A survey, Computers in Industry, vol.60, issue.3, pp.137-148, 2009.

[. Hokey, J. Vaidyanathan, and S. Rajesh, Combined location-routing problems : A synthesis and future research directions, European Journal of Operational Research, vol.108, issue.1, pp.1-15, 1998.

M. Sne?ana, K. Ramesh, and L. Gilbert, Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows, Transportation Research Part B : Methodological, vol.38, issue.8, pp.669-685, 2004.

[. Sne?ana and L. Gilbert, Waiting strategies for the dynamic pickup and delivery problem with time windows, Transportation Research Part B : Methodological, vol.38, issue.7, pp.635-655, 2004.

[. Sne?ana and L. Gilbert, The pickup and delivery problem with time windows and transshipment, INFOR, pp.217-227, 2006.

[. Nenad and P. Hansen, Variable neighborhood search, Computers & Operations Research, vol.24, issue.108, pp.1097-1100, 1997.

[. Christopher and P. Stefan, Transshipment and time windows in vehicle routing, Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks , ISPAN '05, pp.113-119, 2005.

[. Yoshitaka and N. Hiroshi, Worst case analysis for pickup and delivery problems with transfer, IEICE Trans. Fundam. Electron. Commun. Comput. Sci, issue.9, pp.91-2328, 2008.

[. William, P. Barnes, and J. Wesley, 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.

[. George, L. , W. Laurence, and A. , Integer and Combinatorial Optimization, 1988.

[. Stephen, J. , and P. Philip, Research frameworks in logistics : three models, seven dinners and a survey, International Journal of Physical Distribution & Logistics Management, vol.25, issue.10, pp.60-77, 1995.

[. Ocde, Indicateurs de performance pour le secteur routier : Resume des essais sur le terrain. Recherche en matière de transport routier et intermodal, OCDE, 2001.

[. Beatrice, R. Brianj, and H. Franklin, Multi-objective genetic algorithms for vehicle routing problem with time windows, Applied Intelligence, vol.24, issue.1, pp.17-30, 2006.

. Peter, Routing with Reloads, pp.65-66, 2000.

[. Sophie, N. , and D. Karlf, A survey on pickup and delivery problems, Journal für Betriebswirtschaft, vol.58, issue.1, pp.21-51, 2008.

[. Sophie, N. , and D. Karlf, A survey on pickup and delivery problems, Journal für Betriebswirtschaft, vol.58, issue.2, pp.81-117, 2008.

[. Wen and Z. Chang-yu, Solving vehicle routing problem using ant colony and genetic algorithm, Advanced Intelligent Computing Theories and Applications. With Aspects of Contemporary Intelligent Computing Techniques, pp.23-30, 2008.

[. Michael, H. Richard, F. , D. Karl, and R. Marc, A variable neighborhood search for the multi depot vehicle routing problem with time windows, Journal of Heuristics, vol.10, issue.6, pp.613-627, 2004.

[. Julie, Solving a Vehicle Routing Problem Arising in Soft Drink Distribution. Document de travail, Centre for Research on Transportation, pp.2004-2040

[. Yuan, B. Jonathan, and F. , A grasp with adaptive large neighborhood search for pickup and delivery problems with transshipment, Computers & Operations Research, vol.39, issue.69, pp.2439-2456, 2012.

]. A. Rais2014, F. Rais, M. S. Alvelos, and . Carvalho, New mixed integerprogramming model for the pickup-and-delivery problem with transshipment, European Journal of Operational Research, vol.235, issue.3, pp.530-539

[. Stefan and P. David, 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.

[. Stefan, C. Jean-françois, and L. Gilbert, Models and branch-and-cut algorithms for pickup and delivery problems with time windows, Networks, vol.49, issue.4, pp.258-272, 2007.

[. Afonso, M. G. Robson, . Da-cunha-alexandre, and . Salles, A branch-and-price algorithm for a vehicle routing problem with cross-docking, Electronic Notes in Discrete Mathematics, vol.37, issue.0, pp.249-254, 2011.

. Savelsbergh1990 and M. W. Savelsbergh, A parallel insertion heuristic for vehicle routing with side constraints, Statistica Neerlandica, vol.44, issue.3, pp.139-148, 1990.
DOI : 10.1007/BF02022044

[. Martin and S. Marc, Drive : Dynamic routing of independent vehicles, Operations Research, vol.46, issue.4, pp.474-490, 1998.

S. Shang1996-]-shang-jen, C. Carolyn, and K. , Multicriteria pickup and delivery problem with transfer opportunity, Computers & Industrial Engineering, vol.30, issue.65, pp.631-645, 1996.

T. Shaw, Performance measures of operational effectiveness for highway segments and systems. Synthesis of highway practice, Transportation Research Board, 2003.

. Simchi2003, D. Simchi-levi, P. Kaminsky, S. , and E. , Designing and Managing the Supply Chain : Concepts, Strategies, and Case Studies. Irwin/McGraw-Hill series in operations and decision sciences, 2003.

[. Marius and M. , Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research, vol.35, issue.2, pp.254-265, 1987.

[. Hartmut, Supply chain management and advanced planning -basics, overview and challenges Supply Chain Management and Advanced Planning, European Journal of Operational Research, vol.163, issue.3, pp.575-588, 2005.

[. Hartmut and K. Christoph, Supply Chain Management and Advanced Planning : Concepts, Models, Software, and Case Studies, pp.2010-2024

W. Claus and . Tapio, Extended cutting plane algorithm, Encyclopedia of Optimization, pp.959-966, 2009.

W. Claus and . Tapio, Sequential cutting plane algorithm, Encyclopedia of Optimization, pp.3471-3476, 2009.

S. Tayur, R. Ganeshan, and M. Magazine, Quantitative Models for Supply Chain Management. International Series in Operations Research & Management Science, 1999.

[. Rodrigue, J. Deschamps, and R. Dupas, A mip formulation for the pickup and delivery problem with time windows and transhipment, 14th IFAC Symposium on Information Control Problems in Manufacturing, 2012.

[. Rodrigue, J. Deschamps, and R. Dupas, A hybrid multistart heuristic for the pickup and delivery problem with and without transshipment, Proceedings of MOSIM'12 SS07A2 -Optimization logistic Systems SS07A2 -Optimization logistic Systems. (Cité page 97, 2012.

[. Rodrigue, D. Jean-christophe, and D. Rémy, Opportunistic and dynamic reconfiguration of vehicle routing problem controlled by the intelligent product, Advances in Production Management Systems. Competitive Manufacturing for Innovative Products and Services IFIP Advances in Information and Communication Technology, pp.608-613

[. Samr and A. Salman, Realtime split-delivery pickup and delivery time window problems with transfers, Central European Journal of Operations Research, vol.15, issue.4, pp.329-349, 2007.

[. Paul, M. , P. Harilaos, and N. , Cyclic transfer algorithm for multivehicle routing and scheduling problems, Operations Research, vol.41, issue.5, pp.935-946, 1993.

P. Toth and D. Vigo, The Vehicle Routing Problem, SIAM Monographs on Mathematical Modeling and Computation. Society for Industrial and Applied Mathematics (SIAM), 2002.
DOI : 10.1137/1.9780898718515

URL : https://hal.archives-ouvertes.fr/hal-01223571

[. Louis, Y. , and C. Chia-hao, A microcomputer based decision support tool for assigning dock doors in freight yards, Computers & Industrial Engineering, vol.19, pp.309-312, 1990.

. Van2012, V. Van-belle-jan, C. Paul, and . Dirk, Crossdocking : State of the art, Omega, vol.40, issue.6, pp.827-846

. Vander1993, L. J. Van-der-bruggen, J. K. Lenstra, and P. C. Schuur, Variable-depth search for the single-vehicle pickup and delivery problem with time windows, Transportation Science, vol.27, issue.3, pp.298-311, 1993.

L. Wen2009-]-wen-min, C. Jesper, C. Jens, L. Jean-françois, and . Gilbert, Vehicle routing with crossdocking. Operational Research Society, Journal, vol.60, issue.12, pp.1708-1718, 2009.

C. Y. Wong, D. Mcfarlane, A. Ahmad-zaharudin, and V. Agarwal, The intelligent product driven supply chain, IEEE International Conference on Systems, Man and Cybernetics, pp.6-124, 2002.
DOI : 10.1109/ICSMC.2002.1173319