Bibliographie
(Ahuja et al., 2002) R. K. Ahuja, O. Ergun, J. B.
Orlin, et A. Punnen, 2002. A survey of very large-scale neighborhood search
techniques. Discrete Applied Mathematics 123, 75-102.
(Archetti et al., 2007) C. Archetti, D. Feillet, A.
Hertz, et G. Speranza, 2007. The Capacitated Team Orienteering and Profitable
Tour Problems. Journal of the Operational Research Society. à
paraître.
(Baker et al., 1980) B. S. Baker, E. G. Coffman, et R.
L. Rivest, 1980. Orthogonal packings in two dimensions. SIAM Journal on
Computing 9(4), 846-855. SIAM.
(Balafoutis et Stergiou, 2008) T. Balafoutis et K. Stergiou,
2008. Exploiting Constraint Weights for Revision Ordering in Arc Consistency
Algorithms. Dans les actes de ECAI-2008 workshop on Modeling and Solving
Problems with Constraints.
(Balas, 1989) E. Balas, 1989. The Prize collecting traveling
salesman problem. Networks 19(6), 621-636.
(Baptiste et al., 2008) P. Baptiste, M. Flamini, et F.
Sourd, 2008. Lagrangian bounds for
just-in-time job-shop scheduling.
Computers & Operations Research 35(3), 906-915.
(Barnhart et al., 1998) C. Barnhart, L. J. Ellis, G.
L. Nemhauser, M. W. P. Savelsbergh, et P. H. Vance, 1998. Branch-and-Price :
Column Generation for Solving Huge Integer Programs. Operations Research
46(3), 316-329.
(Bauer et al., 1998) P. Bauer, J. T. Linderoth, et M.
W. P. Savelsbergh, 1998. A branch and cut approach to the cardinality
constrained circuit problem. Rapport technique, School of Industrial and
Systems Engineering, Georgia Institute of Technology, Atlanta, GA.
(Bell et McMullen, 2004) J. E. Bell et P. R. McMullen, 2004.
Ant colony optimization techniques for the vehicle routing problem.
Advanced Engineering Informatics 18(1), 41-48.
(Bellman, 1957) R. Bellman, 1957. Dynamic programming.
Princeton, New Jersey : Princeton University Press. XXV.
(Ben-Arieh et al., 2003) D. Ben-Arieh, G. Gutin, M.
Penn, A. Yeo, et A. Zverovitch, 2003. Transformations of generalized ATSP into
ATSP. Operations Research Letters 31, 357-365.
(Benoist et al., 2007) T. Benoist, E. Bourreau, et B.
Rottembourg, 2007. The TV-Break Packing Problem. European Journal of
Operational Research 176(3), 1371-1386.
(Boctor et al., 2003) F. F. Boctor, G. Laporte, et J.
Renaud, 2003. Heuristics for the Traveling Purchaser Problem. Computers
& Operations Research 30, 491-504.
(Bontoux, 2005) B. Bontoux, 2005. Méthode
métaheuristique basée sur l'optimisation à Colonie de
Fourmis appliquée au Traveling Purchaser Problem. Mémoire de
Master, Laboratoire Informatique d'Avignon.
(Bontoux et al., 2008a) B. Bontoux, C. Artigues, et
D. Feillet, 2008a. A Memetic Algorithm with a Large Neighborhood Crossover
Operator for the Generalized Traveling Salesman Problem. University of
Technology of Troyes, France. Metaheuristics for Logistics and Vehicle Routing,
EU/ME, the European Chapter on Metaheuristics.
(Bontoux et al., 2008b) B. Bontoux, C. Artigues, et
D. Feillet, 2008b. Algorithme mémétique avec un opérateur
de croisement à voisinage large pour le problème du voyageur de
commerce généralisé. Dans les actes de 9ème
congrès de la société Française de Recherche
Opérationnelle et d'Aide à la Décision (ROADEF 2008),
Clermont-Ferrand, 79-80.
(Bontoux et al., 2008c) B. Bontoux, C. Artigues, et
D. Feillet, February 2008c. Memetic Algorithm with a Large Neighborhood
Crossover Operator for the Generalized Traveling Salesman Problem. LAAS report,
Université de Toulouse, LAAS-CNRS, France. 21 p.
(Bontoux et Feillet, 2008) B. Bontoux et D. Feillet, 2008. Ant
Colony Optimization for the Traveling Purchaser Problem. Computers &
Operations Research 35, 628-637.
(Bontoux et al., 2007a) B. Bontoux, D. Feillet, et C.
Artigues, 2007a. Large Neighborhood Search for Variants of TSP. Dans les actes
de The Seventh Metaheuristics International Conference (MIC 2007),
Montréal, Canada. CDROM.
(Bontoux et al., 2007b) B. Bontoux, D. Feillet, et C.
Artigues, 2007b. Une méthode dynamique de parcours d'arbre de recherche
: Dynamic Cooperative Search. Dans les actes de 8ème congrès
de la société Française de Recherche Opérationnelle
et d'Aide à la Décision (ROADEF 2007), 99-100.
(Bontoux et al., 2007c) B. Bontoux, D. Feillet, C.
Artigues, et E. Bourreau, 2007c. Dynamic Cooperative Search for constraint
satisfaction and combinatorial optimization: application to a rostering
problem. Dans P. Baptiste, G. Kendall, A. Munier-Kordon, et F. Sourd (Eds.),
3rd Multidisciplinary International Conference on Scheduling: Theory and
Application (MISTA 2007), Paris, France, 557-560.
(Boschetti et Mingozzi, 2003a) M. A. Boschetti et A. Mingozzi,
2003a. The two-dimensional finite bin packing problem, Part I : New lower
bounds for the oriented case. 4OR : A Quarterly Journal of Operations
Research 1, 27-42.
(Boschetti et Mingozzi, 2003b) M. A. Boschetti et A. Mingozzi,
2003b. The two-dimensional finite bin packing problem, Part II : New lower
bounds and upper bounds. 4OR : A Quarterly Journal of Operations Research
1, 135-147.
(Boussemart et al., 2004) F. Boussemart, F. Hemery, C.
Lecoutre, et L. Sais, 2004. Boos-
ting systematic search by weighting
constraints. 146-150. Proceedings of ECAI'04.
(Bérubé et al., 2008) J.-F.
Bérubé, M. Gendreau, et J.-Y. Potvin, 2008. An exact
e-constraint method for bi-objective combinatorial optimization
problems : Application to the Traveling Salesman Problem with Profits.
European Journal of Operational Research. à paraître.
(Chao et al., 1996) I.-M. Chao, B. L. Golden, et E. A.
Wasil, 1996. The team orienteering problem. European Journal of Operational
Research 88(3), 464-474.
(Chazelle, 1983) B. Chazelle, 1983. The Bottom-Left Bin-Packing
Heuristic : An Efficient Implementation. IEEE Trans. Computers 32(8),
697-707.
(Cheang et al., 2003) B. Cheang, H. Li, A. Lim, et B.
Rodrigues, 2003. Nurse rostering problems - A bibliographic survey.
European Journal of Operational Research 151, 447- 460.
(Chvátal, 1997) V. Chvátal, 1997. Resolution
Search. Discrete Applied Mathematics 73(1), 81-99.
(Coffman et al., 1980) E. G. Coffman, M. R. Garey, D.
S. Johnson, et R. E. Tarjan, 1980. Performance Bounds for Level-Oriented
Two-Dimensional Packing Algorithms. SIAM Journal on Computing 9(4),
808-826. SIAM.
(Cordeau et al., 2005) J. F. Cordeau, M. Gendreau, A.
Hertz, G. Laporte, et J. S. Sormany, 2005. New heuristics for the vehicle
routing problem. Dans les actes de Logistics Systems : Design and
Optimization, 279-297. Public Health Service.
(Cordeau et Laporte, 2004) J. F. Cordeau et G. Laporte, 2004.
Metaheuristic Optimization via Memory and Evolution : Tabu Search and
Scatter Search, Chapter Tabu Search Heuristics for the Vehicle Routing
Problem, 145-163. Kluwer, Boston.
(Costa et Hertz, 1997) D. Costa et A. Hertz, 1997. Ants Can
Colour Graphs. Journal of the Operational Research Society 48,
295-305.
(Croes, 1958) G. A. Croes, 1958. A method for solving
traveling-salesman problems. Operational Research 6, 791-812.
(Danna, 2003) E. Danna, 2003. Accelerating Column Generation
with Local Search: A Case Study on the Vehicle Routing Problem with Time
Windows. Skodsborg, Denmark. ROUTE 2003 - International Workshop on Vehicle
Routing.
(Danna et al., 2005) E. Danna, E. Rothberg, et C. L.
Pape, 2005. Exploring relaxation induced neighborhoods to improve MIP
solutions. Mathematical Programming 102(1), 71-90.
(Dauzère-Pérès et Sevaux, 2004) S.
Dauzère-Pérès et M. Sevaux, 2004. An exact method to
minimize the number of tardy jobs in single machine scheduling. Journal of
Scheduling 7, 405-420.
(Dechter, 1990) R. Dechter, 1990. Enhancement schemes for
constraint processing : backjumping, learning, and cutset decomposition.
Artifical Intelligence 41(3), 273- 312. Essex, UK. Elsevier Science
Publishers Ltd.
(Dell'Amico et al., 1998) M. Dell'Amico, F. Maffioli,
et A. Sciomachen, 1998. A Lagrangian heuristic for the prize-collecting
travelling salesman problem. Annals of Operations Research 81,
289-305.
(Dell'Amico et al., 1995) M. Dell'Amico, F. Maffioli,
et P. Värbrand, 1995. On prize-collecting tours and the asymmetric
travelling salesman problem. International Transportaion Operations
Research 2(3), 297-308.
(Demassey, 2003) S. Demassey, 2003. Méthodes
hybrides de programmation par contraintes et programmation linéaire pour
le problème d'ordonnancement de projet à contraintes de
ressources. Thèse de Doctorat, Université d'Avignon.
(Desaulniers et al., 2005) Desaulniers, G., J.
Desrosiers, et M. M. Solomon (Eds.), 2005. Column Generation.
Springer.
(Descombes, 2000) R. Descombes, 2000. Les Carrés
Magiques : Histoire, théorie et technique du carré magique,de
l'Antiquité aux recherches actuelles. Editions Vuibert.
(Dijkstra, 1971) E. W. Dijkstra, 1971. A short introduction to
the art of programming. Department of Mathematics EWD-316, Technische
Hogeschool, Eindhoven.
(Dimitrijevic et Saric, 1997) V. Dimitrijevic et Z. Saric,
1997. An Efficient Transformation of the Generalized Traveling Salesman Problem
into the Traveling Salesman Problem on Digraphs. Information Sciences
102, 105-110.
(Donati et al., 2008) A. V. Donati, R. Montemanni, N.
Casagrande, A. E. Rizzoli, et L. M. Gambardella, 2008. Time dependent vehicle
routing problem with a multi ant colony system. European Journal of
Operational Research 185(3), 1174-1191.
(Dorigo et al., 1991) M. Dorigo, V. Maniezzo, et A.
Colorni, 1991. Positive feedback as a search strategy. Technical report 91-016,
Dipartimento di Elettronica Politecnico di Milano, Italy.
(Dorigo et al., 1996) M. Dorigo, V. Maniezzo, et A.
Colorni, 1996. The Ant System: Optimization by a colony of cooperating agents.
IEEE Transactions on Systems, Man, and Cybernetics-Part B 26(1),
29-41.
(Dorigo et Stutzle, 2004) M. Dorigo et T. Stutzle, 2004. Ant
Colony Optimization. Cambridge, MA : MIT Press Bradford Books.
(Doyle, 1979) J. Doyle, 1979. A Truth Maintenance System.
Artificial Intelligence 12, 231-272.
(Dror, 1994) M. Dror, 1994. Note on the Complexity of the
Shortest Path Models for Column Generation in VRPTW. Operations Research
42(5), 977-978.
(Dror et Haouari, 2000) M. Dror et M. Haouari, 2000. Generalized
Steiner Problems and Other Variants. Journal of Combinatorial Optimization
4(4), 415-436.
(Feillet et al., 2005) D. Feillet, P. Dejax, et M.
Gendreau, 2005. Traveling Salesman Problems with Profits. Transportation
Science 39(2), 188-205.
(Feillet et al., 2004) D. Feillet, P. Dejax, M.
Gendreau, et C. Gueguen, 2004. An exact algorithm for the Elementary Shortest
Path Problem with Resource Constraints : application to some vehicle routing
problems. Networks 44, 216-229.
(Fischetti et Lodi, 2003) M. Fischetti et A. Lodi, 2003. Local
branching. Mathematical Programming 98(1), 23-47.
(Fischetti et al., 1995) M. Fischetti, J. J.
Salazar-González, et P. Toth, 1995. The Symmetric Generalized Traveling
Salesman Polytope. Networks 26(2), 113-123.
(Fischetti et al., 1997) M. Fischetti, J. J.
Salazar-González, et P. Toth, 1997. A Branch-andCut algorithm for the
Symmetric Generalized Traveling Salesman Problem. Operations Research
45(3), 378-394.
(Frenc et al., 2001) A. P. Frenc, A. C. Robinson, et
J. M. Wilson, 2001. Using a Hybrid Genetic-Algorithm/Branch and Bound Approach
to Solve Feasibility and Optimization Integer Programming Problems. Journal
of Heuristics 7, 551-564.
(Frost et Dechter, 1994) D. Frost et R. Dechter, 1994. In
Search of the Best Constraint Satisfaction Search. Dans les actes de
Proceedings of the National Conference on Artificial Intelligence,
Seattle, 301-306.
(Fuellerer et al., 2008) G. Fuellerer, K. F. Doerner,
R. F. Hartl, et M. Iori, 2008. Ant colony optimization for the two-dimensional
loading vehicle routing problem. Computers & Operations Research.
à paraître.
(Garey et Johnson, 1979) M. R. Garey et D. S. Johnson, 1979.
Computers and Intractibility; A Guide to the Theory of
NP-Completeness. Freeman and Company.
(Garg et Konjevod, 2000) N. Garg et G. Konjevod, 2000. A
Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.
Journal of Algorithms 37, 66-84.
(Gaschnig, 1979) J. G. Gaschnig, 1979. Performance
measurement and analysis of certain search algorithms. Thèse de
Doctorat, Pittsburgh, USA.
(Gendreau et al., 1994) M. Gendreau, A. Hertz, et G.
Laporte, 1994. A tabu search
heuristic for the vehicle routing problem.
Management Science 40(10), 1276-1290.
(Gendreau et al., 2006) M. Gendreau, M. Iori, G.
Laporte, et S. Martello, 2006. A Tabu Search Algorithm for a Routing and
Container Loading Problem. Transportation Science 40(3), 342-350.
(Gendreau et al., 2008) M. Gendreau, M. Iori, G.
Laporte, et S. Martello, 2008. A Tabu search heuristic for the vehicle routing
problem with two-dimensional loading constraints. Networks 51(1),
4-18.
(Gendreau et al., 1997) M. Gendreau, G. Laporte, et F.
Semet, 1997. The covering tour problem. Operations Research 45,
568-576.
(Gendreau et al., 1998) M. Gendreau, G. Laporte, et F.
Semet, 1998. The Selective Traveling Salesman Problem. Networks 32,
263-273.
(Gensch, 1978) D. H. Gensch, 1978. An industrial application of
the traveling salesman subtour problem. AIIE Trans. 10(4), 362-370.
(Ginsberg, 1993) M. L. Ginsberg, 1993. Dynamic backtracking.
Journal of Artificial Intelligence Research 1, 25-46.
(Glover, 1989) F. Glover, 1989. Tabu Search - Part I. ORSA
Journal on Computing 1(3), 190-206.
(Glover et Laguna, 1997) F. Glover et M. Laguna, 1997. Tabu
Search. Kluwer Academic Publishers.
(Goldberg, 1989) D. E. Goldberg, 1989. Genetic Algorithms in
Search, Optimization and Machine Learning. Addison-Wesley Longman
Publishing Co., Inc.
(Golden et al., 1981) B. L. Golden, L. Levy, et R. Dahl,
1981. Two Generalizations of the Traveling Salesman Problem. Omega 9,
439-445.
(Golden et al., 1987) B. L. Golden, L. Levy, et R.
Vohra, 1987. The Orienteering Problem. Naval research logistics 34(3),
307-318.
(Gutin et Punnen, 2002) G. Gutin et A. Punnen, 2002. The
Traveling Salesman Problem and its variations. Dordrecht: Kluwer Academic
Publishers.
(Hachicha et al., 2000) M. Hachicha, M. J. Hodgson,
G. Laporte, et F. Semet, 2000. Heuristics for the multi-vehicle covering tour
problem. Computers & Operations Research 27(1), 29-42.
(Hansen et Mladenovi'c, 2006) P. Hansen et N. Mladenovi'c, 2006.
First vs. best improvement : An empirical study. Discrete Applied
Mathematics 154(5), 802-817.
(Hansen et al., 2006a) P. Hansen, N. Mladenovi'c, et
D. Urosevi'c, 2006a. Variable neighborhood search and local branching.
Computers & Operations Research 33(10), 3034- 3045.
(Hansen et al., 2006b) P. Hansen, N. Mladenovi'c, et
D. Uroevi'c, 2006b. Variable neighborhood search and local branching.
Computers & Operations Research 33(10), 3034- 3045.
(Haouari et Ladhari, 2003) M. Haouari et T. Ladhari, 2003. A
branch-and-bound-based local search method for the flow shop problem. The
Journal of the Operational Research Society 54(10), 1076-1084.
(Haralick et Elliot, 1980) R. Haralick et G. Elliot, 1980.
Increasing tree search efficiency for constraint satisfaction problems.
Artificial Intelligence 14, 263-313.
(Hart et al., 2005) W. E. Hart, N. Krasnogor, et J. E.
Smith, 2005. Recent Advances in Memetic Algorithms. Springer.
(Harvey et Ginsberg, 1995) W. Harvey et M. Ginsberg, 1995.
Limited discrepancy search. Dans les actes de In Proceedings of
IJCAI95, 607-613.
(Henry-Labordere, 1969) A. L. Henry-Labordere, 1969. The
record balancing problem : A dynamic programming solution of a generalized
traveling salesman problem. RAIRO B2, 43-49.
(Hooker, 2000) J. Hooker, 2000. Logic-Based Methods for
Optimization - Combining Optimization and Constraint Satisfaction.
Wiley-Interscience series in discrete mathematics and optimization. John Wiley
and Sons.
(Iori et al., 2003) M. Iori, J. J. S.
González, et D. Vigo, 2003. An exact approach for the symmetric
capacitated vehicle routing problem with two dimensional loading constraints.
Rapport technique, University of Bologna, Italy.
(Iori et al., 2007) M. Iori, J. S. Gonzàlez,
et D. Vigo, 2007. An exact approach for the vehicle routing problem with
two-dimensional loading constraints. Transportation Science 41(2),
253-264.
(Jensen et Toft, 1995) T. R. Jensen et B. Toft, 1995. Graph
Coloring Problems. Wiley.
(Karoui et al., 2007) W. Karoui, M. Huguet, P. Lopez,
et W.Naanaa, 2007. YIELDS : A yet improved limited discrepancy search for CSPs.
Dans les actes de 4th International Conference, CPAIOR 2007,
Bruxelles, Belgique, 99-111.
(Karp, 1972) R. M. Karp, 1972. Reducibility Among Combinatorial
Problems. Complexity of Computer Computations, 85-103.
(Kataoka et Morito, 1988) S. Kataoka et S. Morito, 1988. An
Algorithm for the Single Constraint Maximum Collection Problem. Journal of
Operations Research Society of Japan 31, 515-530.
(Kataoka et al., 1998) S. Kataoka, T. Yamada, et S.
Morito, 1998. Minimum directed 1-subtree relaxation for score orienteering
problem. European Journal of Operational Research 104, 139-153.
(Keller, 1985) C. P. Keller, 1985. Multiobjective routing
through space and time : The MVP and TDVP problems. Unpublished doctoral
dissertation, The University of Western Ontario, Canada.
(Keller, 1989) C. P. Keller, 1989. Algorithms to solve the
orienteering problem : A comparison. European Journal of Operational
Research 41, 224-231.
(Keller et Goodchild, 1988) C. P. Keller et M. Goodchild,
1988. The multiobjective vending problem : A generalization of the traveling
salesman problem. Environ. Planning B : Planning Design 15,
447-460.
(Kellerer et al., 2004) H. Kellerer, U. Pferschy, et D.
Pisinger, 2004. Knapsack Problems. Springer, Berlin, Germany.
(Khichane et al., 2008) M. Khichane, P. Albert, et C.
Solnon, 2008. Programmation par contraintes avec des fourmis. Journées
Francophones de Programmation par Contraintes.
(Kirkpatrick et al., 1983) S. Kirkpatrick, C. D. Gelatt,
et M. P. Vecchi, 1983. Optimization by simulated annealing. Science
220, 671-680.
(Laporte et Martello, 1990) G. Laporte et S. Martello, 1990. The
Selective Traveling Salesman Problem. Discrete Applied Mathematic 26,
193-207.
(Laporte et al., 1984) G. Laporte, H. Mercure, et Y.
Nobert, 1984. Generalized Travelling Salesman Problem through n Sets of Nodes :
the Asymmetrical Case. Discrete Applied Mathematics 18, 185-197.
(Laporte et Nobert, 1984) G. Laporte et Y. Nobert, 1984.
Generalized Travelling Salesman Problem through n Sets of Nodes : An integer
programming approach. IN-FOR 31, 61-75.
(Laporte et al., 2003) G. Laporte, J. Riera-Ledesma,
et J. J. Salazar-Gonzáles, 2003. A branch-and-cut algorithm for the
Undirected Traveling Purchaser Problem. Operations Research 51,
940-951.
(Laporte et Semet, 1999) G. Laporte et F. Semet, 1999.
Computational evaluation of a transformation procedure for the symmetric
generalized traveling salesman problem. INFOR 37, 114-120.
(Lessing et al., 2004) L. Lessing, I. Dumitrescu, et T.
Stutzle, 2004. A Comparison Between ACO Algorithms for the Set Covering
Problem. 1-12.
(Levasseur et al., 2007) N. Levasseur, P. Boizumault, et
S. Loudni, 2007. Une heuristique de sélection de valeur dirigée
par l'impact pour les WCSP. Rapport technique.
(Lien et al., 1993) Y.-N. Lien, E. Ma, et B. Wah,
1993. Transformation of the Generalized Traveling-Salesman Problem into the
Standard Traveling-Salesman Problem. Information Sciences 74,
177-189.
(Lin, 1965) S. Lin, 1965. Computer solutions of the traveling
salesman problem. 44, 2245-2269.
(Lin et Kernighan, 1973) S. Lin et B. W. Kernighan, 1973. An
Effective Heuristic Algorithm for the Traveling-Salesman Problem.
Operations Research 21, 498-516.
(Liu et Teng, 1999) D. Liu et H. Teng, 1999. An improved
BL-algorithm for genetic algorithm of the orthogonal packing of rectangles.
European Journal of Operational Research 112(2), 413-420.
(Lodi et al., 1999) A. Lodi, S. Martello, et D. Vigo,
1999. Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin
Packing Problems. INFORMS J. on Computing 11(4), 345-357.
(Lübbecke et Desrosiers, 2005) M. E. Lübbecke et J.
Desrosiers, 2005. Selected topics in column generation. Operations Research
53(6), 1007-1023.
(Man et al., 1999) K. F. Man, K. S. Tang, et S. Kwong,
1999. Genetic Algorithms : Concepts and Designs. Springer.
(Martello et al., 2000) S. Martello, M. Monaci, et D.
Vigo, 2000. An exact approach to the strip packing problem. Rapport technique,
University of Bologna, Italy.
(Martello et al., 2003) S. Martello, M. Monaci, et D.
Vigo, 2003. An Exact Approach to the Strip-Packing Problem. INFORMS J. on
Computing 15(3), 310-319.
(Martello et al., 2000) S. Martello, D. Pisinger, et D.
Vigo, 2000. The Three-Dimensional Bin Packing Problem. Operational Research
48(2), 256-267.
(Martello et Toth, 1990) Martello, S. et P. Toth (Eds.), 1990.
Knapsack Problems : Algorithms and Computer Implementations. Wiley,
Chichester.
(Martello et Vigo, 1998) S. Martello et D. Vigo, 1998. Exact
Solution of the Two-Dimensional Finite Bin Packing Problem. Management
Science 44(3), 388-399.
(Menger, 1932) K. Menger, 1932. Das botenproblem. Ergebnisse
eines mathematischen kolloquiums 2, 11-12.
(Mittenthal et Noon, 1992) J. Mittenthal et C. E. Noon, 1992.
Insert/delete heuristic for the travelling salesman subset-tour problem with
one additional constraint. Operations Research 43(3), 277-283.
(Mladenovi'c et Hansen, 1997) N. Mladenovi'c et P. Hansen, 1997.
Variable neighborhood search. Computers and Operations Research
24(11), 1097-1100.
(Montané et Galvão, 2006) F. A. T.
Montané et R. D. Galvão, 2006. A tabu search algorithm for the
vehicle routing problem with simultaneous pick-up and delivery service.
Computers & Operations Research 33(3), 595-619.
(Moscato et Cotta, 2005) P. Moscato et C. Cotta, 2005. A Gentle
Introduction to Memetic Algorithms. Operations Research & Management
Science 57(2), 105-144.
(Moscato et Norman, 1992) P. Moscato et M. G. Norman, 1992. A
Memtic approach for the traveling salesman problem implementation of a
computational ecology for combinatorial optimization on message-passing
systems. Dans les actes de Parallel Computing and Transputer
Applications, Amsterdam, 177-186. IOS Press.
(Mühlenbein et al., 1988) H. Mühlenbein, M.
Gorges-Schleuter, et O. Krämer, 1988.
Evolution algorithms in
combinatorial optimization. Parallel Computing 7, 65-85.
(Néron et al., 2008) E. Néron, F.
Tercinet, et F. Sourd, 2008. Search tree based approaches for parallel machine
scheduling. Computuers & Operations Research 35(4), 1127-1137.
(Noon et Bean, 1991) C. E. Noon et J. C. Bean, 1991. A
Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman
Problem. Operations Research 39, 623-632.
(Noon et Bean, 1993) C. E. Noon et J. C. Bean, 1993. An Efficient
Transformation of the Generalized Traveling Salesman Problem. INFOR
31, 39-44.
(Oliva, 2004) C. Oliva, 2004. Techniques hybrides de
Propagation de Contraintes et de Programmation Mathématique.
Thèse de Doctorat, Université d'Avignon.
(Ong, 1982) H. L. Ong, 1982. Approximate Algorithms for the
Traveling Purchaser Problem. Operations Research Letters, 201-205.
(Osogami et Imai, 2000) T. Osogami et H. Imai, 2000.
Classification of Various Neighborhood Operations for the Nurse Scheduling
Problem. Dans les actes de ISAAC '00 : Proceedings of the 11th
International Conference on Algorithms and Computation, London, UK, 72-83.
Springer-Verlag.
(Ow et Morton, 1988) P. S. Ow et T. E. Morton, 1988. Filtered
beam search in scheduling. International Journal of Production Research
26, 35-62.
(Palpant, 2005) M. Palpant, 2005. Recherche exacte et
approchée en optimisation combina-
toire : schémas
d'intégration et applications. Thèse de Doctorat,
Université d'Avignon.
(Pearn et Chien, 1998) W. L. Pearn et R. C. Chien, 1998. Improved
Solutions for the Traveling Purchaser Problem. Computers & Operations
Research 25, 879-885.
(Pekny et Miller, 1990) J. F. Pekny et D. L. Miller, 1990. An
exact parallel algorithm for the resource constrained travelling salesman
problem with application to scheduling with an aggregate deadline. Dans A.
Press (Ed.), ACM 18th Annual Comput. Sci. Conf., 208-214.
(Pessan et al., 2007) C. Pessan, J.-L. Bouquard, et E.
Néron, 2007. Genetic Branch-andBound or Exact Genetic Algorithm?
Artificial Evolution, 136-147.
(Pisinger et Ropke, 2007) D. Pisinger et S. Ropke, 2007. A
general heuristic for vehicle routing problems. Computers & Operations
Research 34(8), 2403-2435.
(Pisinger et Sigurd, 2007) D. Pisinger et M. Sigurd, 2007.
Using Decomposition Techniques and Constraint Programming for Solving the
Two-Dimensional Bin-Packing Problem. INFORMS J. on Computing 19(1),
36-51. Institute for Operations Research and the Management Sciences (INFORMS),
Linthicum, Maryland, USA. INFORMS.
(Prescott-Gagnon et al., 2007) E. Prescott-Gagnon, G.
Desaulniers, et L.-M. Rousseau, 2007. A Large Neighborhood Search Algorithm for
the Vehicle Routing Problem with Time Windows. Montreal, Canada. Optimization
Days.
(Prestwich, 2008) S. Prestwich, 2008. Generalised graph
colouring by a hybrid of local
search and constraint programming.
Discrete Applied Mathematics 156(2), 148-158.
(Prins, 2004) C. Prins, 2004. A simple and effective evolutionary
algorithm for the VRP. Computers & Operations Research 31,
1985-2002.
(Prosser, 1993) P. Prosser, 1993. Hybrid Algorithms for the
Constraint Satisfaction Problem. Computational Intelligence 9(3),
268-299.
(Ramesh et Brown, 1991) R. Ramesh et Brown, 1991. An efficient
four-phase heuristic for the generalized orienteering problem. Computers
& Operations Research 18(2), 151-165.
(Ramesh, 1981) T. Ramesh, 1981. Traveling Purchaser Problem.
Opsearch 18, 78-91.
(Refalo, 2004) P. Refalo, 2004. Principles and Practice of
Constraint Programming - CP 2004, Volume 3258 de Lecture Notes in
Computer Science, Chapter Impact-Based Search Strategies for Constraint
Programming, 557-571. Springer Berlin / Heidelberg.
(Reimann et al., 2004) M. Reimann, K. Doerner, et R.
F. Hartl, 2004. D-ants : savings based ants divide and conquer the vehicle
routing problem. Computers & Operations Research 31(4),
563-591.
(Reinelt, 1991) G. Reinelt, 1991. TSPLIB - A Traveling Salesman
Problem Library. ORSA Journal on Computing 3, 376-384.
(Renaud et Boctor, 1998a) J. Renaud et F. F. Boctor, 1998a. An
Efficient Composite Heuristic for the Symmetric Generalized Traveling Salesman
Problem. European Journal of Operational Research 108, 571-584.
(Renaud et Boctor, 1998b) J. Renaud et F. F. Boctor, 1998b.
Improved Heuristics for the
Traveling Purchaser Problem. European
Journal of Operational Research 108, 571-584.
(Renaud et al., 1996) J. Renaud, F. F. Boctor, et G.
Laporte, 1996. A fast composite heuristic for the symmetric traveling salesman
problem. INFORMS Journal on Computing 8, 134-143.
(Riera-Ledesma et Salazar-González, 2005) J.
Riera-Ledesma et J. J. Salazar-González, 2005. A Heuristic approach for
the Traveling Purchaser Problem. European Journal of Operational Research
162, 142-152.
(Rousseau et al., 2004) L. M. Rousseau, D. Feillet,
et M. Gendreau, 2004. New refinements for the solution of vehicle routing
problems with column generation. Le Gosier, Guadeloupe (France). TRISTAN 5.
(Schiex et Verfaillie, 1994) T. Schiex et G. Verfaillie, 1994.
Nogood recording for static and dynamic constraint satisfaction problems.
International Journal of Artificial Intelligence Tools 3, 48-55.
(Sevaux et Sörensen, 2005) M. Sevaux et K. Sörensen,
2005. Permutation distance measures for memetic algorithms with population
management. Dans les actes de Proceedings of 6th Metaheuristics
International Conference, MIC 2005, Vienna, Austria, 832-838.
(Shaw, 1998) P. Shaw, 1998. Using constraint programming and
local search methods to solve vehicle routing problems. Dans les actes de
CP-98, Fourth international conference on principles and practice of
constraint programming, Volume 1520, 417-431.
(Shi et al., 2007) X. H. Shi, Y. C. Liang, H. P. Lee,
C. Lu, et Q. X. Wang, 2007. Particle swarm optimization-based algorithms for
TSP and generalized TSP. Information Processing Letters 103,
169-176.
(Silberholz et Golden, 2007) J. Silberholz et B. Golden, 2007.
The Generalized Traveling Salesman Problem : A New Genetic Algorithm Approach.
165-181.
(Singh et Oudheusden, 1997) K. N. Singh et D. L. V.
Oudheusden, 1997. A Branch and Bound Algorithm for the Traveling Purchaser
Problem. European Journal of Operational Research 97, 571-579.
(Slavík, 1997) P. Slavík, 1997. On the
approximation of the generalized traveling salesman problem. Rapport technique,
Department of Computer Science, SUNY-Buffalo.
(Smith et Grant, 1998) B. M. Smith et S. A. Grant, 1998. Trying
Harder to Fail First. European Conference on Artificial Intelligence,
249-253.
(Snyder et Daskin, 2006) L. V. Snyder et M. S. Daskin, 2006. A
Random-Key Genetic Algorithm for the Generalized Traveling Salesman Problem.
European Journal of Operational Research 174, 38-53.
(Sörensen et Sevaux, 2006) K. Sörensen et M. Sevaux,
2006. MA|PM : memetic algorithms with population management. Computers
& Operations Research 33(5), 1214- 1225.
(Sourd et Chretienne, 1999) F. Sourd et P. Chretienne, 1999.
Fiber-to-Object Assignment Heuristics. European Journal of Operational
Research 117(1), 1-14.
(Srivastava et al., 1969) S. S. S. Srivastava, R. C. G.
Kumar, et P. Sen, 1969. Generalized Traveling Salesman Problem through n
sets of nodes. CORS Journal 7, 97-101.
(Tan et al., 2001) K. C. Tan, L. H. Leeb, Q. L. Zhua,
et K. Oua, 2001. Heuristic methods for vehicle routing problem with time
windows. Artificial Intelligence in Engineering 15(3), 281-295.
(Tang et Wang, 2006) L. Tang et X. Wang, 2006. Iterated local
search algorithm based on very large-scale neighborhood for prize-collecting
vehicle routing problem. The International Journal of Advanced
Manufacturing Technology 29(11), 1246-1258.
(Teeninga et Volgenant, 2004) A. Teeninga et A. Volgenant,
2004. Improved Heuristics
for the Traveling Purchaser Problem. Computers
& Operations Research 31, 139-150.
(Toth et Vigo, 2001) P. Toth et D. Vigo, 2001.
Branch-and-bound algorithms for the capacitated VRP. 29-51. Philadelphia, PA,
USA. Society for Industrial and Applied Mathematics.
(Toth et Vigo, 2002) P. Toth et D. Vigo, 2002. The vehicle
routing problem. Philadelphia, PA, USA : Society for industrial and
Applied Mathematics.
(Tsai et al., 2004) H. K. Tsai, J. M. Yang, Y. F.
Tsai, et C. Y. Kao, 2004. Some issues of designing genetic algorithms for
traveling salesman problems. Soft Computing 8, 689-697.
(Vose, 1998) M. D. Vose, 1998. The Simple Genetic Algorithm :
Foundations and Theory. MIT Press.
(Voß, 1996) S. Voß, 1996. Dynamic Tabu Search
Strategies for the Traveling Purchaser Problem. Annals of Operational
Research 63, 253-275.
(Wäscher et al., 2007) G. Wäscher, H.
Haussner, et H. Schumann, 2007. An improved typology of cutting and packing
problems. European Journal of Operational Research 103, 1109-1130.
(Winter et al., 1995) G. Winter, J. Périaux, M.
Galaán, et P. Cuesta, 1995. Genetic Algorithms in Engineering and
Computer Science. Wiley.
(Zanarini et Pesant, 2007) A. Zanarini et G. Pesant, 2007.
Solution Counting Algorithms for Constraint-Centered Search Heuristics. Dans
les actes de Principles and Practice of Constraint Programming - CP
2007, 743-757.
|
|
