메뉴 건너뛰기




Volumn 53, Issue 2, 2012, Pages 282-293

On the impact of real-time information on field service scheduling

Author keywords

Heuristics; Real time; Routing

Indexed keywords

DYNAMIC SCHEDULING; FIELD SERVICES; HEURISTICS; MOBILE PHONE BASE STATIONS; MOBILE PHONE OPERATORS; OFF-LINE PLANNING; OFFLINE; POSITION INFORMATION; REAL-TIME; REAL-TIME INFORMATION; ROUTING; SCHEDULING PROBLEM;

EID: 84861092814     PISSN: 01679236     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dss.2012.01.013     Document Type: Article
Times cited : (26)

References (42)
  • 1
    • 67349235349 scopus 로고    scopus 로고
    • A unified exact method for solving different classes of vehicle routing problems
    • R. Baldacci, and A. Mingozzi A unified exact method for solving different classes of vehicle routing problems Mathematical Programming 120 2009 347 380
    • (2009) Mathematical Programming , vol.120 , pp. 347-380
    • Baldacci, R.1    Mingozzi, A.2
  • 2
    • 0003040355 scopus 로고
    • A stochastic and dynamic vehicle routing problem in the Euclidean plane
    • D. Bertsimas, and G. Van Ryzin A stochastic and dynamic vehicle routing problem in the Euclidean plane Operations Research 39 1991 601 615
    • (1991) Operations Research , vol.39 , pp. 601-615
    • Bertsimas, D.1    Van Ryzin, G.2
  • 4
    • 0041194626 scopus 로고    scopus 로고
    • A tabu search heuristic for periodic and multi-depot vehicle routing problems
    • J.-F. Cordeau, M. Gendreau, and G. Laporte A tabu search heuristic for periodic and multi-depot vehicle routing problems Networks 30 1997 105 119 (Pubitemid 127360996)
    • (1997) Networks , vol.30 , Issue.2 , pp. 105-119
    • Cordeau, J.-F.1    Gendreau, M.2    Laporte, G.3
  • 5
    • 2442505839 scopus 로고    scopus 로고
    • An improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
    • J.F. Cordeau, G. Laporte, and A. Mercier An improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows Journal of the Operational Research Society 55 2004 542 546
    • (2004) Journal of the Operational Research Society , vol.55 , pp. 542-546
    • Cordeau, J.F.1    Laporte, G.2    Mercier, A.3
  • 10
    • 0019574134 scopus 로고
    • Generalized assignment heuristic for vehicle routing
    • M. Fisher, and M. Jaikumar A generalized assignment heuristic for vehicle routing Networks 11 1981 109 124 (Pubitemid 13506979)
    • (1981) Networks , vol.11 , Issue.2 , pp. 109-124
    • Fisher Marshall, L.1    Jaikumar Ramchandran2
  • 11
    • 81255142196 scopus 로고    scopus 로고
    • Dynamic and stochastic vehicle routing in practice
    • Operations Research/Computer Science Interfaces Springer
    • T. Flatberg, G. Hasle, O. Kloster, E.J. Nilssen, and A. Riise Dynamic and stochastic vehicle routing in practice Dynamic Fleet Management Operations Research/Computer Science Interfaces 2007 Springer 45 68
    • (2007) Dynamic Fleet Management , pp. 45-68
    • Flatberg, T.1    Hasle, G.2    Kloster, O.3    Nilssen, E.J.4    Riise, A.5
  • 12
    • 0042591567 scopus 로고    scopus 로고
    • Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies
    • G. Ghiani, and F. Guerriero Real-time vehicle routing: solution concepts, algorithms and parallel computing strategies European Journal of Operational Research 15 2003 1 11
    • (2003) European Journal of Operational Research , vol.15 , pp. 1-11
    • Ghiani, G.1    Guerriero, F.2
  • 15
    • 0034818087 scopus 로고    scopus 로고
    • Variable neighborhood search: Principles and applications
    • DOI 10.1016/S0377-2217(00)00100-4
    • P. Hansen, and N. Mladenovic Variable neighborhood search: principles and applications Journal of Operational Research 130 2001 449 467 (Pubitemid 32875304)
    • (2001) European Journal of Operational Research , vol.130 , Issue.3 , pp. 449-467
    • Hansen, P.1    Mladenovic, N.2
  • 16
    • 34250695892 scopus 로고    scopus 로고
    • Dynamic vehicle routing using genetic algorithms
    • DOI 10.1007/s10489-006-0033-z
    • F.T. Hanshar, and B.M. Mobuki-Berman Dynamic vehicle routing using genetic algorithms Applied Intelligence 27 2007 89 99 (Pubitemid 46960846)
    • (2007) Applied Intelligence , vol.27 , Issue.1 , pp. 89-99
    • Hanshar, F.T.1    Ombuki-Berman, B.M.2
  • 17
    • 84861093124 scopus 로고    scopus 로고
    • HEC Montreal
    • HEC Montreal www.hec.ca/chairedistributique/data 2010
    • (2010)
  • 18
    • 77952651437 scopus 로고    scopus 로고
    • Scheduling and staffing multiple projects with a multi-skilled workforce
    • C. Heimerl, and R. Kolisch Scheduling and staffing multiple projects with a multi-skilled workforce OR Spectrum 2009 1 26
    • (2009) OR Spectrum , pp. 1-26
    • Heimerl, C.1    Kolisch, R.2
  • 21
    • 0002719797 scopus 로고
    • The Hungarian method for the assignment problem
    • H.W. Kuhn The Hungarian method for the assignment problem Naval Research Logistic Quarterly vol. 2 1955 83 97
    • (1955) Naval Research Logistic Quarterly , vol.2 , pp. 83-97
    • Kuhn, H.W.1
  • 22
    • 0022046248 scopus 로고
    • Integer programming formulations of vehicle routing problems
    • DOI 10.1016/0377-2217(85)90284-X
    • R.V. Kulkarni, and P.R. Bhave Integer programming formulations of vehicle routing problems European Journal of Operational Research 20 1985 58 67 (Pubitemid 15480455)
    • (1985) European Journal of Operational Research , vol.20 , Issue.1 , pp. 58-67
    • Kulkarni, R.V.1    Bhave, P.R.2
  • 23
    • 0039187828 scopus 로고
    • Optimal solutions to capacitated multidepot vehicle routing problems
    • G. Laporte, Y. Nobert, and D. Arpin Optimal solutions to capacitated multidepot vehicle routing problems Congressus Numerantium 44 1984 283 292
    • (1984) Congressus Numerantium , vol.44 , pp. 283-292
    • Laporte, G.1    Nobert, Y.2    Arpin, D.3
  • 24
    • 0024067262 scopus 로고
    • Solving a family of multi-depot vehicle routing and location-routing problems
    • G. Laporte, Y. Nobert, and S. Taillefer Solving a family of multi-depot vehicle routing and allocation problems Transportation Science 22 1988 161 172 (Pubitemid 18654114)
    • (1988) Transportation Science , vol.22 , Issue.3 , pp. 161-172
    • Laporte Gilbert1    Nobert Yves2    Taillefer Serge3
  • 25
    • 0036602501 scopus 로고    scopus 로고
    • Partially dynamic vehicle routing - Models and algorithms
    • DOI 10.1057/palgrave.jors.2601352
    • A. Larsen, O. Madsen, and M. Solomon Partially dynamic vehicle routing - models and algorithms Journal of the Operational Research Society 38 2002 637 646 (Pubitemid 34658252)
    • (2002) Journal of the Operational Research Society , vol.53 , Issue.6 , pp. 637-646
    • Larsen, A.1    Madsen, O.2    Solomon, M.3
  • 26
    • 0040214791 scopus 로고    scopus 로고
    • Dynamic workforce scheduling for British Telecommunications plc
    • D. Lesaint, C. Voudouris, and N. Azarmi Dynamic workforce scheduling for British Telecommunications plc Interfaces 30 2000 45 56
    • (2000) Interfaces , vol.30 , pp. 45-56
    • Lesaint, D.1    Voudouris, C.2    Azarmi, N.3
  • 31
    • 2942585122 scopus 로고    scopus 로고
    • Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows
    • DOI 10.1016/j.trb.2003.09.001, PII S019126150300095X
    • S. Mitrovic-Minic, R. Krishnamurti, and G. Laporte The double-horizon heuristic for the dynamic pickup and delivery problem with time windows Transportation Science 38 2004 669 685 (Pubitemid 38763499)
    • (2004) Transportation Research Part B: Methodological , vol.38 , Issue.8 , pp. 669-685
    • Mitrovic-Minic, S.1    Krishnamurti, R.2    Laporte, G.3
  • 32
    • 33846068585 scopus 로고    scopus 로고
    • A general heuristic for vehicle routing problems
    • DOI 10.1016/j.cor.2005.09.012, PII S0305054805003023
    • D. Pisinger, and S. Ropke A general heuristic for vehicle routing problems Computers and Operations Research 34 2007 2403 2435 (Pubitemid 46073431)
    • (2007) Computers and Operations Research , vol.34 , Issue.8 , pp. 2403-2435
    • Pisinger, D.1    Ropke, S.2
  • 33
    • 14844361815 scopus 로고    scopus 로고
    • A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows
    • DOI 10.1007/s10732-005-5432-5
    • M. Polacek, R.F. Hartl, and K. Doerner A variable neighborhood search for the multi depot vehicle routing problem with time windows Journal of Heuristics 10 2004 613 627 (Pubitemid 40356746)
    • (2004) Journal of Heuristics , vol.10 , Issue.6 , pp. 613-627
    • Polacek, M.1    Hartl, R.F.2    Doerner, K.3    Reimann, M.4
  • 34
    • 85038011666 scopus 로고    scopus 로고
    • A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows
    • M. Polacek, S. Benkner, K. Doerner, and R.F. Hartl A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows Business Research 1 2008 207 218
    • (2008) Business Research , vol.1 , pp. 207-218
    • Polacek, M.1    Benkner, S.2    Doerner, K.3    Hartl, R.F.4
  • 35
    • 0027591102 scopus 로고
    • A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
    • J.Y. Potvin, and J.M. Rousseau A parallel route building algorithm for the vehicle routing and scheduling problem with time windows European Journal of Operational Research 66 1993 331 340
    • (1993) European Journal of Operational Research , vol.66 , pp. 331-340
    • Potvin, J.Y.1    Rousseau, J.M.2
  • 36
    • 0001959645 scopus 로고
    • Dynamic vehicle routing problems
    • Elsevier North-Holland
    • H. Psaraftis Dynamic vehicle routing problems Vehicle Routing: Methods and Studies 1988 Elsevier North-Holland 223 248
    • (1988) Vehicle Routing: Methods and Studies , pp. 223-248
    • Psaraftis, H.1
  • 37
    • 31144472823 scopus 로고    scopus 로고
    • A unified heuristic for a large class of vehicle routing problems with backhauls
    • S. Ropke, and D. Pisinger A unified heuristic for a large class of vehicle routing problems with backhauls European Journal of Operational Research 171 2004 750 775
    • (2004) European Journal of Operational Research , vol.171 , pp. 750-775
    • Ropke, S.1    Pisinger, D.2
  • 38
    • 33751011598 scopus 로고    scopus 로고
    • An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows
    • DOI 10.1287/trsc.1050.0135
    • S. Ropke, and D. Pisinger An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transportation Science 2006 455 472 (Pubitemid 44746135)
    • (2006) Transportation Science , vol.40 , Issue.4 , pp. 455-472
    • Ropke, S.1    Pisinger, D.2
  • 39
    • 0002600091 scopus 로고
    • The general pickup and delivery problem
    • M. Savelsbergh, and M. Sol The general pickup and delivery problem Transportation Science 29 1995 17 29
    • (1995) Transportation Science , vol.29 , pp. 17-29
    • Savelsbergh, M.1    Sol, M.2
  • 40
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problems with time window constraints
    • M. Solomon Algorithms for the vehicle routing and scheduling problems with time window Operations Research 35 1987 254 265 (Pubitemid 17652588)
    • (1987) Operations Research , vol.35 , Issue.2 , pp. 254-265
    • Solomon Marius, M.1
  • 41
    • 0036497536 scopus 로고    scopus 로고
    • A parametric analysis of heuristics for the vehicle routing problem with side-constraints
    • DOI 10.1016/S0377-2217(01)00150-3, PII S0377221701001503
    • A. Van Breedam A parametric analysis of heuristics for the vehicle routing problem with side-constraints European Journal of Operational Research 137 2002 348 370 (Pubitemid 33149456)
    • (2002) European Journal of Operational Research , vol.137 , Issue.2 , pp. 348-370
    • Van Breedam, A.1


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