메뉴 건너뛰기




Volumn 22, Issue 5, 2011, Pages 789-799

An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set-partitioning model

Author keywords

Exact Algorithm; Flight ticket sales company; Free pickup and delivery service; Routing and scheduling; Set partitioning model

Indexed keywords

AIRLINE PASSENGERS; DELIVERY TIME; EXACT ALGORITHMS; FLIGHT TICKET SALES COMPANY; FREE PICKUP AND DELIVERY SERVICE; MIXED INTEGER PROGRAMMING MODEL; OPERATIONAL COSTS; OPTIMAL SOLUTIONS; PASSENGER SATISFACTION; PICK-UP AND DELIVERY SERVICE; PICKUP AND DELIVERY; RANDOM INSTANCE; ROUTING AND SCHEDULING; SECOND PHASE; SERVICE QUALITY; START-UP COSTS; TIME DEVIATION; VEHICLE CAPACITY; VEHICLE ROUTING AND SCHEDULING; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

EID: 80053471714     PISSN: 09565515     EISSN: 15728145     Source Type: Journal    
DOI: 10.1007/s10845-009-0311-9     Document Type: Conference Paper
Times cited : (32)

References (31)
  • 1
    • 45149121178 scopus 로고    scopus 로고
    • An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
    • 10.1007/s10107-007-0178-5
    • R. Baldacci N. Christofides A. Mingozzi 2008 An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts Mathematical Programming 115 2 351 385 10.1007/s10107-007-0178-5
    • (2008) Mathematical Programming , vol.115 , Issue.2 , pp. 351-385
    • Baldacci, R.1    Christofides, N.2    Mingozzi, A.3
  • 2
    • 0000495533 scopus 로고
    • On an integer program for a delivery problem
    • 10.1287/opre.12.2.300
    • M. Balinski R. Quandt 1964 On an integer program for a delivery problem Operations Research 12 2 300 304 10.1287/opre.12.2.300
    • (1964) Operations Research , vol.12 , Issue.2 , pp. 300-304
    • Balinski, M.1    Quandt, R.2
  • 3
    • 0036567019 scopus 로고    scopus 로고
    • A branch-and-cut procedure for the vehicle routing problem with time windows
    • DOI 10.1287/trsc.36.2.250.565
    • J. F. Bard G. Kontoravdis G. Yu 2002 A branch-and-cut procedure for the vehicle routing problem with time windows Transportation Science 36 2 250 269 10.1287/trsc.36.2.250.565 (Pubitemid 34554780)
    • (2002) Transportation Science , vol.36 , Issue.2 , pp. 250-269
    • Bard, J.F.1    Kontoravdis, G.2    Yu, G.3
  • 4
    • 0030135117 scopus 로고    scopus 로고
    • Probabilistic analyses and practical algorithms for the Vehicle Routing Problem with Time Windows
    • J. Bramel D. Simchi-Levi 1996 Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows Operations Research 44 3 501 509 10.1287/opre.44.3.501 (Pubitemid 126669515)
    • (1996) Operations Research , vol.44 , Issue.3 , pp. 501-509
    • Bramel, J.1    Simchi-Levi, D.2
  • 5
    • 14844363491 scopus 로고    scopus 로고
    • Evolutionary algorithms for the Vehicle Routing Problem with Time Windows
    • DOI 10.1007/s10732-005-5431-6
    • O. Bräysy W. Dullaert M. Gendreau 2004 Evolutionary algorithms for the vehicle routing problem with time windows Journal of Heuristics 10 6 587 611 10.1007/s10732-005-5431-6 (Pubitemid 40356745)
    • (2004) Journal of Heuristics , vol.10 , Issue.6 , pp. 587-611
    • Braysy, O.1    Dullaert, W.2    Gendreau, M.3
  • 6
    • 16244364524 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, Part I: Route construction and local search algorithms
    • DOI 10.1287/trsc.1030.0056
    • O. Bräysy M. Gendreau 2005 Vehicle routing problem with time windows, part I: route construction and local search algorithms Transportation Science 39 1 104 118 10.1287/trsc.1030.0056 (Pubitemid 40466664)
    • (2005) Transportation Science , vol.39 , Issue.1 , pp. 104-118
    • Braysy, O.1    Gendreau, M.2
  • 7
    • 16244404291 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, Part II: Metaheuristics
    • DOI 10.1287/trsc.1030.0057
    • O. Bräysy M. Gendreau 2005 Vehicle routing problem with time windows, part II: metaheuristics Transportation Science 39 1 119 139 10.1287/trsc.1030.0057 (Pubitemid 40453880)
    • (2005) Transportation Science , vol.39 , Issue.1 , pp. 119-139
    • Braysy, O.1    Gendreau, M.2
  • 8
    • 21344463824 scopus 로고    scopus 로고
    • Simulated annealing metaheuristics for the vehicle routing problem with time windows
    • W. C. Chiang R. A. Russell 1996 Simulated annealing metaheuristics for the vehicle routing problem with time windows Annals of Operations Research 63 1 3 27 10.1007/BF02601637 (Pubitemid 126729233)
    • (1996) Annals of Operations Research , vol.63 , pp. 3-27
    • Chiang, W.-C.1    Russell, R.A.2
  • 9
    • 0001177651 scopus 로고    scopus 로고
    • A reactive tabu search metaheuristic for the vehicle routing problem with time windows
    • W. C. Chiang R. A. Russell 1997 A reactive tabu search metaheuristic for the vehicle routing problem with time windows INFORMS Journal on Computing 9 4 417 430 10.1287/ijoc.9.4.417 (Pubitemid 127697785)
    • (1997) INFORMS Journal on Computing , vol.9 , Issue.4 , pp. 417-430
    • Chiang, W.-C.1    Russell, R.A.2
  • 10
    • 34250247769 scopus 로고
    • Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
    • N. Christofides A. Mingozzi P. Toth 1981 Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations Mathematical Programming 20 1 255 282 10.1007/BF01589353 (Pubitemid 12508234)
    • (1981) Mathematical Programming , vol.20 , Issue.3 , pp. 255-282
    • Christofides, N.1    Ningozzi, A.2    Toth, P.3
  • 11
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • 10.1287/opre.12.4.568
    • G. Clarke J. W. Wright 1964 Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 4 568 581 10.1287/opre.12.4.568
    • (1964) Operations Research , vol.12 , Issue.4 , pp. 568-581
    • Clarke, G.1    Wright, J.W.2
  • 12
    • 0035424778 scopus 로고    scopus 로고
    • A unified tabu search heuristic for vehicle routing problems with time windows
    • DOI 10.1057/palgrave/jors/2601163
    • J.-F. Cordeau G. Laporte A. Mercier 2001 A unified tabu search heuristic for vehicle routing problems with time windows Journal of Operations Research Society 52 8 928 936 10.1057/palgrave.jors.2601163 (Pubitemid 32720268)
    • (2001) Journal of the Operational Research Society , vol.52 , Issue.8 , pp. 928-936
    • Cordeau, J.-F.1    Laporte, G.2    Mercier, A.3
  • 13
    • 0035277342 scopus 로고    scopus 로고
    • A heuristic for the vehicle routing problem with time windows
    • DOI 10.1023/A:1011301019184
    • R. Cordone R. Wolfler-Calvo 2001 A heuristic for the vehicle routing problem with time windows Journal of Heuristics 7 2 107 129 10.1023/A: 1011301019184 (Pubitemid 32366275)
    • (2001) Journal of Heuristics , vol.7 , Issue.2 , pp. 107-129
    • Cordone, R.1    Calvo, R.W.2
  • 14
    • 85042163696 scopus 로고
    • A new optimization algorithm for the vehicle routing problem with time windows
    • 10.1287/opre.40.2.342
    • M. Desrochers J. Desrosiers M. Solomon 1992 A new optimization algorithm for the vehicle routing problem with time windows Operations Research 40 2 342 354 10.1287/opre.40.2.342
    • (1992) Operations Research , vol.40 , Issue.2 , pp. 342-354
    • Desrochers, M.1    Desrosiers, J.2    Solomon, M.3
  • 15
    • 0031141558 scopus 로고    scopus 로고
    • Vehicle routing with time windows: Two optimization algorithms
    • M. L. Fisher K. O. Jörnsten O. B. G. Madsen 1997 Vehicle routing with time windows: two optimization algorithms Operations Research 45 3 488 492 10.1287/opre.45.3.488 (Pubitemid 127684724)
    • (1997) Operations Research , vol.45 , Issue.3 , pp. 488-492
    • Fisher, M.L.1    Jornsten, K.O.2    Madsen, O.B.G.3
  • 16
    • 33644515988 scopus 로고    scopus 로고
    • Robust branch-and-cut-and-price for the capacitated vehicle routing problem
    • 10.1007/s10107-005-0644-x
    • R. Fukasawa J. Lysgaard M. P. Aragão M. Reis E. Uchoa R. F. Werneck 2006 Robust branch-and-cut-and-price for the capacitated vehicle routing problem Mathematical Programming 106 3 491 511 10.1007/s10107-005-0644-x
    • (2006) Mathematical Programming , vol.106 , Issue.3 , pp. 491-511
    • Fukasawa, R.1    Lysgaard, J.2    Aragão, M.P.3    Reis, M.4    Uchoa, E.5    Werneck, R.F.6
  • 17
    • 0028533002 scopus 로고
    • A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
    • 10.1016/0305-0548(94)90073-6
    • B.-L. Garcia J.-Y. Potvin J.-M. Rousseau 1994 A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints Computers & Operations Research 21 9 1025 1033 10.1016/0305-0548(94)90073-6
    • (1994) Computers & Operations Research , vol.21 , Issue.9 , pp. 1025-1033
    • Garcia, B.-L.1    Potvin, J.-Y.2    Rousseau, J.-M.3
  • 18
    • 36348987653 scopus 로고    scopus 로고
    • Formulations and exact algorithms for the vehicle routing problem with time windows
    • DOI 10.1016/j.cor.2006.11.006, PII S0305054806002929, Selected Papers Presented at the ECCO'04 European Conference on Combinatorial Optimization
    • B. Kallehauge 2008 Formulations and exact algorithms for the vehicle routing problem with time windows Computers & Operations Research 35 7 2307 2330 10.1016/j.cor.2006.11.006 (Pubitemid 350161140)
    • (2008) Computers and Operations Research , vol.35 , Issue.7 , pp. 2307-2330
    • Kallehauge, B.1
  • 20
    • 0026857186 scopus 로고
    • An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints
    • 10.1287/trsc.26.2.69
    • Y. A. Koskosidis W. B. Powell M. M. Solomon 1992 An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints Transportation Science 26 2 69 85 10.1287/trsc.26.2.69
    • (1992) Transportation Science , vol.26 , Issue.2 , pp. 69-85
    • Koskosidis, Y.A.1    Powell, W.B.2    Solomon, M.M.3
  • 21
    • 0035482443 scopus 로고    scopus 로고
    • A tabu search heuristic for the single vehicle pickup and delivery problem with time windows
    • DOI 10.1023/A:1012204504849
    • A. Landrieu Y. Mati Z. Binder 2001 A tabu search heuristic for the single vehicle pickup and delivery problem with time windows Journal of Intelligent Manufacturing 12 5 497 508 10.1023/A:1012204504849 (Pubitemid 33074842)
    • (2001) Journal of Intelligent Manufacturing , vol.12 , Issue.5-6 , pp. 497-508
    • Landrieu, A.1    Mati, Y.2    Binder, Z.3
  • 22
    • 0037411888 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows and a limited number of vehicles
    • 10.1016/S0377-2217(02)00363-6
    • H. C. Lau M. Sim M. Teo K. 2003 Vehicle routing problem with time windows and a limited number of vehicles European Journal of Operational Research 148 3 559 568 10.1016/S0377-2217(02)00363-6
    • (2003) European Journal of Operational Research , vol.148 , Issue.3 , pp. 559-568
    • Lau, H.C.1    Sim, M.2    Teo, K.M.3
  • 23
    • 0037904410 scopus 로고    scopus 로고
    • Local search with annealing-like restarts to solve the VRPTW
    • 10.1016/S0377-2217(02)00486-1
    • H. Li A. Lim J. Huang 2003 Local search with annealing-like restarts to solve the VRPTW European Journal of Operational Research 150 1 115 127 10.1016/S0377-2217(02)00486-1
    • (2003) European Journal of Operational Research , vol.150 , Issue.1 , pp. 115-127
    • Li, H.1    Lim, A.2    Huang, J.3
  • 24
    • 58549116508 scopus 로고    scopus 로고
    • A heuristic method for the vehicle routing problem with backhauls and inventory
    • 10.1007/s10845-008-0101-9
    • S. C. Liu C. H. Chung 2009 A heuristic method for the vehicle routing problem with backhauls and inventory Journal of Intelligent Manufacturing 20 1 29 42 10.1007/s10845-008-0101-9
    • (2009) Journal of Intelligent Manufacturing , vol.20 , Issue.1 , pp. 29-42
    • Liu, S.C.1    Chung, C.H.2
  • 25
    • 0027591102 scopus 로고
    • A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
    • 10.1016/0377-2217(93)90221-8
    • J.-Y. Potvin J.-M. Rousseau 1993 A parallel route building algorithm for the vehicle routing and scheduling problem with time windows European Journal of Operational Research 66 3 331 340 10.1016/0377-2217(93)90221-8
    • (1993) European Journal of Operational Research , vol.66 , Issue.3 , pp. 331-340
    • Potvin, J.-Y.1    Rousseau, J.-M.2
  • 27
    • 0002600091 scopus 로고
    • The general pickup and delivery problem
    • 10.1287/trsc.29.1.17
    • M. W. P. Savelsbergh M. Sol 1995 The general pickup and delivery problem Transportation Science 29 1 17 29 10.1287/trsc.29.1.17
    • (1995) Transportation Science , vol.29 , Issue.1 , pp. 17-29
    • Savelsbergh, M.W.P.1    Sol, M.2
  • 28
    • 0022731384 scopus 로고
    • On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
    • 10.1002/net.3230160205
    • M. M. Solomon 1986 On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints Networks 16 2 161 174 10.1002/net.3230160205
    • (1986) Networks , vol.16 , Issue.2 , pp. 161-174
    • Solomon, M.M.1
  • 29
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problems with time window constraints
    • 10.1287/opre.35.2.254
    • M. M. Solomon 1987 Algorithms for the vehicle routing and scheduling problems with time window constraints Operations Research 35 2 254 265 10.1287/opre.35.2.254
    • (1987) Operations Research , vol.35 , Issue.2 , pp. 254-265
    • Solomon, M.M.1
  • 30
    • 0031139685 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with soft time windows
    • E. Taillard P. Badeau M. Gendreau F. Guertin J.-Y. Potvin 1997 A tabu search heuristic for the vehicle routing problem with soft time windows Transportation Science 31 2 170 186 10.1287/trsc.31.2.170 (Pubitemid 127597092)
    • (1997) Transportation Science , vol.31 , Issue.2 , pp. 170-186
    • Taillard, E.1    Badeau, P.2    Gendreau, M.3    Guertin, F.4    Potvin, J.-Y.5


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