메뉴 건너뛰기




Volumn 63, Issue , 1996, Pages 3-27

Simulated annealing metaheuristics for the vehicle routing problem with time windows

Author keywords

Metaheuristics; Simulated annealing; Vehicle routing problems with time windows

Indexed keywords


EID: 21344463824     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/BF02601637     Document Type: Article
Times cited : (246)

References (40)
  • 1
    • 0022955376 scopus 로고
    • Solution improvement heuristics for the vehicle routing and scheduling problem with time window constraints
    • E. Baker and J. Schaffer, Solution improvement heuristics for the vehicle routing and scheduling problem with time window constraints, Amer. J. Math. Manag. Sci. 6(1986)261-300.
    • (1986) Amer. J. Math. Manag. Sci. , vol.6 , pp. 261-300
    • Baker, E.1    Schaffer, J.2
  • 2
    • 0022766237 scopus 로고
    • The asymptotic behavior of quadratic sum assignment problems: A statistical mechanics approach
    • E. Bonomi and J.L. Lutton, The asymptotic behavior of quadratic sum assignment problems: A statistical mechanics approach, Euro. J. Oper. Res. 26(1986)295-300.
    • (1986) Euro. J. Oper. Res. , vol.26 , pp. 295-300
    • Bonomi, E.1    Lutton, J.L.2
  • 3
    • 0021819411 scopus 로고
    • Thermodynamic approach to the traveling salesman problem
    • V. Cerny, Thermodynamic approach to the traveling salesman problem, J. Optim. Theory Appl. 45(1985)41-51.
    • (1985) J. Optim. Theory Appl. , vol.45 , pp. 41-51
    • Cerny, V.1
  • 4
    • 0025699777 scopus 로고
    • An improved annealing scheme for the QAP
    • D.T. Connolly, An improved annealing scheme for the QAP, Euro. J. Oper. Res. 46(1990) 93-100.
    • (1990) Euro. J. Oper. Res. , vol.46 , pp. 93-100
    • Connolly, D.T.1
  • 5
    • 0021439402 scopus 로고
    • The period routing problem
    • N. Christofides and J. Beasley, The period routing problem, Networks 14(1984)237-246.
    • (1984) Networks , vol.14 , pp. 237-246
    • Christofides, N.1    Beasley, J.2
  • 6
    • 85042163696 scopus 로고
    • A new optimization algorithm for the vehicle routing problem with time windows
    • M. Desrochers, J. Desrosiers and M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Oper. Res. 40(1992)342-354.
    • (1992) Oper. Res. , vol.40 , pp. 342-354
    • Desrochers, M.1    Desrosiers, J.2    Solomon, M.3
  • 7
    • 0002509314 scopus 로고
    • Vehicle routing with time windows: Optimization and approximation
    • ed. B.L. Golden and A.A. Assad North-Holland, Amsterdam
    • M. Desrochers, J.K. Lenstra, J.K. Savelsberg and F. Soumis, Vehicle routing with time windows: Optimization and approximation, in: Vehicle Routing: Methods and Studies, ed. B.L. Golden and A.A. Assad (North-Holland, Amsterdam, 1988) pp. 65-84.
    • (1988) Vehicle Routing: Methods and Studies , pp. 65-84
    • Desrochers, M.1    Lenstra, J.K.2    Savelsberg, J.K.3    Soumis, F.4
  • 8
    • 0019574134 scopus 로고
    • A generalized assignment heuristic for vehicle routing
    • M. Fisher and R. Jaikumar, A generalized assignment heuristic for vehicle routing, Networks 11(1981)109-124.
    • (1981) Networks , vol.11 , pp. 109-124
    • Fisher, M.1    Jaikumar, R.2
  • 9
    • 27844455179 scopus 로고
    • Vehicle routing with time windows
    • IMSOR, Technical University of Denmark, DK-2800 Lyngby, Denmark
    • M. Fisher, K.O. Jörnsten and O.B.G. Madsen, Vehicle routing with time windows, Research Report 4C/1991, IMSOR, Technical University of Denmark, DK-2800 Lyngby, Denmark (1991).
    • (1991) Research Report 4C/1991
    • Fisher, M.1    Jörnsten, K.O.2    Madsen, O.B.G.3
  • 10
    • 0026820330 scopus 로고
    • A simulated annealing approach to the network design problem with variational inequality constraints
    • T. Friesz, H.-J. Cho, N. Mehta, R. Tobin and G. Anandalingam, A simulated annealing approach to the network design problem with variational inequality constraints, Transp. Sci. 26(1992) 18-26.
    • (1992) Transp. Sci. , vol.26 , pp. 18-26
    • Friesz, T.1    Cho, H.-J.2    Mehta, N.3    Tobin, R.4    Anandalingam, G.5
  • 11
    • 0022865373 scopus 로고
    • Future paths for integer programming and links to artificial intelligence
    • F. Glover, Future paths for integer programming and links to artificial intelligence, Comp. Oper. Res. 5(1986)533-549.
    • (1986) Comp. Oper. Res. , vol.5 , pp. 533-549
    • Glover, F.1
  • 12
    • 0000411214 scopus 로고
    • Tabu search, Part 1
    • F. Glover, Tabu search, Part 1, ORSA J. Comp. 1(1990)190-206.
    • (1990) ORSA J. Comp. , vol.1 , pp. 190-206
    • Glover, F.1
  • 13
    • 0002703574 scopus 로고
    • Tabu search: A tutorial
    • F. Glover, Tabu search: A tutorial, Interfaces 20(1990)74-94.
    • (1990) Interfaces , vol.20 , pp. 74-94
    • Glover, F.1
  • 14
    • 0001724713 scopus 로고
    • Tabu search, Part 2
    • F. Glover, Tabu search, Part 2, ORSA J. Comp. 2(1991)4-32.
    • (1991) ORSA J. Comp. , vol.2 , pp. 4-32
    • Glover, F.1
  • 17
    • 0024770085 scopus 로고
    • Optimization by simulated annealing: An experimental evaluation: Part I, Graph partitioning
    • D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation: Part I, Graph partitioning, Oper. Res. 37(1989)865-892.
    • (1989) Oper. Res. , vol.37 , pp. 865-892
    • Johnson, D.S.1    Aragon, C.R.2    McGeoch, L.A.3    Schevon, C.4
  • 18
    • 0001047763 scopus 로고
    • Optimization by simulated annealing: An experimental evaluation: Part II, Graph coloring and number partitioning
    • D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation: Part II, Graph coloring and number partitioning, Oper. Res. 39 (1991)378-406.
    • (1991) Oper. Res. , vol.39 , pp. 378-406
    • Johnson, D.S.1    Aragon, C.R.2    McGeoch, L.A.3    Schevon, C.4
  • 19
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S. Kirkpatrick, D.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983)671-680.
    • (1983) Science , vol.220 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, D.D.2    Vecchi, M.P.3
  • 20
    • 0009564139 scopus 로고
    • Improved heuristics for the vehicle routing problems with time windows
    • Operations Research Group, The University of Texas at Austin
    • G. Kontoravdis and J. Bard, Improved heuristics for the vehicle routing problems with time windows, Working Paper, Operations Research Group, The University of Texas at Austin (1992).
    • (1992) Working Paper
    • Kontoravdis, G.1    Bard, J.2
  • 21
    • 0026857186 scopus 로고
    • An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints
    • Y.A. Koskosidis, W.B. Powell and M.M. Solomon, An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints, Transp. Sci. 26(1992)69-85.
    • (1992) Transp. Sci. , vol.26 , pp. 69-85
    • Koskosidis, Y.A.1    Powell, W.B.2    Solomon, M.M.3
  • 22
    • 0027580496 scopus 로고
    • Bandwidth packing: A tabu search approach
    • M.M. Laguna and F. Glover, Bandwidth packing: A tabu search approach, Manag. Sci. 39 (1993)492-500.
    • (1993) Manag. Sci. , vol.39 , pp. 492-500
    • Laguna, M.M.1    Glover, F.2
  • 23
    • 0004779059 scopus 로고
    • A controlled search simulated annealing method for the single machine weighted tardiness problems
    • H. Matsuo, C. Suh and R. Sullivan, A controlled search simulated annealing method for the single machine weighted tardiness problems, Ann. Open Res. 21(1989)85-108.
    • (1989) Ann. Open Res. , vol.21 , pp. 85-108
    • Matsuo, H.1    Suh, C.2    Sullivan, R.3
  • 24
    • 0003657544 scopus 로고
    • A controlled search simulated annealing method for the general job shop scheduling problem
    • Graduate School of Business, University of Texas at Austin
    • H. Matsuo, C. Suh and R. Sullivan, A controlled search simulated annealing method for the general job shop scheduling problem, Working Paper, Graduate School of Business, University of Texas at Austin (1987).
    • (1987) Working Paper
    • Matsuo, H.1    Suh, C.2    Sullivan, R.3
  • 27
    • 21144460138 scopus 로고
    • Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems
    • I.H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems, Ann. Oper. Res. 40(1993)421-452.
    • (1993) Ann. Oper. Res. , vol.40 , pp. 421-452
    • Osman, I.H.1
  • 28
    • 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, Euro. J. Oper. Res. 66(1993)331-340.
    • (1993) Euro. J. Oper. Res. , vol.66 , pp. 331-340
    • Potvin, J.Y.1    Rousseau, J.M.2
  • 29
    • 0000187093 scopus 로고
    • An effective heuristic for the M-tour traveling salesman problem with some side conditions
    • R. Russell, An effective heuristic for the M-tour traveling salesman problem with some side conditions, Oper. Res. 25(1977)517-524.
    • (1977) Oper. Res. , vol.25 , pp. 517-524
    • Russell, R.1
  • 30
    • 0001407513 scopus 로고
    • Hybrid heuristics for the vehicle routing problem with time windows
    • R. Russell, Hybrid heuristics for the vehicle routing problem with time windows, Transp. Sci. 29(1995)156-166.
    • (1995) Transp. Sci. , vol.29 , pp. 156-166
    • Russell, R.1
  • 31
    • 0000110116 scopus 로고
    • Local search in routing problems with time windows
    • M. Savelsbergh, Local search in routing problems with time windows, Ann. Oper. Res. 4(1985) 285-305.
    • (1985) Ann. Oper. Res. , vol.4 , pp. 285-305
    • Savelsbergh, M.1
  • 32
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and cheduling problem with time window constraints
    • M. Solomon, Algorithms for the vehicle routing and cheduling problem with time window constraints, Oper. Res. 35(1987)254-265.
    • (1987) Oper. Res. , vol.35 , pp. 254-265
    • Solomon, M.1
  • 33
    • 0023964259 scopus 로고
    • Time window constrained routing and scheduling problems
    • M. Solomon and J. Desrosiers, Time window constrained routing and scheduling problems, Transp. Sci. 22(1988)1-13.
    • (1988) Transp. Sci. , vol.22 , pp. 1-13
    • Solomon, M.1    Desrosiers, J.2
  • 34
    • 0006090285 scopus 로고
    • Vehicle routing and scheduling problems with time window constraints: Efficient implementations of solution improvement procedures
    • ed. B.L. Golden and A.A. Assad North-Holland, Amsterdam
    • M.M. Solomon, E.K. Baker and J.R. Schaffer, Vehicle routing and scheduling problems with time window constraints: Efficient implementations of solution improvement procedures, in: Vehicle Routing: Methods and Studies, ed. B.L. Golden and A.A. Assad (North-Holland, Amsterdam, 1985) pp. 85-105.
    • (1985) Vehicle Routing: Methods and Studies , pp. 85-105
    • Solomon, M.M.1    Baker, E.K.2    Schaffer, J.R.3
  • 35
    • 0026189990 scopus 로고
    • Robust tabu search for the quadratic assignment problem
    • E. Taillard, Robust tabu search for the quadratic assignment problem, Parallel Comp. 17(1991) 443-455.
    • (1991) Parallel Comp. , vol.17 , pp. 443-455
    • Taillard, E.1
  • 38
    • 0027667558 scopus 로고
    • Cyclic transfer algorithms for multi-vehicle routing and scheduling problems
    • P.M. Thompson and H. Psaraftis, Cyclic transfer algorithms for multi-vehicle routing and scheduling problems, Oper. Res. 41(1993)935-946.
    • (1993) Oper. Res. , vol.41 , pp. 935-946
    • Thompson, P.M.1    Psaraftis, H.2
  • 40
    • 0023315023 scopus 로고
    • Solving quadratic assignment problems by simulated annealing
    • M.R. Wilhelm and T.L. Ward, Solving quadratic assignment problems by simulated annealing, IEEE Trans. 19(1987)107-119.
    • (1987) IEEE Trans. , vol.19 , pp. 107-119
    • Wilhelm, M.R.1    Ward, T.L.2


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