乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T19:56:46Z","timestamp":1718740606972},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,9,21]],"date-time":"2011-09-21T00:00:00Z","timestamp":1316563200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10100-011-0231-6","type":"journal-article","created":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T11:34:26Z","timestamp":1316518466000},"page":"359-377","source":"Crossref","is-referenced-by-count":18,"title":["Exact and hybrid methods for the multiperiod field service routing problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Fabien","family":"Tricoire","sequence":"first","affiliation":[]},{"given":"Nathalie","family":"Bostel","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Dejax","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Guez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,9,21]]},"reference":[{"key":"231_CR1","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-Price: column generation for solving huge integer programs. Oper Res 46: 316\u2013329","journal-title":"Oper Res"},{"key":"231_CR2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/net.3230040106","volume":"4","author":"E Beltrami","year":"1974","unstructured":"Beltrami E, Bodin L (1974) Networks and vehicle routing for municipal waste collection. Networks 4: 65\u201394","journal-title":"Networks"},{"key":"231_CR3","volume-title":"The vehicle routing problem","author":"N Bostel","year":"2008","unstructured":"Bostel N, Dejax P, Guez P, Tricoire F (2008) Multiperiod planning and routing on a rolling horizon for field force optimization logistics. In: Golden B, Raghavan S, Wasil E (eds) The vehicle routing problem. Springer, Berlin"},{"key":"231_CR4","doi-asserted-by":"crossref","unstructured":"Br\u00e4ysy O, Gendreau M (2005a) Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transp Sci 104\u2013118","DOI":"10.1287\/trsc.1030.0056"},{"key":"231_CR5","doi-asserted-by":"crossref","unstructured":"Br\u00e4ysy O, Gendreau M (2005b) Vehicle routing problem with time windows, part II: metaheuristics. Transp Sci 119\u2013139","DOI":"10.1287\/trsc.1030.0057"},{"key":"231_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230260104","volume":"26","author":"IM Chao","year":"1995","unstructured":"Chao IM, Golden BL, Wasil E (1995) An improved heuristic for the period vehicle routing problem. Networks 26: 25\u201344","journal-title":"Networks"},{"issue":"2","key":"231_CR7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.3230140205","volume":"14","author":"N Christofides","year":"1984","unstructured":"Christofides N, Beasley JE (1984) The period routing problem. Networks 14(2): 237\u2013256","journal-title":"Networks"},{"key":"231_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J-F Cordeau","year":"1997","unstructured":"Cordeau J-F, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multidepot vehicle routing problems. Networks 30: 105\u2013119","journal-title":"Networks"},{"key":"231_CR9","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"J-F Cordeau","year":"2001","unstructured":"Cordeau J-F, Laporte G, Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc 52: 928\u2013936","journal-title":"J Oper Res Soc"},{"key":"231_CR10","doi-asserted-by":"crossref","unstructured":"Cordeau J-F, Laporte G, Pasin F, Ropke S (2009) Scheduling technicians and tasks in a telecommunications company. J Scheduling, available online","DOI":"10.1007\/s10951-010-0188-7"},{"key":"231_CR11","unstructured":"Czech ZJ, Czarnas P (2002) A parallel simulated annealing for the vehicle routing problem with time windows. In: 10th Euromicro workshop on parallel, distributed and network-based processing, pp 376\u2013383"},{"key":"231_CR12","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers M, Desrosiers J, Solomon MM (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40: 342\u2013354","journal-title":"Oper Res"},{"issue":"4","key":"231_CR13","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0167-739X(99)00118-1","volume":"17","author":"LMA Drummond","year":"2001","unstructured":"Drummond LMA, Ochi LS, Vianna DS (2001) An asynchronous parallel metaheuristic for the period vehicle routing problem. Future Gener Comput Syst 17(4): 379\u2013386","journal-title":"Future Gener Comput Syst"},{"key":"231_CR14","unstructured":"Eglese R, McCabe C (2005) Algorithms for the vehicle routing problem with time windows and a limited number of vehicles. In: Metaheuristics international conference, Vienna"},{"key":"231_CR15","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44: 216\u2013229","journal-title":"Networks"},{"key":"231_CR16","unstructured":"Feillet D, Gendreau M, Rousseau L-M (2005) New refinements for the solution of vehicle routing problems with branch and price. Technical Report C7PQMR PO2005-08-X, Centre de Recherche sur les Transports"},{"issue":"4","key":"231_CR17","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1287\/trsc.1050.0140","volume":"40","author":"PM Francis","year":"2006","unstructured":"Francis PM, Smilowitz KR, Tzur M (2006) The period vehicle routing problem with service choice. Transp Sci 40(4): 439\u2013454","journal-title":"Transp Sci"},{"key":"231_CR18","volume-title":"The vehicle routing problem","author":"PM Francis","year":"2008","unstructured":"Francis PM, Smilowitz KR, Tzur M (2008) The period vehicle routing problem and its extensions. In: Golde B, Raghavan S, Wasil E (eds) The vehicle routing problem. Springer, Berlin"},{"key":"231_CR19","unstructured":"Gambardella LM, Taillard E, Agazzi G (1999) New ideas in Optimization, chapter MACS-VRPTW\/a multiple ant colony system for vehicle routing problems with time windows, McGraw-Hill, pp 63\u201376"},{"key":"231_CR20","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting stock problem. Oper Res 9: 849\u2013859","journal-title":"Oper Res"},{"key":"231_CR21","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"PC Gilmore","year":"1963","unstructured":"Gilmore PC, Gomory RE (1963) A linear programming approach to the cutting stock problem\u2014part 2. Oper Res 11: 863\u2013888","journal-title":"Oper Res"},{"key":"231_CR22","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"PC Gilmore","year":"1965","unstructured":"Gilmore PC, Gomory RE (1965) Multistage cutting stock problems in two or more dimensions. Oper Res 13: 94\u2013120","journal-title":"Oper Res"},{"key":"231_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer, Norwell, MA"},{"key":"231_CR24","first-page":"166","volume-title":"Operations research proceedings 2002 (SOR 2002)","author":"M Gr\u00f6tschel","year":"2002","unstructured":"Gr\u00f6tschel M, Krumke SO, Rambau J, Torres LM (2002) Online-dispatching of automobile service units. In: Leopold-Wildburger U, Rendl F, W\u00e4scher G (eds) Operations research proceedings 2002 (SOR 2002). Springer, Berlinpp, pp 166\u2013173"},{"key":"231_CR25","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1057\/palgrave.jors.2600641","volume":"49","author":"E Hadjiconstantinou","year":"1998","unstructured":"Hadjiconstantinou E, Baldacci R (1998) A multi-depot period vehicle routing problem arising in the utilities sector. J Oper Res Soc 49: 1239\u20131248","journal-title":"J Oper Res Soc"},{"key":"231_CR26","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/1.9780898718515.ch13","volume-title":"The vehicle routing problem","author":"E Hadjiconstantinou","year":"2002","unstructured":"Hadjiconstantinou E, Roberts D (2002) Routing under uncertainty: an application in the scheduling of field service engineers. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM, Philadelphia, pp 331\u2013352"},{"issue":"3","key":"231_CR27","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/j.ejor.2007.08.048","volume":"195","author":"VC Hemmelmayr","year":"2009","unstructured":"Hemmelmayr VC, Doerner KF, Hartl RF (2009) A variable neighborhood search heuristic for periodic routing problems. Eur J Oper Res 195(3): 791\u2013802","journal-title":"Eur J Oper Res"},{"key":"231_CR28","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.ejor.2004.01.027","volume":"162","author":"J Homberger","year":"2005","unstructured":"Homberger J, Gehring H (2005) A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur J Oper Res 162: 220\u2013238","journal-title":"Eur J Oper Res"},{"key":"231_CR29","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(02)00363-6","volume":"148","author":"HC Lau","year":"2003","unstructured":"Lau HC, Sim M, Teo KM (2003) Vehicle routing problem with time windows and a limited number of vehicles. Eur J Oper Res 148: 559\u2013569","journal-title":"Eur J Oper Res"},{"key":"231_CR30","unstructured":"Lim A, Zhang X (2005) A two-stage heuristic for the vehicle routing problem with time windows and a limited number of vehicles. In: Proceedings of the 38th Hawaii international conference on system sciences, IEEE"},{"key":"231_CR31","unstructured":"Lim A, Wang F (2004) A smoothed dynamic tabu search embedded grasp for m-vrptw. In: Proceedings of the 16th IEEE international conference on tools with artificial intelligence (ICTAI 2004), IEEE, pp 704\u2013708"},{"key":"231_CR32","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin S (1965) Computer solutions of the travelling salesman problem. Bell Syst Tech J 44: 2245\u20132269","journal-title":"Bell Syst Tech J"},{"key":"231_CR33","unstructured":"Lourenco HR, Martin OC, St\u00fctzle T (1999) Handbook of Metaheuristics, chapter Iterated Local Search, Springer, pp 321\u2013353"},{"key":"231_CR34","unstructured":"Minoux M (1983) Programmation Math\u00e9matique, volume 2, chapitre Programmation Lin\u00e9aire g\u00e9n\u00e9ralis\u00e9e et techniques de d\u00e9composition, pp 55\u2013105"},{"key":"231_CR35","doi-asserted-by":"crossref","first-page":"1028","DOI":"10.1016\/j.ejor.2006.02.030","volume":"183","author":"M Mourgaya","year":"2007","unstructured":"Mourgaya M, Vanderbeck F (2007) Column generation based heuristic for tactical planning in multiperiod vehicle routing. Eur J Oper Res 183: 1028\u20131041","journal-title":"Eur J Oper Res"},{"key":"231_CR36","unstructured":"Or I (1976) Traveling salesman-type combinatorial optimization problems and their relation to the logistics of regional blood banking. PhD thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL"},{"key":"231_CR37","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1057\/jors.1994.197","volume":"45","author":"Y Rochat","year":"1994","unstructured":"Rochat Y, Semet F (1994) A tabu search approach for delivering pet food and flour in Switzerland. J Oper Res Soc 45: 1233\u20131246","journal-title":"J Oper Res Soc"},{"key":"231_CR38","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat Y, Taillard E (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1: 147\u2013167","journal-title":"J Heuristics"},{"key":"231_CR39","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/B:ANOR.0000032576.73681.29","volume":"130","author":"LM Rousseau","year":"2004","unstructured":"Rousseau LM, Gendreau M, Pesant G, Focacci F (2004) Solving VRPTW with constraint programming based column generation. Ann Oper Res 130: 199\u2013216","journal-title":"Ann Oper Res"},{"issue":"1","key":"231_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230090102","volume":"9","author":"RA Russel","year":"1979","unstructured":"Russel RA, Igo W (1979) An assignment routing problem. Networks 9(1): 1\u201317","journal-title":"Networks"},{"key":"231_CR41","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.46.4.474","volume":"46","author":"MWP Savelsbergh","year":"1998","unstructured":"Savelsbergh MWP, Sol M (1998) Drive: dynamic routing of independent vehicles. Oper Res 46: 474\u2013490","journal-title":"Oper Res"},{"key":"231_CR42","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper Res 35: 254\u2013265","journal-title":"Oper Res"},{"key":"231_CR43","unstructured":"Tricoire F (2006) Optimisation des tourn\u00e9es de v\u00e9hicules et de personnels de maintenance : application \u00e0 la distribution et au traitement des eaux. PhD Thesis, Universit\u00e9 de Nantes, France"},{"key":"231_CR44","unstructured":"Van Breedam A (1994) An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customer-related, and time-related constraints. PhD Thesis, Anvers University"},{"key":"231_CR45","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1057\/palgrave.jors.2600746","volume":"50","author":"A Weintraub","year":"1999","unstructured":"Weintraub A, Aboud J, Fernandez C, Laporte G, Ramirez E (1999) An emergency vehicle dispatching system for an electric utility in Chile. J Oper Res Soc 50: 690\u2013696","journal-title":"J Oper Res Soc"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-011-0231-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-011-0231-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-011-0231-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T22:48:28Z","timestamp":1560638908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-011-0231-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,21]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["231"],"URL":"https:\/\/doi.org\/10.1007\/s10100-011-0231-6","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,21]]}}}