메뉴 건너뛰기




Volumn 45, Issue , 2015, Pages 350-360

A hybrid GRASP-VNS for ship routing and scheduling problem with discretized time windows

Author keywords

GRASP; Ship routing and scheduling problem; Tramp shipping; Variable Neighborhood Search

Indexed keywords

DECISION MAKING; HEURISTIC ALGORITHMS; OPTIMIZATION; SCHEDULING;

EID: 84941066003     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2015.07.013     Document Type: Article
Times cited : (30)

References (41)
  • 1
    • 0002938084 scopus 로고
    • A column generation algorithm for a ship scheduling problem
    • L.H. Appelgren A column generation algorithm for a ship scheduling problem Transp. Sci. 3 1969 53 68
    • (1969) Transp. Sci. , vol.3 , pp. 53-68
    • Appelgren, L.H.1
  • 2
    • 0002914365 scopus 로고
    • Integer programming methods for a vessel scheduling problem
    • L.H. Appelgren Integer programming methods for a vessel scheduling problem Transp. Sci. 5 1971 64 78
    • (1971) Transp. Sci. , vol.5 , pp. 64-78
    • Appelgren, L.H.1
  • 3
    • 0000291299 scopus 로고    scopus 로고
    • Container ship stowage problem: Complexity and connection to the coloring of circle graphs
    • M. Avriel, M. Penn, and N. Shpirer Container ship stowage problem: complexity and connection to the coloring of circle graphs Discrete Appl. Math. 103 2000 271 279
    • (2000) Discrete Appl. Math. , vol.103 , pp. 271-279
    • Avriel, M.1    Penn, M.2    Shpirer, N.3
  • 4
    • 70350568773 scopus 로고    scopus 로고
    • A survey of berth allocation and quay crane scheduling problems in container terminals
    • C. Bierwirth, and F. Meisel A survey of berth allocation and quay crane scheduling problems in container terminals Eur. J. Oper. Res. 202 2010 615 627
    • (2010) Eur. J. Oper. Res. , vol.202 , pp. 615-627
    • Bierwirth, C.1    Meisel, F.2
  • 5
    • 33748327997 scopus 로고    scopus 로고
    • A multi-start local search heuristic for ship scheduling - A computational study
    • G. Brønmo, M. Christiansen, K. Fagerholt, and B. Nygreen A multi-start local search heuristic for ship scheduling - a computational study Comput. Oper. Res. 34 2007 900 917
    • (2007) Comput. Oper. Res. , vol.34 , pp. 900-917
    • Brønmo, G.1    Christiansen, M.2    Fagerholt, K.3    Nygreen, B.4
  • 7
    • 84899910105 scopus 로고    scopus 로고
    • A heuristic procedure for a ship routing and scheduling problem with variable speed and discretized time windows
    • K. Castillo-Villar, R. Gonz'alez-Ramírez, P. Miranda González, and N. Smith A heuristic procedure for a ship routing and scheduling problem with variable speed and discretized time windows Math. Probl. Eng. 2014 2014 24 36
    • (2014) Math. Probl. Eng. , vol.2014 , pp. 24-36
    • Castillo-Villar, K.1    Gonz'Alez-Ramírez, R.2    Miranda González, P.3    Smith, N.4
  • 9
    • 1642304524 scopus 로고    scopus 로고
    • Ship routing and scheduling: Status and perspectives
    • M. Christiansen, K. Fagerholt, and D. Ronen Ship routing and scheduling: status and perspectives Transp. Sci. 38 2004 1 18
    • (2004) Transp. Sci. , vol.38 , pp. 1-18
    • Christiansen, M.1    Fagerholt, K.2    Ronen, D.3
  • 11
    • 0000049494 scopus 로고
    • Greedy randomized adaptive search procedures
    • T. Feo, and M. Resende Greedy randomized adaptive search procedures J. Glob. Optim. 6 1995 109 133 10.1007/BF01096763
    • (1995) J. Glob. Optim. , vol.6 , pp. 109-133
    • Feo, T.1    Resende, M.2
  • 12
    • 0024640804 scopus 로고
    • A probabilistic heuristic for a computationally difficult set covering problem
    • T.A. Feo, and M.G. Resende A probabilistic heuristic for a computationally difficult set covering problem Oper. Res. Lett. 8 1989 67 71
    • (1989) Oper. Res. Lett. , vol.8 , pp. 67-71
    • Feo, T.A.1    Resende, M.G.2
  • 13
    • 1642382397 scopus 로고    scopus 로고
    • Ship scheduling of fertilizer products
    • M. Fox, and D. Herden Ship scheduling of fertilizer products OR Insight 12 1999 21 28
    • (1999) OR Insight , vol.12 , pp. 21-28
    • Fox, M.1    Herden, D.2
  • 14
    • 84944811700 scopus 로고
    • The use of ranks to avoid the assumption of normality implicit in the analysis of variance
    • M. Friedman The use of ranks to avoid the assumption of normality implicit in the analysis of variance J. Am. Stat. Assoc. 32 1937 675 701
    • (1937) J. Am. Stat. Assoc. , vol.32 , pp. 675-701
    • Friedman, M.1
  • 15
    • 80053922870 scopus 로고    scopus 로고
    • Special issue on Latin-American research: A time based discretization approach for ship routing and scheduling with variable speed
    • R. Gatica, and P. Miranda Special issue on Latin-American research: a time based discretization approach for ship routing and scheduling with variable speed Netw. Spat. Econ. 11 2011 465 485
    • (2011) Netw. Spat. Econ. , vol.11 , pp. 465-485
    • Gatica, R.1    Miranda, P.2
  • 16
    • 79958821619 scopus 로고    scopus 로고
    • Variable neighborhood search
    • Springer, US
    • Hansen, P., Mladenovic, N., Brimberg, J., Moreno Pérez, J., 2010. Variable neighborhood search. In: Handbook of Metaheuristics. Springer, US, pp. 61-86.
    • (2010) Handbook of Metaheuristics , pp. 61-86
    • Hansen, P.1
  • 17
    • 44649105042 scopus 로고    scopus 로고
    • Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks
    • H. Hoeller, B. Melian, and S. Voss Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks Eur. J. Oper. Res. 191 2008 691 704
    • (2008) Eur. J. Oper. Res. , vol.191 , pp. 691-704
    • Hoeller, H.1    Melian, B.2    Voss, S.3
  • 18
    • 0037448282 scopus 로고    scopus 로고
    • Vehicle dispatching with time-dependent travel times
    • S. Ichoua, M. Gendreau, and J.Y. Potvin Vehicle dispatching with time-dependent travel times Eur. J. Oper. Res. 144 2003 379 396
    • (2003) Eur. J. Oper. Res. , vol.144 , pp. 379-396
    • Ichoua, S.1    Gendreau, M.2    Potvin, J.Y.3
  • 19
    • 80053475845 scopus 로고    scopus 로고
    • Classification of ship routing and scheduling problems in liner shipping
    • K. Kjeldsen Classification of ship routing and scheduling problems in liner shipping Inf. Syst. Oper. Res. 49 2011 139 152
    • (2011) Inf. Syst. Oper. Res. , vol.49 , pp. 139-152
    • Kjeldsen, K.1
  • 20
    • 77949442313 scopus 로고    scopus 로고
    • A tabu search heuristic for ship routing and scheduling
    • J. Korsvik, K. Fagerholt, and G. Laporte A tabu search heuristic for ship routing and scheduling J. Oper. Res. Soc. 61 2010 594 603
    • (2010) J. Oper. Res. Soc. , vol.61 , pp. 594-603
    • Korsvik, J.1    Fagerholt, K.2    Laporte, G.3
  • 21
    • 79960158717 scopus 로고    scopus 로고
    • Simulated annealing for optimal ship routing
    • O. Kosmas, and D. Vlachos Simulated annealing for optimal ship routing Comput. Oper. Res. 39 2012 576 581
    • (2012) Comput. Oper. Res. , vol.39 , pp. 576-581
    • Kosmas, O.1    Vlachos, D.2
  • 22
    • 79952040578 scopus 로고    scopus 로고
    • Combined ship allocation, routing and freight assignment in tramp shipping
    • D.Y. Lin, and H.Y. Liu Combined ship allocation, routing and freight assignment in tramp shipping Transp. Res. Part E: Logist. Transp. Rev. 47 2011 414 431
    • (2011) Transp. Res. Part E: Logist. Transp. Rev. , vol.47 , pp. 414-431
    • Lin, D.Y.1    Liu, H.Y.2
  • 25
    • 84894043503 scopus 로고    scopus 로고
    • Containership routing and scheduling in liner shipping: Overview and future research directions
    • Q. Meng, S. Wang, H. Andersson, and K. Thun Containership routing and scheduling in liner shipping: overview and future research directions Transp. Sci. 48 2014 265 280
    • (2014) Transp. Sci. , vol.48 , pp. 265-280
    • Meng, Q.1    Wang, S.2    Andersson, H.3    Thun, K.4
  • 27
    • 51649111723 scopus 로고    scopus 로고
    • Introduction to the special issue on variable neighborhood search
    • J.M. Moreno-Vega, and B. Melian Introduction to the special issue on variable neighborhood search J. Heuristics 14 2008 403 404
    • (2008) J. Heuristics , vol.14 , pp. 403-404
    • Moreno-Vega, J.M.1    Melian, B.2
  • 30
    • 0029492327 scopus 로고
    • An Exchange Heuristic for Routeing Problems with Time Windows
    • J. Potvin, and J. Rousseau An Exchange Heuristic for Routeing Problems with Time Windows J. Oper. Res. Soc. 46 1995 1433 1446
    • (1995) J. Oper. Res. Soc. , vol.46 , pp. 1433-1446
    • Potvin, J.1    Rousseau, J.2
  • 32
    • 0012587086 scopus 로고    scopus 로고
    • Greedy randomized adaptive search procedures
    • F. Glover, G. Kochenberger, Kluwer Academic Publishers US
    • M. Resende, and C. Ribeiro Greedy randomized adaptive search procedures F. Glover, G. Kochenberger, Handbook of Metaheuristics 2003 Kluwer Academic Publishers US 219 249
    • (2003) Handbook of Metaheuristics , pp. 219-249
    • Resende, M.1    Ribeiro, C.2
  • 34
    • 0020707231 scopus 로고
    • Cargo ships routing and scheduling: Survey of models and problems
    • D. Ronen Cargo ships routing and scheduling: survey of models and problems Eur. J. Oper. Res. 12 1983 119 126
    • (1983) Eur. J. Oper. Res. , vol.12 , pp. 119-126
    • Ronen, D.1
  • 35
    • 0027870674 scopus 로고
    • Ship scheduling: The last decade
    • D. Ronen Ship scheduling: the last decade Eur. J. Oper. Res. 71 1993 325 333
    • (1993) Eur. J. Oper. Res. , vol.71 , pp. 325-333
    • Ronen, D.1
  • 36
    • 85047700005 scopus 로고    scopus 로고
    • Marine inventory routing: Shipments planning
    • D. Ronen Marine inventory routing: shipments planning J. Oper. Res. Soc. 53 2002 108 111
    • (2002) J. Oper. Res. Soc. , vol.53 , pp. 108-111
    • Ronen, D.1
  • 37
    • 0032623585 scopus 로고    scopus 로고
    • Fleet management models and algorithms for an oil-tanker routing and scheduling problem
    • H. Sherali, S. Al-Yakoob, and M. Hassan Fleet management models and algorithms for an oil-tanker routing and scheduling problem IIE Trans. 31 1999 395 406
    • (1999) IIE Trans. , vol.31 , pp. 395-406
    • Sherali, H.1    Al-Yakoob, S.2    Hassan, M.3
  • 38
    • 0031139685 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with soft time windows
    • É. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.Y. Potvin A tabu search heuristic for the vehicle routing problem with soft time windows Transp. Sci. 31 1997 170 186
    • (1997) Transp. Sci. , vol.31 , pp. 170-186
    • Taillard, É.1    Badeau, P.2    Gendreau, M.3    Guertin, F.4    Potvin, J.Y.5
  • 39
    • 84930081413 scopus 로고    scopus 로고
    • Literature survey of network optimization in container liner shipping
    • N. Tran, and H.D. Haasis Literature survey of network optimization in container liner shipping Flex. Serv. Manuf. J. 2013 1 41
    • (2013) Flex. Serv. Manuf. J. , pp. 1-41
    • Tran, N.1    Haasis, H.D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.