. .. État, 111 6.2.3 Problème de la tournée couvrante bi-objectif

.. .. Méthode, 114 6.3.2 Étape 1 : Calcul d'une borne inférieure LB

. .. Résultats-expérimentaux,

. .. Conclusion-du-chapitre,

, La méthode SOGA, quant à elle, trouve 63 points en 1037.2 secondes pour un hypervolume de 85.1%. Il existe tout de même quelques instances pour lesquelles notre méthode est plus rapide, points en 2022.5 secondes pour un hypervolume de 84.5%

, Nous allons donc comparer SEM sur les instances utilisées pour le MCTP avec une distance maximale de couverture ? variable. Les résultats sont reportés dans le tableau 6.6 qui présente une colonne |Y| pour le nombre de points non dominés et une colonne Temps pour le temps CPU en secondes pour obtenir l'ensemble complet minimal, BOMCTP traité dans ce chapitre

E. Glize, R. Roberti, and N. Jozefowiez, Cela signifie que la variante du BOMCTP étudiée dans ce chapitre offre un compromis entre les deux objectifs. Par exemple, l'instance D1-1-25-75-6 contient 29 points non dominés et les deux points extrêmes sont les couples (coût ; distance de couverture) suivants : (730; 2934) et (11047; 658). La solution optimale du MCTP trouvée pour l'instance D1-1-25-75-6 correspond au point non dominé (6651; 931) et est située au milieu de Y N . Nous pouvons également noter que la valeur de la cardinalité maximale n n'influence pas le nombre de points non dominés. Au contraire, plus le nombre de points de service 1, Ulrich Ngueveu. Exact Methods for Mono-Objective and Bi-Objective Multi-Vehicle Covering Tour Problems

E. Glize, N. Jozefowiez, and S. U. Ngueveu, An ?-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems, Computers & Operations Research (C&OR)

E. Glize and N. Jozefowiez, Sandra Ulrich Ngueveu. Branch-and-price algorithms for bi-objective vehicle routing problems, ODYSSEUS, the Seventh International Workshop on Freight Transportation and Logistics, 2018.

E. Glize and N. Jozefowiez, Sandra Ulrich Ngueveu. Branch-and-price algorithms for the Bi-Objective Vehicle Routing Problem with Time Windows, Multiple Objective Programming and Goal Programming, 2017.

, Conférences internationales sans acte

E. Glize, N. Jozefowiez, and S. U. Ngueveu, Exact Method for Biobjective Vehicle Routing Problems, the 7 th meeting of EURO Working group on Vehicle Routing and Logistics optimization, 2019.

E. Glize, N. Jozefowiez, and S. U. Ngueveu, Exact methods for the Bi-Objective Vehicle Routing Problem, the 6 th meeting of EURO Working group on Vehicle Routing and Logistics optimization, 2017.

, Conférence nationale sans acte

E. Glize, N. Jozefowiez, and S. U. Ngueveu, Algorithme de branch-andprice pour les problèmes de tournées de véhicules bi-objectifs, ROADEF, 19 eme congrés annuel de la société Française de Recherche Opérationnelle et d'Aide à la Décision, 2018.

C. Table and . Ha, 3: Résultats de notre méthode et celle de Hà et al. sur des instances avec |V | = 200, 2013.

M. Basset, L. Abdel-fatah, and A. K. Sangaiah, Metaheuristic algorithms : A comprehensive review, Computational Intelligence for Multimedia Big Data on the Cloud with Engineering Applications, pp.185-231, 2018.

R. Abounacer, M. Rekik, and J. Renaud, An exact solution approach for multi-objective location-transportation problem for disaster response. Computers & Operations Research, vol.41, pp.83-93, 2014.

Y. P. Aneja and K. P. Nair, Bicriteria transportation problem, Management Science, vol.25, issue.1, pp.73-78, 1979.

L. H. Appelgren, A column generation algorithm for a ship scheduling problem. Transportation, Science, vol.3, issue.1, pp.53-68, 1969.

R. Arab, S. Ghaderi, and R. Tavakkoli-moghaddam, Solving a new multi-objective inventoryrouting problem by a non-dominated sorting genetic algorithm, International Journal of Engineering-Transactions A : Basics, vol.31, issue.4, pp.588-596, 2018.

C. Archetti, D. Feillet, A. Hertz, and M. G. Speranza, The capacitated team orienteering and profitable tour problems, Journal of the Operational Research Society, vol.60, issue.6, pp.831-842, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01299943

C. Artigues, N. Jozefowiez, and B. M. Sarpong, Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective, EURO Journal on Computational Optimization, pp.1-26, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01875892

P. Augerat, J. M. Belenguer, E. Benavent, A. Corberán, D. Naddef et al., Computational results with a branch and cut code for the capacitated vehicle routing problem. IMAG, 1995.

R. Baldacci, M. A. Boschetti, V. Maniezzo, and M. Zamboni, Scatter search methods for the covering tour problem, Metaheuristic Optimization via Memory and Evolution, pp.59-91, 2005.

R. Baldacci, N. Christofides, and A. Mingozzi, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Mathematical Programming, vol.115, issue.2, pp.351-385, 2008.

R. Baldacci, A. Mingozzi, and R. Roberti, New route relaxation and pricing strategies for the vehicle routing problem, Operations Research, vol.59, issue.5, pp.1269-1283, 2011.

M. L. Balinski and R. E. Quandt, On an integer program for a delivery problem, Operations Research, vol.12, issue.2, pp.300-304, 1964.

C. Bazgan, H. Hugot, and D. Vanderpooten, Solving efficiently the 0-1 multi-objective knapsack problem, Computers & Operations Research, vol.36, issue.1, pp.260-279, 2009.

J. E. Beasley, Route first-cluster second methods for vehicle routing, Omega, vol.11, issue.4, pp.403-408, 1983.

T. Bekta? and G. Laporte, The pollution-routing problem, Transportation Research Part B : Methodological, vol.45, issue.8, pp.1232-1250, 2011.

R. Bellman, Dynamic programming, Science, vol.153, issue.3731, pp.34-37, 1966.

J. Bérubé, M. Gendreau, and J. Potvin, An exact ?-constraint method for bi-objective combinatorial optimization problems : Application to the traveling salesman problem with profits, European Journal of Operational Research, vol.194, issue.1, pp.39-50, 2009.

N. Boland, H. Charkhgard, and M. Savelsbergh, A criterion space search algorithm for biobjective integer programming : The balanced box method, INFORMS Journal on Computing, vol.27, issue.4, pp.735-754, 2015.

N. Boland, H. Charkhgard, and M. Savelsbergh, The quadrant shrinking method : A simple and efficient algorithm for solving tri-objective integer programs, European Journal of Operational Research, vol.260, issue.3, pp.873-885, 2017.

H. Bouly, A. Moukrim, D. Chanteur, and L. Simon, Un algorithme de destruction/construction itératif pour la résolution d'un probleme de tournées de véhicules spécifique, MOSIM, vol.8, pp.1593-1602, 2008.

S. Boussier, D. Feillet, and M. Gendreau, An exact algorithm for team orienteering problems, vol.4, pp.211-230, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01315417

S. E. Butt and T. M. Cavalier, A heuristic for the multiple tour maximum collection problem, Computers & Operations Research, vol.21, issue.1, pp.101-111, 1994.

S. E. Butt and D. M. Ryan, An optimal solution procedure for the multiple tour maximum collection problem using column generation, Computers & Operations Research, vol.26, issue.4, pp.427-441, 1999.

M. E. Captivo, J. Clímaco, J. Figueira, E. Martins, and J. L. Santos, Solving bicriteria 0-1 knapsack problems using a labeling algorithm, Computers & Operations Research, vol.30, issue.12, pp.1865-1886, 2003.

L. Chalmet, L. Lemonidis, and D. Elzinga, An algorithm for the bi-criterion integer programming problem, European Journal of Operational Research, vol.25, issue.2, pp.292-300, 1986.

I. Chao, B. L. Golden, and E. A. Wasil, The team orienteering problem, European Journal of Operational Research, vol.88, issue.3, pp.464-474, 1996.

V. , Edmonds polytopes and a hierarchy of combinatorial problems, Discrete Mathematics, vol.4, issue.4, pp.305-337, 1973.

G. Clarke and J. W. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Operations Research, vol.12, issue.4, pp.568-581, 1964.

C. Contardo and R. Martinelli, A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints, Discrete Optimization, vol.12, pp.129-146, 2014.

L. Costa, C. Contardo, and G. Desaulniers, Exact branch-price-and-cut algorithms for vehicle routing, Transportation Science, 2019.

J. R. Current and D. A. Schilling, The covering salesman problem, Transportation Science, vol.23, issue.3, pp.208-213, 1989.

J. R. Current and D. A. Schilling, The median tour and maximal covering tour problems : Formulations and heuristics, European Journal of Operational Research, vol.73, issue.1, pp.114-126, 1994.

K. Dächert, J. Gorski, and K. Klamroth, An augmented weighted tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems, Computers & Operations Research, vol.39, issue.12, pp.2929-2943, 2012.

D. Dang, R. El-hajj, and E. A. Moukrim, A branch-and-cut algorithm for solving the team orienteering problem, International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp.332-339, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00917153

G. B. Dantzig and J. H. Ramser, The truck dispatching problem, Management Science, vol.6, issue.1, pp.80-91, 1959.

M. P. De-aragao and E. Uchoa, Integer program reformulation for robust branch-and-cutand-price algorithms, Mathematical Program in Rio : a Conference in Honour of Nelson Maculan, pp.56-61, 2003.

E. Demir, T. Bekta?, and G. Laporte, The bi-objective pollution-routing problem, European Journal of Operational Research, vol.232, issue.3, pp.464-478, 2014.

G. Desaulniers, F. Lessard, and E. A. Hadjar, Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows, Transportation Science, vol.42, issue.3, pp.387-404, 2008.

M. Desrochers, J. Desrosiers, and E. M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Operations Research, vol.40, issue.2, pp.342-354, 1992.

J. Desrosiers, F. Soumis, and M. Desrochers, Routing with time windows by column generation, Networks, vol.14, issue.4, pp.545-565, 1984.

. Bibliographie,

J. Desrosiers, J. B. Gauthier, and M. E. Lübbecke, Row-reduced column generation for degenerate master problems, European Journal of Operational Research, vol.236, issue.2, pp.453-460, 2014.

C. Dhaenens, J. Lemesre, and E. Talbi, K-ppm : A new exact method to solve multiobjective combinatorial optimization problems, European Journal of Operational Research, vol.200, issue.1, pp.45-53, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00522771

M. Dror, Note on the complexity of the shortest path models for column generation in vrptw, Operations Research, vol.42, issue.5, pp.977-978, 1994.

O. Du-merle, D. Villeneuve, J. Desrosiers, and P. Hansen, Stabilized column generation, Discrete Mathematics, vol.194, issue.1-3, pp.229-237, 1999.

M. Ehrgott and X. Gandibleux, A survey and annotated bibliography of multiobjective combinatorial optimization, OR-Spektrum, vol.22, issue.4, pp.425-460, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00462047

M. Ehrgott and X. Gandibleux, Bounds and bound sets for biobjective combinatorial optimization problems, Multiple Criteria Decision Making in the New Millennium, pp.241-253, 2001.

M. Ehrgott and X. Gandibleux, Bound sets for biobjective combinatorial optimization problems, Computers & Operations Research, vol.34, issue.9, pp.2674-2694, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00462004

M. Ehrgott and S. Ruzika, Improved ?-constraint method for multiobjective programming, Journal of Optimization Theory and Applications, vol.138, issue.3, p.375, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00466662

M. Ehrgott and D. M. Ryan, Constructing robust crew schedules with bicriteria optimization, Journal of Multi-Criteria Decision Analysis, vol.11, issue.3, pp.139-150, 2002.

M. Ehrgott and D. Tenfelde-podehl, Computation of ideal and nadir values and implications for their use in mcdm methods, European Journal of Operational Research, vol.151, issue.1, pp.119-139, 2003.

R. El-hajj, D. Dang, and E. A. Moukrim, Solving the team orienteering problem with cutting planes, Computers & Operations Research, vol.74, pp.21-30, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01300334

D. Feillet, A tutorial on column generation and branch-and-price for vehicle routing problems, vol.4, pp.407-424, 2010.
URL : https://hal.archives-ouvertes.fr/emse-00505959

D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, An exact algorithm for the elementary shortest path problem with resource constraints : Application to some vehicle routing problems, Networks : An International Journal, vol.44, issue.3, pp.216-229, 2004.

J. R. Figueira, L. Paquete, M. Simões, and D. Vanderpooten, Algorithmic improvements on dynamic programming for the bi-objective {0, 1} knapsack problem, Computational Optimization and Applications, vol.56, issue.1, pp.97-111, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01505666

M. Fischetti, J. J. Gonzalez, and P. Toth, Solving the orienteering problem through branch-and-cut, INFORMS Journal on Computing, vol.10, issue.2, pp.133-148, 1998.

D. A. Flores-garza, M. A. Salazar-aguilar, S. U. Ngueveu, and G. Laporte, The multi-vehicle cumulative covering tour problem, Annals of Operations Research, vol.258, issue.2, pp.761-780, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01880113

H. Fouchal, X. Gandibleux, and F. Lehuédé, Preferred solutions computed with a label setting algorithm based on choquet integral for multi-objective shortest paths, 2011 IEEE Symposium on Computational Intelligence in Multicriteria Decision-Making (MDCM), pp.143-150, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00669568

R. Fukasawa, H. Longo, J. Lysgaard, M. P. De-aragão, M. Reis et al., Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Mathematical Programming, vol.106, issue.3, pp.491-511, 2006.

D. Gavalas, C. Konstantopoulos, K. Mastakas, and G. Pantziou, A survey on algorithmic approaches for solving tourist trip design problems, Journal of Heuristics, vol.20, issue.3, pp.291-328, 2014.

B. Gavish, The delivery problem : New cutting planes procedure, TIMS XXVI conference, 1984.

M. Gendreau, G. Laporte, and F. Semet, The covering tour problem, Operations Research, vol.45, issue.4, pp.568-576, 1997.

M. Gendreau, G. Laporte, and F. Semet, A branch-and-cut algorithm for the undirected selective traveling salesman problem, An International Journal, vol.32, issue.4, pp.263-273, 1998.

A. M. Geoffrion, Proper efficiency and the theory of vector maximization, Journal of Mathematical Analysis and Applications, vol.22, issue.3, pp.618-630, 1968.

B. E. Gillett and L. R. Miller, A heuristic algorithm for the vehicle-dispatch problem, Operations Research, vol.22, issue.2, pp.340-349, 1974.

M. T. Godinho, L. Gouveia, and T. L. Magnanti, Combined route capacity and route length models for unit demand vehicle routing problems, Discrete Optimization, vol.5, issue.2, pp.350-372, 2008.

R. E. Gomory, Outline of an algorithm for integer solutions to linear programs, Bulletin of the American Mathematical society, vol.64, issue.5, pp.275-278, 1958.

A. Gunawan, H. C. Lau, and P. Vansteenwegen, Orienteering problem : A survey of recent variants, solution approaches and applications, European Journal of Operational Research, vol.255, issue.2, pp.315-332, 2016.

W. J. Gutjahr and N. Dzubur, Bi-objective bilevel optimization of distribution center locations considering user equilibria, Transportation Research Part E : Logistics and Transportation Review, vol.85, pp.1-22, 2016.

M. H. Ha, N. Bostel, A. Langevin, and L. Rousseau, An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices, European Journal of Operational Research, vol.226, issue.2, pp.211-220, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00816026

M. Hachicha, M. J. Hodgson, G. Laporte, and F. Semet, Heuristics for the multi-vehicle covering tour problem, Computers & Operations Research, vol.27, issue.1, pp.29-42, 2000.

Y. Haimes, L. Lasdon, and D. Wismer, On a bicriterion formulation of the problems of integrated system identification and system optimization, IEEE transactions on systems, man, and cybernetics, vol.1, issue.3, pp.296-297, 1971.

E. E. Halvorsen-weare and M. W. Savelsbergh, The bi-objective mixed capacitated general routing problem with different route balance criteria, European Journal of Operational Research, vol.251, issue.2, pp.451-465, 2016.

H. W. Hamacher, C. R. Pedersen, and E. S. Ruzika, Finding representative systems for discrete bicriterion optimization problems, Operations Research Letters, vol.35, issue.3, pp.336-344, 2007.

P. Hansen, Bicriterion path problems, Multiple criteria decision making theory and application, pp.109-127, 1980.

M. J. Hodgson, G. Laporte, and F. Semet, A covering tour model for planning mobile health care facilities in suhumdistrict, ghama, Journal of Regional Science, vol.38, issue.4, pp.621-638, 1998.

S. Irnich and G. Desaulniers, Shortest path problems with resource constraints, Column generation, pp.33-65, 2005.

G. R. Jahanshahloo, F. Hosseinzadeh, N. Shoja, and G. Tohidi, A method for generating all efficient solutions of 0-1 multi-objective linear programming problem, Applied Mathematics and Computation, vol.169, issue.2, pp.874-886, 2005.

M. Jepsen, B. Petersen, S. Spoorendonk, and D. Pisinger, Subset-row inequalities applied to the vehicle-routing problem with time windows, Operations Research, vol.56, issue.2, pp.497-511, 2008.

J. Jorge, Nouvelles propositions pour la résolution exacte du sac à dos multi-objectif unidimensionnel en variables binaires, 2010.

N. Jozefowiez, A branch-and-price algorithm for the multivehicle covering tour problem, Networks, vol.64, issue.3, pp.160-168, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01913508

N. Jozefowiez, F. Semet, and E. Talbi, The bi-objective covering tour problem, Computers & Operations Research, vol.34, issue.7, pp.1929-1942, 2007.

N. Jozefowiez, F. Semet, and E. Talbi, Multi-objective vehicle routing problems, European Journal of Operational Research, vol.189, issue.2, pp.293-309, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00831915

M. Kammoun, H. Derbel, M. Ratli, and B. Jarboui, An integration of mixed vnd and vns : the case of the multivehicle covering tour problem, International Transactions in Operational Research, vol.24, issue.3, pp.663-679, 2017.

M. Keshtkaran, K. Ziarati, A. Bettinelli, and D. Vigo, Enhanced exact solution methods for the team orienteering problem, International Journal of Production Research, vol.54, issue.2, pp.591-601, 2016.

S. Kim, K. Chang, and J. Lee, A descent method with linear programming subproblems for nondifferentiable convex optimization, Mathematical Programming, vol.71, issue.1, pp.17-28, 1995.

G. Kirlik and S. Say?n, A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems, European Journal of Operational Research, vol.232, issue.3, pp.479-488, 2014.

K. Klamroth and M. M. Wiecek, Dynamic programming approaches to the multiple criteria knapsack problem, Naval Research Logistics (NRL), vol.47, issue.1, pp.57-76, 2000.

A. A. Kovacs, S. N. Parragh, and R. F. Hartl, The multi-objective generalized consistent vehicle routing problem, European Journal of Operational Research, vol.247, issue.2, pp.441-458, 2015.

N. Labadie and C. Prodhon, A survey on multi-criteria analysis in logistics : Focus on vehicle routing problems, Applications of Multi-Criteria and Game Theory Approaches, pp.3-29, 2014.
URL : https://hal.archives-ouvertes.fr/hal-02489708

M. Labbé and G. Laporte, Maximizing user convenience and postal service efficiency in post box location, Belgian Journal of Operations Research, vol.26, pp.21-35, 1986.

G. Laporte and S. Martello, The selective travelling salesman problem, Discrete Applied Mathematics, vol.26, issue.2-3, pp.193-207, 1990.

G. Laporte and Y. Nobert, A branch and bound algorithm for the capacitated vehicle routing problem, Operations-Research-Spektrum, vol.5, issue.2, pp.77-85, 1983.

G. Laporte, Y. Nobert, and M. Desrochers, Optimal routing under capacity and distance restrictions, Operations Research, vol.33, issue.5, pp.1050-1073, 1985.

M. Laumanns, L. Thiele, and E. E. Zitzler, An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method, European Journal of Operational Research, vol.169, issue.3, pp.932-942, 2006.

F. Lehuédé, R. Masson, S. N. Parragh, O. Péton, and F. Tricoire, A multi-criteria large neighbourhood search for the transportation of disabled people, Journal of the Operational Research Society, vol.65, issue.7, pp.983-1000, 2014.

M. Leitner, I. Ljubi?, and M. Sinnl, A computational study of exact approaches for the bi-objective prize-collecting steiner tree problem, INFORMS Journal on Computing, vol.27, issue.1, pp.118-134, 2014.

J. Lemesre, C. Dhaenens, and E. Talbi, Parallel partitioning method (ppm) : A new exact method to solve bi-objective problems, Computers & Operations Research, vol.34, issue.8, pp.2450-2462, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00269956

R. Lopes, V. A. Souza, and A. S. Da-cunha, A branch-and-price algorithm for the multivehicle covering tour problem, Electronic Notes in Discrete Mathematics, vol.44, pp.61-66, 2013.

J. Lysgaard, A. N. Letchford, and R. W. Eglese, A new branch-and-cut algorithm for the capacitated vehicle routing problem, Mathematical Programming, vol.100, issue.2, pp.423-445, 2004.

R. E. Marsten, W. Hogan, and J. W. Blankenship, The boxstep method for large-scale optimization, Operations Research, vol.23, issue.3, pp.389-405, 1975.

E. Q. Martins, On a multicriteria shortest path problem, European Journal of Operational Research, vol.16, issue.2, pp.236-245, 1984.

P. Matl, R. F. Hartl, and T. Vidal, Workload equity in vehicle routing : The impact of alternative workload resources, Computers & Operations Research, vol.110, pp.116-129, 2019.

G. Mavrotas, Effective implementation of the ?-constraint method in multi-objective mathematical programming problems, Applied Mathematics and Computation, vol.213, issue.2, pp.455-465, 2009.

G. Mavrotas and K. Florios, An improved version of the augmented ?-constraint method (augmecon2) for finding the exact pareto set in multi-objective integer programming problems, Applied Mathematics and Computation, vol.219, issue.18, pp.9652-9669, 2013.

J. C. Molina, I. Eguia, J. Racero, and F. Guerrero, Multi-objective vehicle routing problem with cost and emission functions, Procedia-Social and Behavioral Sciences, vol.160, pp.254-263, 2014.

K. Murakami, A column generation approach for the multi-vehicle covering tour problem, 2014 IEEE International Conference on Automation Science and Engineering (CASE), pp.1063-1068, 2014.

K. Murakami, Iterative column generation algorithm for generalized multi-vehicle covering tour problem, Asia-Pacific Journal of Operational Research, vol.35, issue.04, p.1850021, 2018.

Z. Naji-azimi, J. Renaud, A. Ruiz, and M. Salari, A covering tour approach to the location of satellite distribution centers to supply humanitarian aid, European Journal of Operational Research, vol.222, issue.3, pp.596-605, 2012.

P. Neumayer and D. Schweigert, Three algorithms for bicriteria integer linear programs, Operations-Research-Spektrum, vol.16, issue.4, pp.267-276, 1994.

P. C. Nolz, K. F. Doerner, W. J. Gutjahr, and R. F. Hartl, A bi-objective metaheuristic for disaster relief operation planning, Advances in Multi-Objective Nature Inspired Computing, pp.167-187, 2010.

W. A. Oliveira, A. C. Moretti, and E. F. Reis, Multi-vehicle covering tour problem : building routes for urban patrolling, Pesquisa Operacional, vol.35, issue.3, pp.617-644, 2015.

M. Özlen and M. Azizo?lu, Multi-objective integer programming : a general approach for generating all non-dominated solutions, European Journal of Operational Research, vol.199, issue.1, pp.25-35, 2009.

M. Özlen, B. A. Burton, and C. A. Macrae, Multi-objective integer programming : An improved recursive algorithm, Journal of Optimization Theory and Applications, vol.160, issue.2, pp.470-482, 2014.

Ö. Özpeynirci and M. Köksalan, An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs, Management Science, vol.56, issue.12, pp.2302-2315, 2010.

V. Pareto, Cours d'économie politique, vol.1, 1896.

J. Park, J. Lee, S. Ahn, J. Bae, and H. Tae, Exact algorithm for the capacitated team orienteering problem with time windows, Mathematical Problems in Engineering, 2017.

S. N. Parragh and F. Tricoire, Branch-and-bound for bi-objective integer programming, INFORMS Journal on Computing, vol.31, issue.4, pp.805-822, 2019.

D. Pecin, A. Pessoa, M. Poggi, and E. E. Uchoa, Improved branch-cut-and-price for capacitated vehicle routing, Mathematical Programming Computation, vol.9, issue.1, pp.61-100, 2017.

A. Pessoa, R. Sadykov, and E. E. Uchoa, Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems, European Journal of Operational Research, vol.270, issue.2, pp.530-543, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01664844

T. A. Pham, M. H. Hà, and X. H. Nguyen, Solving the multi-vehicle multi-covering tour problem, Computers & Operations Research, vol.88, pp.258-278, 2017.

A. Pigatti, M. P. De-aragao, and E. E. Uchoa, Stabilized branch-and-cut-and-price for the generalized assignment problem, Electronic Notes in Discrete Mathematics, vol.19, pp.389-395, 2005.

M. Poggi, H. Viana, and E. E. Uchoa, The team orienteering problem : Formulations and branchcut and price, 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10), 2010.

A. Przybylski and X. Gandibleux, Multi-objective branch and bound, European Journal of Operational Research, vol.260, issue.3, pp.856-872, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01717951

A. Przybylski, X. Gandibleux, and M. Ehrgott, A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme, INFORMS Journal on Computing, vol.22, issue.3, pp.371-386, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00461784

R. Ramesh, Y. Yoon, and M. H. Karwan, An optimal algorithm for the orienteering tour problem, ORSA Journal on Computing, vol.4, issue.2, pp.155-165, 1992.

L. B. Reinhardt and D. Pisinger, Multi-objective and multi-constrained non-additive shortest path problems, Computers & Operations Research, vol.38, issue.3, pp.605-616, 2011.

P. Reiter and W. J. Gutjahr, Exact hybrid algorithms for solving a bi-objective vehicle routing problem, Central European Journal of Operations Research, vol.20, issue.1, pp.19-43, 2012.

G. Righini and M. Salani, Symmetry helps : Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints, Discrete Optimization, vol.3, issue.3, pp.255-273, 2006.

G. Righini and M. Salani, Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming, Computers & Operations Research, vol.36, issue.4, pp.1191-1203, 2009.

S. Røpke, Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems. Presentation in Column Generation, 2012.

L. Rousseau, M. Gendreau, and D. Feillet, Interior point stabilization for column generation, Operations Research Letters, vol.35, issue.5, pp.660-668, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01311478

J. Sáez-aguado and P. C. Trandafir, Variants of the ?-constraint method for biobjective integer programming problems : ap plication to p-median-cover problems, Mathematical Methods of Operations Research, vol.87, issue.2, pp.251-283, 2018.

W. Souffriau, P. Vansteenwegen, J. Vertommen, G. V. Berghe, and D. V. Oudheusden, A personalized tourist trip design algorithm for mobile tourist guides, Applied Artificial Intelligence, vol.22, issue.10, pp.964-985, 2008.

F. Sourd and O. Spanjaard, A multiobjective branch-and-bound framework : Application to the biobjective spanning tree problem, INFORMS Journal on Computing, vol.20, issue.3, pp.472-484, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01170228

R. E. Steuer and E. Choo, An interactive weighted tchebycheff procedure for multiple objective programming, Mathematical Programming, vol.26, issue.3, pp.326-344, 1983.

T. Stidsen, K. A. Andersen, and B. Dammann, A branch and bound algorithm for a class of biobjective mixed integer programs, Management Science, vol.60, issue.4, pp.1009-1032, 2014.

J. Sylva and A. Crema, A method for finding the set of non-dominated vectors for multiple objective integer linear programs, European Journal of Operational Research, vol.158, issue.1, pp.46-55, 2004.

H. Tang and E. Miller-hooks, A tabu search heuristic for the team orienteering problem, Computers & Operations Research, vol.32, issue.6, pp.1379-1407, 2005.

E. M. Toro, J. F. Franco, M. G. Echeverri, and F. G. Guimarães, A multi-objective model for the green capacitated location-routing problem considering environmental impact, Computers & Industrial Engineering, vol.110, pp.114-125, 2017.

P. Toth and A. Tramontani, An integer linear programming local search for capacitated vehicle routing problems, The vehicle routing problem : Latest advances and new challenges, pp.275-295, 2008.

P. Toth and D. Vigo, Vehicle routing : problems, methods, and applications. SIAM, 2014.

F. Tricoire, A. Graf, and W. J. Gutjahr, The bi-objective stochastic covering tour problem, Computers & Operations Research, vol.39, issue.7, pp.1582-1592, 2012.

T. Tsiligirides, Heuristic methods applied to orienteering, Journal of the Operational Research Society, vol.35, issue.9, pp.797-809, 1984.

E. L. Ulungu and J. Teghem, The two phases method : An efficient procedure to solve biobjective combinatorial optimization problems. Foundations of Computing and Decision Sciences, vol.20, pp.149-165, 1995.

F. Vanderbeck, Implementing mixed integer column generation, Column generation, pp.331-358, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00342630

P. Vansteenwegen, W. Souffriau, and D. Van-oudheusden, The orienteering problem : A survey, European Journal of Operational Research, vol.209, issue.1, pp.1-10, 2011.

C. A. Vega-mejía, J. R. Montoya-torres, and S. M. Islam, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations : a systematic literature review, Annals of Operations Research, pp.1-65, 2017.

. Bibliographie,

B. Villarreal and M. H. Karwan, An interactive dynamic programming approach to multicriteria discrete programming. journal of mathematical analysis and applications, vol.81, pp.524-544, 1981.

M. Visée, J. Teghem, M. Pirlot, and E. L. Ulungu, Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem, Journal of Global Optimization, vol.12, issue.2, pp.139-155, 1998.

K. , Vilfredo Pareto's Manuel d'économie politique, 1913.

H. Yu and W. Solvang, An improved multi-objective programming with augmented ?constraint method for hazardous waste location-routing problems, International Journal of Environmental Research and Public Health, vol.13, issue.6, p.548, 2016.

W. Zhang and M. Reimann, A simple augmented[U+220A]-constraint method for multiobjective mathematical integer programming problems, European Journal of Operational Research, vol.234, issue.1, pp.15-24, 2014.

E. Zitzler and L. Thiele, Multiobjective optimization using evolutionary algorithms-a comparative case study, International Conference on Parallel Problem Solving from Nature, pp.292-301, 1998.

E. Zitzler, L. Thiele, M. Laumanns, C. M. Fonseca, and V. Da-fonseca-grunert, Performance assessment of multiobjective optimizers : An analysis and review, vol.139, 2002.