{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T20:14:56Z","timestamp":1737576896812,"version":"3.33.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,11,22]],"date-time":"2007-11-22T00:00:00Z","timestamp":1195689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s10852-007-9071-8","type":"journal-article","created":{"date-parts":[[2007,11,21]],"date-time":"2007-11-21T15:17:12Z","timestamp":1195658232000},"page":"25-42","source":"Crossref","is-referenced-by-count":0,"title":["Distance Preserving Recombination Operator for Earth Observation Satellites Operations Scheduling"],"prefix":"10.1007","volume":"7","author":[{"given":"Andrzej","family":"Jaszkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,22]]},"reference":[{"key":"9071_CR1","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"J.E. Beasley","year":"1996","unstructured":"Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94, 392\u2013404 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9071_CR2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"K. Boese","year":"1994","unstructured":"Boese, K., Kahng, A., Muddu, S.: A new adaptive multistart technique for combinatorial global optimization. Oper. Res. Lett. 16, 101\u2013113 (1994)","journal-title":"Oper. Res. Lett."},{"key":"9071_CR3","unstructured":"Davis, L.: Adapting operator probabilities in genetic algorithms. In: Schaffer (ed.) Proceedings of the Third International Conference on Genetic Algorithms and Their Applications Morgan Kaufmann, pp. 61\u201369. San Mateo, CA (1989)"},{"key":"9071_CR4","first-page":"35","volume-title":"Network Routing Vol 8 of Handbooks in Operations Research and Management Science","author":"J. Desrosiers","year":"1995","unstructured":"Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time constrained routing and scheduling. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing Vol 8 of Handbooks in Operations Research and Management Science, pp. 35-139. North-Holland, Amsterdam (1995)"},{"issue":"4","key":"9071_CR5","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P., Hao, J.-K.: Hybrid evolutionary algorithms for graph coloring. J. Comb. Optim. 3(4), 379\u2013397 (1999)","journal-title":"J. Comb. Optim."},{"key":"9071_CR6","unstructured":"Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns Elements of Reusable Object-Oriented Software. Addison-Wesley (1994)"},{"key":"9071_CR7","first-page":"297","volume-title":"New Ideas in Optimization","author":"F. Glover","year":"1999","unstructured":"Glover, F.: Scatter search and path relinking. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 297\u2013316. McGraw-Hill, London (1999)"},{"key":"9071_CR8","doi-asserted-by":"crossref","unstructured":"Godart, J.M.: Combinatorial optimisation based decision\/support system for trip planning. In: Proceedings of the 1999 International Conference on Information and Communication Technologies in Tourism Innsbr\u00fcck (1999)","DOI":"10.1007\/978-3-7091-6373-3_31"},{"key":"9071_CR9","first-page":"297","volume":"37","author":"J. Homberger","year":"1999","unstructured":"Homberger, J., Gehring, H.: Two evolutionary meta-heuristics for the vehicle routing problem with time windows. INFOR 37, 297\u2013318 (1999)","journal-title":"INFOR"},{"issue":"2","key":"9071_CR10","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/S0377-2217(02)00830-5","volume":"151","author":"A. Jaszkiewicz","year":"2003","unstructured":"Jaszkiewicz, A., Kominek, P.: Genetic local search with distance preserving recombination operator for a vehicle routing problem. Eur. J. Oper. Res. 151(2), 352\u2013364 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9071_CR11","first-page":"184","volume-title":"Proceedings of the Sixth International Conference on Genetic Algorithms","author":"T. Jones","year":"1995","unstructured":"Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Eshelman, L. (ed.) Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 184\u2013192. Morgan Kaufmann, San Francisco, CA (1995)"},{"key":"9071_CR12","first-page":"3","volume":"29","author":"M. Kubiak","year":"2004","unstructured":"Kubiak, M.: Systematic construction of recombination operators for the vehicle routing problem. Foundation of Computing and Decision Sciences 29, 3 (2004)","journal-title":"Foundation of Computing and Decision Sciences"},{"key":"9071_CR13","first-page":"7","volume":"11","author":"E. Kuipers","year":"2003","unstructured":"Kuipers, E.: An algorithm for selecting and timetabling requests for an earth observation satellite. Bulletin de la Socieete Fran\u00e7aise de Recherche Operationnelle et d\u2019Aide a la Decision 11, 7\u201310 (2003)","journal-title":"Bulletin de la Socieete Fran\u00e7aise de Recherche Operationnelle et d\u2019Aide a la Decision"},{"key":"9071_CR14","volume-title":"Knapsack Problems, Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems, Algorithms and Computer Implementations. Wiley, England (1990)"},{"issue":"1","key":"9071_CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1162\/evco.1993.1.1.51","volume":"1","author":"Z. Michalewicz","year":"1993","unstructured":"Michalewicz, Z.: A hierarchy of evolution programs: an experimental Study. Evol. Comput. 1(1), 51\u201376 (1993)","journal-title":"Evol. Comput."},{"key":"9071_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02830-8","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z. Michalewicz","year":"1992","unstructured":"Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin Heidelberg (1992)"},{"key":"9071_CR17","doi-asserted-by":"crossref","unstructured":"Merz, P., Freisleben, B.: Search for the TSP: new results. In: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation IEEE Press, pp. 159\u2013164 (1997)","DOI":"10.1109\/ICEC.1997.592288"},{"issue":"4","key":"9071_CR18","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P. Merz","year":"2000","unstructured":"Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans. Evol. Comput. 4(4), 337\u2013352 (2000)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9071_CR19","unstructured":"ROADEF: http:\/\/www.prism.uvsq.fr\/~vdc\/ROADEF\/CHALLENGES\/2003\/ . The ROADEF Challenge (2003)"},{"key":"9071_CR20","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"E.D. Taillard","year":"1995","unstructured":"Taillard, E.D.: Comparison of iterative searches for the quadratic assignment problem. Location Sci. 3, 87\u2013105 (1995)","journal-title":"Location Sci."},{"key":"9071_CR21","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications (2002)","DOI":"10.1137\/1.9780898718515"},{"issue":"1","key":"9071_CR22","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.H. Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorem for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-007-9071-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-007-9071-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-007-9071-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T19:30:54Z","timestamp":1737574254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-007-9071-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,22]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["9071"],"URL":"https:\/\/doi.org\/10.1007\/s10852-007-9071-8","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"type":"print","value":"1570-1166"},{"type":"electronic","value":"1572-9214"}],"subject":[],"published":{"date-parts":[[2007,11,22]]}}}