{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T13:59:36Z","timestamp":1762351176516},"reference-count":27,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1051\/ro\/2014027","type":"journal-article","created":{"date-parts":[[2014,12,16]],"date-time":"2014-12-16T10:57:28Z","timestamp":1418727448000},"page":"99-121","source":"Crossref","is-referenced-by-count":19,"title":["A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems"],"prefix":"10.1051","volume":"49","author":[{"given":"Nicolas","family":"Zufferey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Vasquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2014,12,17]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"Barbulescu L., Watson J.-P., Whitley L.D. and Howe A.E., Scheduling space-ground communications for the air force satellite control network.J. Sched.7(2004) 7\u201334.","DOI":"10.1023\/B:JOSH.0000013053.32600.3c"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Barr R.S., Golden B.L., Kelly J.P., Resende M.G.C. and Stewart W.R., Designing and reporting on computational experiments with heuristic methods.J. Heuristics1(1995) 9\u201332.","DOI":"10.1007\/BF02430363"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"Bensana E., Lemaitre M. and Verfaillie G., Earth observation satellite management.Constraints4(1999) 293\u2013299.","DOI":"10.1023\/A:1026488509554"},{"key":"R4","unstructured":"Bloechliger I. and Zufferey N., A graph coloring heuristic using partial solutions and a reactive tabu scheme.Comput. Oper. Res.35(2008) 960\u2013975."},{"key":"R5","unstructured":"Cordeau J.-F., Laporte G. and Mercier A., A unified tabu search heuristic for vehicle routing problems with time windows.J. Oper. Res. Soc.52(2001) 928\u2013936."},{"key":"R6","unstructured":"Dupont A., Alverhne E. and Vasquez M., Efficient filtering and tabu search on a consistent neighbourhood for the frequency assignment problem with polarisation.Ann. Oper. Res.130(2004) 179\u2013198."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"Dupont A., Carneiro\u2013Linhares A., Artigues Ch., Feillet D., Michelon Ph. and Vasquez M., The dynamic frequency assignment problem.Eur. J. Oper. Res.195(2009) 75\u201388.","DOI":"10.1016\/j.ejor.2008.01.028"},{"key":"R8","unstructured":"M. Garey and D.S. Johnson,Computer and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco (1979)."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"M. Gendreau and J.-Y. Potvin,Handbook of metaheuristics, International Series in Operations Research & Management Science, vol. 146. Springer (2010).","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"R10","unstructured":"A. Globus, J. Crawford, J. Lohn and A. Pryor, A comparison of techniques for scheduling earth observing satellites. InProceedings of the Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-04), San Jose (2004)."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"F. Glover and M. Laguna,Tabu search. Kluwer Academic Publishers, Boston (1997).","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"R12","unstructured":"Habet D., Vasquez M. and Vimont Y., Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite.Comput. Opt. Appl.47(2010) 307\u2013333."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Hertz A., Schindl D. and Zufferey N., A solution method for a car fleet management problem with maintenance constraints.J. Heuristics15(2009) 425\u2013450.","DOI":"10.1007\/s10732-008-9072-4"},{"key":"R14","unstructured":"Johnson D.S., A theoretician\u2019s guide to the experimental analysis of algorithms.DIMACS Ser. Discr. Math. Theor. Comput. Sci.59(2002) 215\u2013259."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Lin S., Computer solutions of the traveling salesman problem.Bell System Technical Journal44(1965) 2245\u20132269.","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"key":"R16","unstructured":"Malaguti E., Monaci M. and Toth P., A metaheuristic approach for the vertex coloring problem.INFORMS J. Comput.20(2008) 302\u2013316."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"Morgenstern C., Distributed coloration neighborhood search.DIMACS Series in Discrete Math. Theor. Comput. Sci.26(1996) 335\u2013357.","DOI":"10.1090\/dimacs\/026\/16"},{"key":"R18","unstructured":"D.A. Parish,A genetic algorithm approach to automating satellite range scheduling. Master\u2019s thesis, Air Force Institute of Technology, USA (1994)."},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Ribeiro G.M., Constantino M.F. and Lorena L.A.N., Strong formulation for the spot 5 daily photograph scheduling problem.J. Combin. Opt.20(2010) 385\u2013398.","DOI":"10.1007\/s10878-009-9215-z"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"Rochat Y. and Taillard E., Probabilistic diversification and intensification in local search for vehicle routing.J. Heuristics1(1995) 147\u2013167.","DOI":"10.1007\/BF02430370"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"Vasquez M. and Hao J.-K., A heuristic approach for antenna positioning in cellular networks.J. Heuristics7(2001) 443\u2013472.","DOI":"10.1023\/A:1011373828276"},{"key":"R22","unstructured":"Vasquez M. and Hao J.-K., A logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite.Comput. Opt. Appl.20(2001) 137\u2013157."},{"key":"R23","doi-asserted-by":"crossref","unstructured":"M. Vasquez and N. Zufferey, Consistent neighborhood search for combinatorial optimization.ISRN Comput. Math.(2012) 671423.","DOI":"10.5402\/2012\/671423"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"M. Vasquez and N. Zufferey, Consistent neighborhood search for constrained assignment problems. InProceedings of the 9th International Conference on Modeling, Opt. Simul. (MOSIM 2012), Bordeaux, France (2012).","DOI":"10.5402\/2012\/671423"},{"key":"R25","unstructured":"G. Verfaillie, M. Lemaitre and T. Schiex, Russian doll search for solving constraint optimization problems. In13th National Conference on Artificial Intelligence (AAAI-96), Portland, USA (1996) 181\u2013187."},{"key":"R26","unstructured":"Zufferey N., Metaheuristics: some Principles for an efficient design.Comput. Technol. Appl.3(2012) 446\u2013462."},{"key":"R27","doi-asserted-by":"crossref","unstructured":"Zufferey N., Amstutz P. and Giaccari P., Graph colouring approaches for a satellite range scheduling problem.J. Sched.11(2008) 263\u2013277.","DOI":"10.1007\/s10951-008-0066-8"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2014027\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T09:55:57Z","timestamp":1566122157000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2014027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,17]]},"references-count":27,"journal-issue":{"issue":"1"},"alternative-id":["ro140027"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2014027","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,17]]}}}