{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T02:48:27Z","timestamp":1776912507386,"version":"3.51.2"},"reference-count":29,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1051\/ro\/2015030","type":"journal-article","created":{"date-parts":[[2015,9,9]],"date-time":"2015-09-09T06:39:10Z","timestamp":1441780750000},"page":"503-517","source":"Crossref","is-referenced-by-count":9,"title":["The Team Orienteering Pick-Up and Delivery Problem with Time Windows and its applications in fleet sizing"],"prefix":"10.1051","volume":"50","author":[{"given":"D. G.","family":"Baklagis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Dikas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Minis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2016,5,27]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"Archetti C., Feillet D., Hertz A. and Speranza M., The capacitated team orienteering and profitable tour problems.J. Oper. Res. Soc.60(2009) 831\u2013842.","DOI":"10.1057\/palgrave.jors.2602603"},{"key":"R2","unstructured":"Barnhart C., Johnson E.L., Nemhauser G.L., Savelsbergh M.W.P. and Vance P.H., Branch-and-price, Column generation for solving huge integer programs.Oper. Res.46(1998) 316\u2013329."},{"key":"R3","unstructured":"Benchmark Instances for: TOPDPTW and applications in fleet sizing. Retrieved from: http:\/\/labs.fme.aegean.gr\/deopsys\/topptw\u02d9instances (2014)."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Berbeglia G., Cordeau J., Gribkovskaia I. and Laporte G., Static pickup and delivery problems, a classification scheme and survey.TOP15(2007) 1\u201337.","DOI":"10.1007\/s11750-007-0012-5"},{"key":"R5","unstructured":"Boussier S., Feillet D. and Gendreau M., An exact algorithm for the team orienteering problem.Oper. Res.5(2007) 211\u2013230."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Chao I., Golden B. and Wasil E., The team orienteering problem.Eur. J. Oper. Res.88(1996) 464\u2013474.","DOI":"10.1016\/0377-2217(94)00289-4"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"G. Desaulniers, J. Desrosiers, I. Ioachim, M. Solomon, F. Soumis and D. Villeneuve, A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems. Fleet Management and Logistics, edited by T.G. Crainic and G. Laporte. Kluwer, Norwell, MA (1998) 57\u201393.","DOI":"10.1007\/978-1-4615-5755-5_3"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"G. Desaulniers, J. Desrosiers and M. Solomon, Column Generation. Springer Science and Business Media, Inc., New York (2005).","DOI":"10.1007\/b135457"},{"key":"R9","unstructured":"Desrochers J., Desrosiers J. and Solomon M., A new optimization algorithm for the vehicle routing prolem with time windows.Oper. Res.40(1992) 342\u2013354."},{"key":"R10","unstructured":"J. Desrosiers, M. Dumas, M. Solomon and F. Soumis, Time Constrained Routing and Scheduling.Handbooks in Operations Research and Management Science, 8: Network Routing, edited by M. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser. North-holland, Amsterdam (1995) 35\u2013139."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Dikas G. and Minis I., Scheduled Paratransit Transport Systems.Transp. Res. Part B67(2014) 18-34.","DOI":"10.1016\/j.trb.2014.05.001"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Dumas Y., Desrosiers J. and Soumis F., The pickup and delivery problem with time windows.Eur. J. Oper. Res.54(1991) 7\u201322.","DOI":"10.1016\/0377-2217(91)90319-Q"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Feillet D., A tutorial on column generation and branch-and-price for the vehicle routing problems.4OR: A Quarterly J. Oper. Res.8(2010) 407\u2013424.","DOI":"10.1007\/s10288-010-0130-z"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Feillet D., Dejax P., Gendreau M. and Gueguen C., An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints, Application to Some Vehicle Routing Problem.Networks44(2004) 217\u2013229.","DOI":"10.1002\/net.20033"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Golden B., Levy L. and Vohra R., The orienteering problem.Naval Res. Logistics34(1987) 307\u2013318.","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D"},{"key":"R16","unstructured":"W. Harvey and M. Ginsberg, Limited Discrepancy Search.Proc. of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95, Montr\u00e9al Qu\u00e9bec, Canada. Morgan Kaufmann Publishers Inc. (1995) 607\u2013615."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"S. Irnich and G. Desaulniers, Shortest Path Problems with Resource Constraints. In Column Generation, edited by G. Desaulniers, J. Desrosiers and M.M. Solomon. Springer (2005) 33\u201365.","DOI":"10.1007\/0-387-25486-2_2"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"Laumanns M., Thiele L. and Zitzler E., An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method.Eur. J. Oper. Res.169(2006) 932\u2013942.","DOI":"10.1016\/j.ejor.2004.08.029"},{"key":"R19","unstructured":"H. Li and A. Lim, A MetaHeuristic for the Pickup and Delivery Problem with Time Windows. In13th International Conference on Tools with Artificial Intelligence, Dallas(2001)."},{"key":"R20","unstructured":"Lubbecke M. and Desrosiers J., Selected Topics in Column Generation.Oper. Res.53(2005) 1007\u20131023."},{"key":"R21","doi-asserted-by":"crossref","unstructured":"Parragh S.N., Doerner K.F. and Hartl R.F., A survey on pickup and delivery problems. Part I, Transportation between customers and depots.J. f\u00fcr Betriebswirtschaft58(2008a) 21\u201351.","DOI":"10.1007\/s11301-008-0033-7"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"Parragh S.N., Doerner K.F. and Hartl R.F., A survey on pickup and delivery problems Part II, Transportation between pickup and delivery locations.J. f\u00fcr Betriebswirtschaft58(2008b) 81\u2013117.","DOI":"10.1007\/s11301-008-0036-4"},{"key":"R23","doi-asserted-by":"crossref","unstructured":"Righini G. and Salani M., New dynamic programming algorithms for the elementary shortest path problem with resource constraints.Networks51(2008) 155\u2013170.","DOI":"10.1002\/net.20212"},{"key":"R24","unstructured":"Ropke S. and Cordeau J.F., Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows.Transp. Sci.43(2009) 267\u2013286."},{"key":"R25","unstructured":"Schonberger J., Kopfer H. and Mattfeld D.C., A combined approach to solve the pickup and delivery selection problem.Oper. Res. Proc.2002(2003) 150\u2013155."},{"key":"R26","unstructured":"Ting C.K. and Liao X.L., The selective pickup and delivery problem: Formulation and a memetic algorithm.Int. J. Prod. Econ.141(2013) 199\u2013211."},{"key":"R27","doi-asserted-by":"crossref","unstructured":"P. Toth and D. Vigo, The Vehicle Routing Problem,SIAM Monogr. Discr. Math. Appl.Philadelphia (2002).","DOI":"10.1137\/1.9780898718515"},{"key":"R28","unstructured":"Tsiligirides T., Heuristic methods applied to orienteering.J. Oper. Res. Soc.37(1984) 351\u2013367."},{"key":"R29","doi-asserted-by":"crossref","unstructured":"Vansteenwegen P., Souffruau W. and Van Oudheusden D., The orienteering problem, A survey.Eur. J. Oper. Res.209(2011) 1\u201310.","DOI":"10.1016\/j.ejor.2010.03.045"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015030\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T08:44:00Z","timestamp":1567154640000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,27]]},"references-count":29,"journal-issue":{"issue":"3"},"alternative-id":["ro150030-s"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2015030","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,27]]}}}