{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:12:41Z","timestamp":1777471961242,"version":"3.51.4"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,2,3]],"date-time":"2011-02-03T00:00:00Z","timestamp":1296691200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10489-011-0278-z","type":"journal-article","created":{"date-parts":[[2011,2,2]],"date-time":"2011-02-02T04:10:28Z","timestamp":1296619828000},"page":"585-604","source":"Crossref","is-referenced-by-count":27,"title":["Development of a maritime transportation planning support system for car carriers based on genetic algorithm"],"prefix":"10.1007","volume":"36","author":[{"given":"Moo Hong","family":"Kang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyung Rim","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyun Soo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byung Joo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,3]]},"reference":[{"issue":"1","key":"278_CR1","first-page":"28","volume":"34","author":"O Alfredo","year":"2005","unstructured":"Alfredo O, Omar V (2005) Adaptive memory programming for the vehicle routing problem with multiple trips. Comput Oper Res 34(1):28\u201347","journal-title":"Comput Oper Res"},{"key":"278_CR2","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.ejor.2005.06.047","volume":"176","author":"F Al-Khayyal","year":"2007","unstructured":"Al-Khayyal F, Hwang SJ (2007) Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, part\u00a0I: application and model. Eur J Oper Res 176:106\u2013130","journal-title":"Eur J Oper Res"},{"key":"278_CR3","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice: evolutionary strategies, evolutionary programming, genetic algorithms","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck T (1996) Evolutionary algorithms in theory and practice: evolutionary strategies, evolutionary programming, genetic algorithms. Oxford University Press, London"},{"key":"278_CR4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0968-090X(97)00005-3","volume":"5","author":"P Badeau","year":"1997","unstructured":"Badeau P, Guertin F, Gendreau M, Potvin J, Taillard E (1997) A\u00a0parallel tabu search heuristic for the vehicle routing problem with time windows. Transp Res, Part C, Emberging Technol 5:109\u2013122","journal-title":"Transp Res, Part C, Emberging Technol"},{"key":"278_CR5","first-page":"10","volume-title":"Proc. fourth international conference on genetic algorithms","author":"S Bagchi","year":"1991","unstructured":"Bagchi S, Uckun S, Miyabe Y, Kawamura K (1991) Exploring problem-specific recombination operators for job shop scheduling. In: Proc. fourth international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp\u00a010\u201317"},{"key":"278_CR6","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/S0305-0548(02)00051-5","volume":"30","author":"BM Baker","year":"2003","unstructured":"Baker BM, Ayechew MA (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res 30:787\u2013800","journal-title":"Comput Oper Res"},{"issue":"2","key":"278_CR7","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/trsc.34.2.180.12302","volume":"34","author":"JE Beasley","year":"2002","unstructured":"Beasley JE, Krishnamoorthy M, Sharaiha YM, Bramsom DA (2002) Scheduling aircraft landings the static case. Transp Sci 34(2):180\u2013197","journal-title":"Transp Sci"},{"key":"278_CR8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.aei.2004.07.001","volume":"18","author":"JE Bell","year":"2004","unstructured":"Bell JE, McMullen PR (2004) Ant colony optimization techniques for the vehicle routing problem. Adv Eng Inform 18:41\u201348","journal-title":"Adv Eng Inform"},{"key":"278_CR9","unstructured":"Brindle A (1981) Genetic algorithms for function optimization. Unpublished Ph.D. thesis, University of Alberta, Edmonton"},{"issue":"6","key":"278_CR10","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1287\/mnsc.12.6.B224","volume":"12","author":"LE Briskin","year":"1966","unstructured":"Briskin LE (1966) Selecting delivery dates in the tanker scheduling problem. Manag Sci 12(6):224\u2013234","journal-title":"Manag Sci"},{"key":"278_CR11","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1016\/j.cor.2005.05.017","volume":"34","author":"G Br\u00f8nmo","year":"2007","unstructured":"Br\u00f8nmo G, Christiansen M, Fagerholt K, Nygreen B (2007) A\u00a0multi-start local search heuristic for ship scheduling\u2014a computational study. Comput Oper Res 34:900\u2013917","journal-title":"Comput Oper Res"},{"key":"278_CR12","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1287\/mnsc.33.3.335","volume":"33","author":"GG Brown","year":"1987","unstructured":"Brown GG, Graves GW, Ronen D (1987) Scheduling ocean transportation of crude oil. Manag Sci 33:335\u2013346","journal-title":"Manag Sci"},{"key":"278_CR13","first-page":"114","volume":"1418","author":"J Burger","year":"1998","unstructured":"Burger J, Salois M, Begin R (1998) A hybrid genetic algorithm for the vehicle routing problem with time windows. Lect Notes Artif Intell 1418:114\u2013127","journal-title":"Lect Notes Artif Intell"},{"key":"278_CR14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0927-0507(06)14004-9","volume":"14","author":"M Christiansen","year":"2007","unstructured":"Christiansen M, Fagerholt K, Nygreen B, Ronen D (2007) Maritime transportation. Handb Oper Res Manag Sci 14:189\u2013284","journal-title":"Handb Oper Res Manag Sci"},{"key":"278_CR15","first-page":"346","volume":"30","author":"EY Chung","year":"2004","unstructured":"Chung EY, Park YB (2004) A genetic algorithm for vehicle routing problems with mixed delivery and pick-up. J Korean Inst Ind Eng 30:346\u2013354","journal-title":"J Korean Inst Ind Eng"},{"key":"278_CR16","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clark","year":"1964","unstructured":"Clark G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568\u2013581","journal-title":"Oper Res"},{"key":"278_CR17","unstructured":"Cordeau JF, Laporte G (2002) Tabu search heuristics for the vehicle routing problem\/GERAD G-2002-15"},{"key":"278_CR18","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/nav.3800010309","volume":"1","author":"GB Dantzig","year":"1954","unstructured":"Dantzig GB, Fulkerson DR (1954) Minimizing the number of tankers to meet a fixed schedule. Nav Res Logist Q 1:217\u2013222","journal-title":"Nav Res Logist Q"},{"key":"278_CR19","volume-title":"Oder-based genetic algorithms and the graph coloring problem. Handbook of genetic algorithms","author":"L Davis","year":"1991","unstructured":"Davis L (1991) Oder-based genetic algorithms and the graph coloring problem. Handbook of genetic algorithms. Van Nostrand-Reinhold, New York"},{"issue":"10","key":"278_CR20","first-page":"2964","volume":"34","author":"M David","year":"2005","unstructured":"David M, Olli B (2005) Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Comput Oper Res 34(10):2964\u20132975","journal-title":"Comput Oper Res"},{"key":"278_CR21","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.omega.2004.03.005","volume":"33","author":"TC Du","year":"2005","unstructured":"Du TC, Li EY, Chou D (2005) Dynamic vehicle routing for online B2C delivery. Omega 33:33\u201345","journal-title":"Omega"},{"issue":"5","key":"278_CR22","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1111\/j.1475-3995.1999.tb00167.x","volume":"6","author":"K Fagerholt","year":"1999","unstructured":"Fagerholt K (1999) Optimal fleet design in a ship routing problem. Int Trans Oper Res 6(5):453\u2013464","journal-title":"Int Trans Oper Res"},{"key":"278_CR23","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(00)00098-9","volume":"131","author":"K Fagerholt","year":"2001","unstructured":"Fagerholt K (2001) Ship scheduling with soft time windows: an optimisation based approach. Eur J Oper Res 131:559\u2013571","journal-title":"Eur J Oper Res"},{"key":"278_CR24","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0167-9236(02)00193-8","volume":"37","author":"K Fagerholt","year":"2004","unstructured":"Fagerholt K (2004) A computer-based decision support system for vessel fleet scheduling\u2014experience and future research. Decis Support Syst 37:35\u201347","journal-title":"Decis Support Syst"},{"key":"278_CR25","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1057\/palgrave.jors.2600973","volume":"51","author":"K Fagerholt","year":"2000","unstructured":"Fagerholt K, Christiansen M (2000) A combined ship scheduling and allocation problem. J Oper Res Soc 51:834\u2013842","journal-title":"J Oper Res Soc"},{"key":"278_CR26","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1016\/j.cor.2006.10.006","volume":"35","author":"AE Fallahi","year":"2008","unstructured":"Fallahi AE, Prins C, Calvo RW (2008) A genetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Comput Oper Res 35:1725\u20131741","journal-title":"Comput Oper Res"},{"issue":"1","key":"278_CR27","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/1520-6750(198902)36:1<27::AID-NAV3220360103>3.0.CO;2-0","volume":"36","author":"ML Fisher","year":"1989","unstructured":"Fisher ML, Rosenwein MB (1989) An interactive optimization system for bulk-cargo ship scheduling. Nav Res Logist 36(1):27\u201342","journal-title":"Nav Res Logist"},{"key":"278_CR28","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10489-006-0033-z","volume":"27","author":"TH Franklin","year":"2007","unstructured":"Franklin TH, Beatrice MOB (2007) Dynamic vehicle routing using genetic algorithms. Appl Intell 27:89\u201399","journal-title":"Appl Intell"},{"key":"278_CR29","volume-title":"Genetic algorithms and engineering design","author":"M Gen","year":"1997","unstructured":"Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, New York"},{"key":"278_CR30","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 40:1276\u20131290","journal-title":"Manag Sci"},{"issue":"1","key":"278_CR31","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0305-0483(02)00064-6","volume":"31","author":"I George","year":"2003","unstructured":"George I, Manolis K, Gregory P (2003) A problem generator-solver heuristic for vehicle routing with soft time windows. Omega 31(1):41\u201353","journal-title":"Omega"},{"key":"278_CR32","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading"},{"key":"278_CR33","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1016\/j.ejor.2006.05.009","volume":"180","author":"I Gribkovskaia","year":"2007","unstructured":"Gribkovskaia I, Halskau O, Laporte G, Vlcek M (2007) General solutions to the single vehicle routing problem with pickups and deliveries. Eur J Oper Res 180:568\u2013584","journal-title":"Eur J Oper Res"},{"key":"278_CR34","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1016\/j.ejor.2005.11.070","volume":"180","author":"D Haugland","year":"2007","unstructured":"Haugland D, Ho SC, Laporte G (2007) Designing delivery districts for the vehicle routing problem with stochastic demands. Eur J Oper Res 180:997\u20131010","journal-title":"Eur J Oper Res"},{"issue":"3","key":"278_CR35","first-page":"1720","volume":"177","author":"IC Herminia","year":"2005","unstructured":"Herminia IC, Carment G, Maria-Jose O, Belen S (2005) A\u00a0goal programming approach to vehicle routing problems with soft time windows. Eur J Oper Res 177(3):1720\u20131733","journal-title":"Eur J Oper Res"},{"issue":"16","key":"278_CR36","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1016\/j.dam.2006.04.009","volume":"154","author":"H Hideki","year":"2006","unstructured":"Hideki H, Toshihide I, Shinji I, Mutsunori Y (2006) The vehicle routing problem with flexible time windows and traveling times. Discrete Appl Math 154(16):2271\u20132290","journal-title":"Discrete Appl Math"},{"key":"278_CR37","doi-asserted-by":"crossref","first-page":"1947","DOI":"10.1016\/S0305-0548(03)00155-2","volume":"31","author":"SC Ho","year":"2004","unstructured":"Ho SC, Haugland D (2004) A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput Oper Res 31:1947\u20131964","journal-title":"Comput Oper Res"},{"key":"278_CR38","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0925-5273(98)00250-3","volume":"62","author":"S Hoberger","year":"1999","unstructured":"Hoberger S, Park Y (1999) A heuristic for Bi-objective vehicle routing with time window constraints. Int J Prod Econ 62:249\u2013258","journal-title":"Int J Prod Econ"},{"key":"278_CR39","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in natural and artificial systems","author":"HJ Holland","year":"1992","unstructured":"Holland HJ (1992) Adaptation in natural and artificial systems. MIT Press, Cambridge"},{"key":"278_CR40","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1016\/j.compchemeng.2003.08.009","volume":"28","author":"AS Jetlund","year":"2004","unstructured":"Jetlund AS, Karimi IA (2004) Improving the logistics of multi-compartment chemical tankers. Comput Chem Eng 28:1267\u20131283","journal-title":"Comput Chem Eng"},{"issue":"1","key":"278_CR41","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s00773-006-0240-7","volume":"12","author":"J Jia","year":"2007","unstructured":"Jia J (2007) Investigations of vehicle securing without lashings for Ro-Ro ships. J Mar Sci Technol 12(1):43\u201357","journal-title":"J Mar Sci Technol"},{"key":"278_CR42","volume-title":"Proceedings of the 2002 IEEE international symposium on intelligent control","author":"WR Jih","year":"2002","unstructured":"Jih WR, Kao CY, Hsu JY (2002) Using family competition genetic algorithm in pickup and delivery problem with time window constraints. In: Proceedings of the 2002 IEEE international symposium on intelligent control"},{"key":"278_CR43","first-page":"556","volume-title":"Korea intelligent information systems society","author":"JU Jung","year":"2007","unstructured":"Jung JU, Choi HR, Kim HS, Park BJ (2007) Development of car carrier\u2019s maritime transportation planning system. In: Korea intelligent information systems society. Autumn season academic meeting 2007, pp\u00a0556\u2013563"},{"key":"278_CR44","volume-title":"2004 IEEE international conference on systems, man and cybernetics","author":"P Karmmarti","year":"2004","unstructured":"Karmmarti P, Hammadi S, Borne P, Ksouri MA (2004) New hybrid evolutionary approach for the pickup and delivery problem with time windows. In: 2004 IEEE international conference on systems, man and cybernetics"},{"key":"278_CR45","volume-title":"Decision support system: an organizational perspective","author":"PG Keen","year":"1978","unstructured":"Keen PG, Scott M (1978) Decision support system: an organizational perspective. Addison-Wesley, New York"},{"key":"278_CR46","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/S0360-8352(97)00223-4","volume":"33","author":"SH Kim","year":"1997","unstructured":"Kim SH, Lee KK (1997) An optimization-based decision support system for ship scheduling. Comput Ind Eng 33:689\u2013692","journal-title":"Comput Ind Eng"},{"key":"278_CR47","first-page":"34","volume":"353","author":"SY Kim","year":"2003","unstructured":"Kim SY (2003) Recent market trend of car carrier. Mon Marit Korea 353:34\u201342","journal-title":"Mon Marit Korea"},{"issue":"3","key":"278_CR48","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/nav.3800130307","volume":"13","author":"J Laderman","year":"1966","unstructured":"Laderman J, Gleiberman L, Egan JF (1966) Vessel allocation by linear programming. Nav Res Logist Q 13(3):315\u2013320","journal-title":"Nav Res Logist Q"},{"key":"278_CR49","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","volume":"7","author":"G Laporte","year":"2000","unstructured":"Laporte G, Gendreau M, Potvin JY, Semet F (2000) Classical and modern heuristics for the vehicle routing problem. Int Trans Oper Res 7:285\u2013300","journal-title":"Int Trans Oper Res"},{"key":"278_CR50","volume-title":"13th IEEE international conference on tools with artificial intelligence","author":"HC Lau","year":"2001","unstructured":"Lau HC, Liang Z (2001) Pickup and delivery with time windows: algorithms and test case generation. In: 13th IEEE international conference on tools with artificial intelligence, Dallas, USA"},{"key":"278_CR51","volume-title":"International sea transport: the year ahead","author":"SA Lawrence","year":"1972","unstructured":"Lawrence SA (1972) International sea transport: the year ahead. Lexington Books, Lexington"},{"issue":"1","key":"278_CR52","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/s10489-008-0136-9","volume":"32","author":"CY Lee","year":"2010","unstructured":"Lee CY, Lee ZJ, Lin SW, Ying KC (2010) An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem. Appl Intell 32(1):88\u201395","journal-title":"Appl Intell"},{"key":"278_CR53","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J Lenstra","year":"1981","unstructured":"Lenstra J, Kan R (1981) Complexity of vehicle routing and scheduling problems. Networks 11:221\u2013227","journal-title":"Networks"},{"key":"278_CR54","volume-title":"13th IEEE international conference on tools with artificial intelligence","author":"H Li","year":"2001","unstructured":"Li H, Lim A (2001) A metaheuristic for the pickup and delivery problem with time windows. In: 13th IEEE international conference on tools with artificial intelligence, Dallas, USA"},{"key":"278_CR55","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1057\/palgrave.jors.2600763","volume":"50","author":"FH Liu","year":"1999","unstructured":"Liu FH, Shen SY (1999) The fleet size and mix vehicle routing problem with time windows. J Oper Res Soc 50:721\u2013732","journal-title":"J Oper Res Soc"},{"key":"278_CR56","unstructured":"Mitsui OSK Lines LTD (2007) Investor guidebook"},{"issue":"3","key":"278_CR57","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1016\/S0360-8352(97)00275-1","volume":"34","author":"G Mosheiov","year":"1998","unstructured":"Mosheiov G (1998) Vehicle routing with pick-up and delivery: tour-partitioning heuristics. Comput Ind Eng 34(3):669\u2013684","journal-title":"Comput Ind Eng"},{"key":"278_CR58","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","volume":"34","author":"WP Nanry","year":"2000","unstructured":"Nanry WP, Barnes JW (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Transp Res Part B 34:107\u2013121","journal-title":"Transp Res Part B"},{"key":"278_CR59","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","volume":"24","author":"B Ombuk","year":"2006","unstructured":"Ombuk B, Ross BJ, Hanshar F (2006) Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl Intell 24:17\u201330","journal-title":"Appl Intell"},{"key":"278_CR60","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"LH Osman","year":"1993","unstructured":"Osman LH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41:421\u2013451","journal-title":"Ann Oper Res"},{"key":"278_CR61","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/S0360-8352(03)00077-9","volume":"45","author":"BJ Park","year":"2003","unstructured":"Park BJ, Choi HR, Kim HS (2003) A hybrid GA for job shop scheduling problems. Comput Ind Eng 45:597\u2013613","journal-title":"Comput Ind Eng"},{"key":"278_CR62","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34:2403\u20132435","journal-title":"Comput Oper Res"},{"key":"278_CR63","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF00126629","volume":"6","author":"JY Potvin","year":"1996","unstructured":"Potvin JY, Dube D, Robillard C (1996) A hybrid approach to vehicle routing using neural networks and genetic algorithms. Appl Intell 6:241\u2013252","journal-title":"Appl Intell"},{"issue":"3","key":"278_CR64","first-page":"1478","volume":"176","author":"D Rodolfo","year":"2006","unstructured":"Rodolfo D, Jaime C (2006) A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. Eur J Oper Res 176(3):1478\u20131507","journal-title":"Eur J Oper Res"},{"key":"278_CR65","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/opre.34.1.164","volume":"34","author":"D Ronen","year":"1986","unstructured":"Ronen D (1986) Short-term scheduling of vessels for ship bulk or semi-bulk commodities originating in a single area. Oper Res 34:164\u2013173","journal-title":"Oper Res"},{"key":"278_CR66","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0377-2217(93)90343-L","volume":"71","author":"D Ronen","year":"1993","unstructured":"Ronen D (1993) Ship scheduling: the last decade. Eur J Oper Res 71:325\u2013333","journal-title":"Eur J Oper Res"},{"key":"278_CR67","volume-title":"Management decision systems: computer-based support for decision making","author":"MS Scott Morton","year":"1971","unstructured":"Scott Morton MS (1971) Management decision systems: computer-based support for decision making. Harvard Division of Research, Cambridge"},{"key":"278_CR68","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M Solomon","year":"1987","unstructured":"Solomon M (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35:254\u2013265","journal-title":"Oper Res"},{"key":"278_CR69","first-page":"2","volume-title":"Proc. third international conference on genetic algorithms","author":"G Syswerda","year":"1989","unstructured":"Syswerda G (1989) Uniform crossover in genetic algorithms. In: Proc. third international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp\u00a02\u20139"},{"key":"278_CR70","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:1999101","volume":"33","author":"ED Tailard","year":"1996","unstructured":"Tailard ED (1996) A heuristic column generation method for the heterogeneous fleet VRP. RAIRO 33:1\u201334","journal-title":"RAIRO"},{"issue":"2","key":"278_CR71","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/nav.3800140210","volume":"14","author":"JC Whiton","year":"1967","unstructured":"Whiton JC (1967) Some constraints on shipping in linear programming models. Nav Res Logist Q 14(2):257\u2013260","journal-title":"Nav Res Logist Q"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-011-0278-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-011-0278-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-011-0278-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T10:55:23Z","timestamp":1637232923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-011-0278-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,3]]},"references-count":71,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["278"],"URL":"https:\/\/doi.org\/10.1007\/s10489-011-0278-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,3]]}}}