메뉴 건너뛰기




Volumn 72, Issue , 2016, Pages 12-30

An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines

Author keywords

Freight transportation; Heuristic algorithm; Pickup and delivery problem; Scheduled lines

Indexed keywords

HEURISTIC ALGORITHMS; OPTIMIZATION; PICKUPS; VEHICLE ROUTING;

EID: 84959422616     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2016.01.018     Document Type: Article
Times cited : (169)

References (32)
  • 1
    • 0038581771 scopus 로고    scopus 로고
    • Hybrid scheduling methods for paratransit operations
    • M. Aldaihani, and M. Dessouky Hybrid scheduling methods for paratransit operations Comput Ind Eng 45 1 2003 75 96
    • (2003) Comput Ind Eng , vol.45 , Issue.1 , pp. 75-96
    • Aldaihani, M.1    Dessouky, M.2
  • 2
    • 79957469290 scopus 로고    scopus 로고
    • An exact algorithm for the pickup and delivery problem with time windows
    • R. Baldacci, E. Bartolini, and A. Mingozzi An exact algorithm for the pickup and delivery problem with time windows Oper Res 59 2 2011 414 426
    • (2011) Oper Res , vol.59 , Issue.2 , pp. 414-426
    • Baldacci, R.1    Bartolini, E.2    Mingozzi, A.3
  • 4
    • 84902141038 scopus 로고    scopus 로고
    • Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots
    • K. Braekers, A. Caris, and G. Janssens Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots Transp Res Part B 67 2014 166 186
    • (2014) Transp Res Part B , vol.67 , pp. 166-186
    • Braekers, K.1    Caris, A.2    Janssens, G.3
  • 5
    • 84959406539 scopus 로고    scopus 로고
    • Cargo Tram. Official webpage. 2012 [accessed on 21.11.2015].
    • Cargo Tram. Official webpage. Available at: (www.eltis.org/index.php?id=13&study-id=1547); 2012 [accessed on 21.11.2015].
  • 6
    • 34250181291 scopus 로고    scopus 로고
    • The dial-a-ride problem: Models and algorithms
    • J.-F. Cordeau, and G. Laporte The dial-a-ride problem: Models and algorithms Ann Oper Res 153 1 2007 29 46
    • (2007) Ann Oper Res , vol.153 , Issue.1 , pp. 29-46
    • Cordeau, J.-F.1    Laporte, G.2
  • 7
    • 69749116580 scopus 로고    scopus 로고
    • The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method
    • E.-C. Cortes, M. Matamala, and C. Contardo The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method Eur J Oper Res 200 3 2010 711 724
    • (2010) Eur J Oper Res , vol.200 , Issue.3 , pp. 711-724
    • Cortes, E.-C.1    Matamala, M.2    Contardo, C.3
  • 8
    • 84864633176 scopus 로고    scopus 로고
    • An adaptive large neighborhood search heuristic for the pollution-routing problem
    • E. Demir, T. Bektaş, and G. Laporte An adaptive large neighborhood search heuristic for the pollution-routing problem Eur J Oper Res 223 2 2012 346 359
    • (2012) Eur J Oper Res , vol.223 , Issue.2 , pp. 346-359
    • Demir, E.1    Bektaş, T.2    Laporte, G.3
  • 9
    • 84899962422 scopus 로고    scopus 로고
    • A review of recent research on green road freight transportation
    • E. Demir, T. Bektaş, and G. Laporte A review of recent research on green road freight transportation Eur J Oper Res 237 3 2014 775 793
    • (2014) Eur J Oper Res , vol.237 , Issue.3 , pp. 775-793
    • Demir, E.1    Bektaş, T.2    Laporte, G.3
  • 10
    • 84884588729 scopus 로고    scopus 로고
    • The bi-objective pollution-routing problem
    • E. Demir, T. Bektaş, and G. Laporte The bi-objective pollution-routing problem Eur J Oper Res 232 3 2013 464 478
    • (2013) Eur J Oper Res , vol.232 , Issue.3 , pp. 464-478
    • Demir, E.1    Bektaş, T.2    Laporte, G.3
  • 11
    • 84925257046 scopus 로고    scopus 로고
    • A selected review on the negative externalities of the freight transportation: Modeling and pricing
    • E. Demir, Y. Huang, S. Scholts, and T. Van Woensel A selected review on the negative externalities of the freight transportation: Modeling and pricing Transp Res Part E: Logist Transp Rev 77 2015 95 114
    • (2015) Transp Res Part E: Logist Transp Rev , vol.77 , pp. 95-114
    • Demir, E.1    Huang, Y.2    Scholts, S.3    Van Woensel, T.4
  • 12
    • 84959406540 scopus 로고    scopus 로고
    • DHL-Packstation. DHL official webpage. 2013 [accessed on 21.11.2015].
    • DHL-Packstation. DHL official webpage. Available at: (www.dhl.de/en/paket/pakete-empfangen/packstation.html); 2013 [accessed on 21.11.2015].
  • 13
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • E.-W. Dijkstra A note on two problems in connexion with graphs Numer Math 1 1959 269 271
    • (1959) Numer Math , vol.1 , pp. 269-271
    • Dijkstra, E.-W.1
  • 16
    • 84959406542 scopus 로고    scopus 로고
    • Hurtigruten. Hurtigruten official webpage. 2013 [accessed on 11.11.2015].
    • Hurtigruten. Hurtigruten official webpage. Available at: (www.hurtigruten-web.com/index-en.html); 2013 [accessed on 11.11.2015].
  • 17
    • 84959406543 scopus 로고    scopus 로고
    • IBM ILOG. Copyright international business machines corporation 1987; 2013
    • IBM ILOG. Copyright international business machines corporation 1987; 2013.
  • 18
    • 84861587569 scopus 로고    scopus 로고
    • Cargo capacity management with allotments and spot market demand
    • Y. Levin, M. Nediak, and H. Topaloglu Cargo capacity management with allotments and spot market demand Oper Res 60 2 2012 351 365
    • (2012) Oper Res , vol.60 , Issue.2 , pp. 351-365
    • Levin, Y.1    Nediak, M.2    Topaloglu, H.3
  • 19
    • 14844347549 scopus 로고    scopus 로고
    • A metaheuristic for the pickup and delivery problem with time windows
    • H. Li, and A. Lim A metaheuristic for the pickup and delivery problem with time windows Int J Artif Intell Tools 12 2 2003 173 186
    • (2003) Int J Artif Intell Tools , vol.12 , Issue.2 , pp. 173-186
    • Li, H.1    Lim, A.2
  • 20
    • 0030242860 scopus 로고    scopus 로고
    • A decision support system for the bimodal dial-a-ride problem
    • C.-F. Liaw, C. White, and J. Bander A decision support system for the bimodal dial-a-ride problem IEEE Trans Syst Man Cybern Part A 26 5 1996 552 565
    • (1996) IEEE Trans Syst Man Cybern Part A , vol.26 , Issue.5 , pp. 552-565
    • Liaw, C.-F.1    White, C.2    Bander, J.3
  • 21
    • 84856344288 scopus 로고    scopus 로고
    • Challenges in urban freight transport planning-a review in the Baltic Sea Region
    • M. Lindholm, and S. Behrends Challenges in urban freight transport planning-a review in the Baltic Sea Region J Transp Geogr 22 2012 129 136
    • (2012) J Transp Geogr , vol.22 , pp. 129-136
    • Lindholm, M.1    Behrends, S.2
  • 22
    • 84882320559 scopus 로고    scopus 로고
    • An adaptive large neighborhood search for the pickup and delivery problem with transfers
    • R. Masson, F. Lehuede, and O. Peton An adaptive large neighborhood search for the pickup and delivery problem with transfers Transp Sci 47 2012 1 12
    • (2012) Transp Sci , vol.47 , pp. 1-12
    • Masson, R.1    Lehuede, F.2    Peton, O.3
  • 23
    • 84882523548 scopus 로고    scopus 로고
    • The dial-a-ride problem with transfers
    • R. Masson, F. Lehuede, and O. Peton The dial-a-ride problem with transfers Comput Oper Res 41 2014 12 23
    • (2014) Comput Oper Res , vol.41 , pp. 12-23
    • Masson, R.1    Lehuede, F.2    Peton, O.3
  • 25
    • 80054073361 scopus 로고    scopus 로고
    • The pickup and delivery problem with cross-docking opportunity
    • ICCL 2011, Hamburg, Germany, 19-22 September 2011, Lecture notes in computer science, vol. 6971. Springer, Berlin, Heidelberg
    • Petersen HL, Røpke S. The pickup and delivery problem with cross-docking opportunity. In: Computational Logistics: Second International Conference, ICCL 2011, Hamburg, Germany, 19-22 September 2011, Lecture notes in computer science, vol. 6971. Springer, Berlin, Heidelberg; 2011. p. 101-13.
    • (2011) Computational Logistics: Second International Conference , pp. 101-113
    • Petersen, R.1
  • 26
    • 33846068585 scopus 로고    scopus 로고
    • A general heuristic for vehicle routing problems
    • D. Pisinger, and S. Røpke A general heuristic for vehicle routing problems Comput Oper Res 34 8 2007 2403 2435
    • (2007) Comput Oper Res , vol.34 , Issue.8 , pp. 2403-2435
    • Pisinger, D.1    Røpke, S.2
  • 27
    • 70449631681 scopus 로고    scopus 로고
    • Branch and cut and price for the pickup and delivery problem with time windows
    • S. Røpke, and J.-F. Cordeau Branch and cut and price for the pickup and delivery problem with time windows Transp Sci 43 3 2009 267 286
    • (2009) Transp Sci , vol.43 , Issue.3 , pp. 267-286
    • Røpke, S.1    Cordeau, J.-F.2
  • 28
    • 33751011598 scopus 로고    scopus 로고
    • An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows
    • S. Røpke, and D. Pisinger An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transp Sci 40 4 2006 455 472
    • (2006) Transp Sci , vol.40 , Issue.4 , pp. 455-472
    • Røpke, S.1    Pisinger, D.2
  • 29
    • 0030241864 scopus 로고    scopus 로고
    • Multicriteria pickup and delivery problem with transfer opportunity
    • J. Shang, and C. Cuff Multicriteria pickup and delivery problem with transfer opportunity Comput Ind Eng 30 4 1996 631 645
    • (1996) Comput Ind Eng , vol.30 , Issue.4 , pp. 631-645
    • Shang, J.1    Cuff, C.2
  • 31


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