메뉴 건너뛰기




Volumn 40, Issue 12, 2013, Pages 2893-2905

Nested simulated annealing approach to periodic routing problem of a retail distribution system

Author keywords

Integer programming; Periodic traveling salesman; Retail logistics; Simulated annealing; Visiting frequency

Indexed keywords

COMPUTATIONAL TESTS; HEURISTIC PROCEDURES; INTEGER PROGRAMMING MODELS; PERIODIC ROUTING PROBLEMS; PERIODIC TRAVELING SALESMAN PROBLEM; RETAIL DISTRIBUTION; TRAVELING SALESMAN; VISITING FREQUENCY;

EID: 84880725356     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.06.004     Document Type: Article
Times cited : (11)

References (33)
  • 1
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problems with time window constraints
    • M.M. Solomon Algorithms for the vehicle routing and scheduling problems with time window constraints Operations Research 35 1987 254 265
    • (1987) Operations Research , vol.35 , pp. 254-265
    • Solomon, M.M.1
  • 2
    • 0023964259 scopus 로고    scopus 로고
    • Time window constrained routing and scheduling problems
    • M.M. Solomon, and J. Derrosiers Time window constrained routing and scheduling problems Transportation Science 22 1998 1 13
    • (1998) Transportation Science , vol.22 , pp. 1-13
    • Solomon, M.M.1    Derrosiers, J.2
  • 4
    • 0024016482 scopus 로고
    • Perspectives on practical aspects of truck routing and scheduling
    • DOI 10.1016/0377-2217(88)90022-7
    • D. Ronen Perspectives on practical aspects of truck routing and scheduling European Journal of Operational Research 35 1988 137 145 (Pubitemid 18606291)
    • (1988) European Journal of Operational Research , vol.35 , Issue.2 , pp. 137-145
    • Ronen David1
  • 5
    • 39649088959 scopus 로고    scopus 로고
    • Multi-objective vehicle routing problems
    • DOI 10.1016/j.ejor.2007.05.055, PII S0377221707005498
    • N. Jozefowiez, F. Semet, and E.G. Talbi Multi-objective vehicle routing problems European Journal of Operational Research 189 2008 293 309 (Pubitemid 351288509)
    • (2008) European Journal of Operational Research , vol.189 , Issue.2 , pp. 293-309
    • Jozefowiez, N.1    Semet, F.2    Talbi, E.-G.3
  • 6
    • 0041791136 scopus 로고    scopus 로고
    • Society for Industrial and Applied Mathematics Philadelphia
    • P Toth, and D. Vigo The vehicle routing problem 2002 Society for Industrial and Applied Mathematics Philadelphia
    • (2002) The Vehicle Routing Problem
    • Toth, P.1    Vigo, D.2
  • 7
    • 77950264586 scopus 로고    scopus 로고
    • Distribution and transport planning
    • H. Stadtler, C. Kilger, Springer Berlin
    • B. Fleischmann Distribution and transport planning H. Stadtler, C. Kilger, Supply Chain Management and Advanced Planning 2005 Springer Berlin 229 244
    • (2005) Supply Chain Management and Advanced Planning , pp. 229-244
    • Fleischmann, B.1
  • 9
    • 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
  • 10
    • 0021439402 scopus 로고
    • The period routing problem
    • N. Christofides, and J.E. Beasley The period routing problem Networks 14 1984 237 256
    • (1984) Networks , vol.14 , pp. 237-256
    • Christofides, N.1    Beasley, J.E.2
  • 12
    • 0026943642 scopus 로고
    • A multiperiod traveling salesman problem: Heuristic algorithms
    • G. Paletta A multiperiod traveling salesman problem: heuristic algorithms Computers & Operations Research 19 1992 789 795
    • (1992) Computers & Operations Research , vol.19 , pp. 789-795
    • Paletta, G.1
  • 13
    • 0036722159 scopus 로고    scopus 로고
    • The period traveling salesman problem: A new heuristic algorithm
    • DOI 10.1016/S0305-0548(01)00035-1, PII S0305054801000351
    • G. Paletta The period traveling salesman problem: a new heuristic algorithm Computers & Operations Research 29 2002 1343 1352 (Pubitemid 34409651)
    • (2002) Computers and Operations Research , vol.29 , Issue.10 , pp. 1343-1352
    • Paletta, G.1
  • 14
    • 1642411093 scopus 로고    scopus 로고
    • An improved heuristic for the period traveling salesman problem
    • DOI 10.1016/S0305-0548(03)00075-3, PII S0305054803000753
    • L. Bertazzi, G. Paletta, and M.G. Speranza An improved heuristic for the period traveling salesman problem Computers & Operations Research 31 2004 1215 1222 (Pubitemid 38356029)
    • (2004) Computers and Operations Research , vol.31 , Issue.8 , pp. 1215-1222
    • Bertazzi, L.1    Paletta, G.2    Speranza, M.G.3
  • 15
    • 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
  • 18
    • 78549246528 scopus 로고    scopus 로고
    • Heuristic algorithms for the 2-period balanced Travelling Salesman Problem in Euclidean graphs
    • T. Bassetto, and F. Mason Heuristic algorithms for the 2-period balanced Travelling Salesman Problem in Euclidean graphs European Journal of Operational Research 208 2011 253 262
    • (2011) European Journal of Operational Research , vol.208 , pp. 253-262
    • Bassetto, T.1    Mason, F.2
  • 19
    • 0026882276 scopus 로고
    • Nested annealing: A provable improvement to simulated annealing
    • S. Rajasekaran, and J.H. Reif Nested annealing: a provable improvement to simulated annealing Theoretical Computer Science 99 1992 157 176
    • (1992) Theoretical Computer Science , vol.99 , pp. 157-176
    • Rajasekaran, S.1    Reif, J.H.2
  • 21
    • 0346111806 scopus 로고    scopus 로고
    • On simulated annealing and nested annealing
    • S. Rajasekaran On simulated annealing and nested annealing Journal of Global Optimization 16 2000 43 56
    • (2000) Journal of Global Optimization , vol.16 , pp. 43-56
    • Rajasekaran, S.1
  • 22
    • 42949111983 scopus 로고    scopus 로고
    • Cellular network configuration with co-channel and adjacent-channel interference constraints
    • DOI 10.1016/j.cor.2007.02.006, PII S0305054807000408
    • M.R. Akella, R. Batta, M. Sudit, P. Rogerson, and A. Blatt Cellular network configuration with co-channel and adjacent-channel interference constraints Computers&Operations Research 35 2008 3738 3757 (Pubitemid 351608440)
    • (2008) Computers and Operations Research , vol.35 , Issue.12 , pp. 3738-3757
    • Akella, M.R.1    Batta, R.2    Sudit, M.3    Rogerson, P.4    Blatt, A.5
  • 23
  • 26
    • 30044449841 scopus 로고    scopus 로고
    • Two new robust genetic algorithms for the flowshop scheduling problem
    • DOI 10.1016/j.omega.2004.12.006, PII S0305048305000174
    • R. Ruiz, C. Maroto, and J. Alcaraz Two new robust genetic algorithms for the flowshop scheduling problem Omega 34 2006 461 476 (Pubitemid 43046058)
    • (2006) Omega , vol.34 , Issue.5 , pp. 461-476
    • Ruiz, R.1    Maroto, C.2    Alcaraz, J.3
  • 28
    • 33244484571 scopus 로고    scopus 로고
    • Incorporating robustness into Genetic Algorithm search of stochastic simulation outputs
    • DOI 10.1016/j.simpat.2005.05.001, PII S1569190X05000687
    • R. Al-Aomar Incorporating robustness into genetic algorithm search of stochastic simulation outputs Simulation Modelling Practice and Theory 14 2006 201 223 (Pubitemid 43277668)
    • (2006) Simulation Modelling Practice and Theory , vol.14 , Issue.3 , pp. 201-223
    • Al-Aomar, R.1
  • 30
    • 34548667975 scopus 로고    scopus 로고
    • Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
    • R. Ruiz, and A. Allahverdi Some effective heuristics for no-wait flowshops with setup times to minimize total completion time Annals of Operations Research 156 1 2007 143 171
    • (2007) Annals of Operations Research , vol.156 , Issue.1 , pp. 143-171
    • Ruiz, R.1    Allahverdi, A.2
  • 31
    • 84857124013 scopus 로고    scopus 로고
    • Simultaneous solving of balancing and sequencing problems with station-dependent assembly times for mixed-model assembly lines
    • H. Mosadegh, M. Zandieh, and S.M.T. FatemiGhomi Simultaneous solving of balancing and sequencing problems with station-dependent assembly times for mixed-model assembly lines Applied Soft Computing 12 2012 1359 1370
    • (2012) Applied Soft Computing , vol.12 , pp. 1359-1370
    • Mosadegh, H.1    Zandieh, M.2    Fatemighomi, S.M.T.3
  • 32
    • 84880747250 scopus 로고    scopus 로고
    • MATLAB 7.6. (R2008a). The language of technical computing. USA: Massachusetts; 1984
    • MATLAB 7.6. (R2008a). The language of technical computing. USA: Massachusetts; 1984.
  • 33
    • 84880736236 scopus 로고    scopus 로고
    • ILOG OPL Studio 3.7 ILOG SA, France 2003
    • ILOG OPL Studio 3.7. Language Manual. ILOG SA, France; 2003.
    • Language Manual


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