메뉴 건너뛰기




Volumn 6, Issue 4, 2009, Pages 519-537

A particle swarm optimisation for vehicle routing problem with time windows

Author keywords

Heuristics; Particle swarm optimisation; PSO; Vehicle routing problem with time windows; VRPTW

Indexed keywords


EID: 67849094605     PISSN: 17457645     EISSN: 17457653     Source Type: Journal    
DOI: 10.1504/IJOR.2009.027156     Document Type: Article
Times cited : (51)

References (24)
  • 1
    • 59349110114 scopus 로고    scopus 로고
    • A particle swarm optimization for the capacitated vehicle routing problem
    • Ai, T.J. and Kachitvichyanukul, V. (2007) 'A particle swarm optimization for the capacitated vehicle routing problem', International Journal of Logistics and SCM Systems, Vol. 2, No. 1, pp.50-55.
    • (2007) International Journal of Logistics and SCM Systems , vol.2 , Issue.1 , pp. 50-55
    • Ai, T.J.1    Kachitvichyanukul, V.2
  • 2
  • 3
    • 33749651515 scopus 로고    scopus 로고
    • A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
    • Alvarenga, G.B., Mateus, G.R. and de Tomi, G. (2007) 'A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows', Computers and Operations Research, Vol. 34, No. 6, pp.1561-1584.
    • (2007) Computers and Operations Research , vol.34 , Issue.6 , pp. 1561-1584
    • Alvarenga, G.B.1    Mateus, G.R.2    de Tomi, G.3
  • 4
    • 0036567019 scopus 로고    scopus 로고
    • A branch-and-cut procedure for the vehicle routing problem with time windows
    • Bard, J.F., Kontoravdis, G. and Yu, G. (2002) 'A branch-and-cut procedure for the vehicle routing problem with time windows', Transportation Science, Vol. 36, No. 2, pp.250-269.
    • (2002) Transportation Science , vol.36 , Issue.2 , pp. 250-269
    • Bard, J.F.1    Kontoravdis, G.2    Yu, G.3
  • 5
    • 2642548894 scopus 로고    scopus 로고
    • A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
    • Berger, J. and Barkaoui, M. (2004) 'A parallel hybrid genetic algorithm for the vehicle routing problem with time windows', Computers and Operations Research, Vol. 31, No. 12, pp.2037-2053.
    • (2004) Computers and Operations Research , vol.31 , Issue.12 , pp. 2037-2053
    • Berger, J.1    Barkaoui, M.2
  • 6
    • 16244364524 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, part I: Route construction and local search algorithms
    • Bräysy, O. and Gendreau, M. (2005a) 'Vehicle routing problem with time windows, part I: Route construction and local search algorithms', Transportation Science, Vol. 39, No. 1, pp.104-118.
    • (2005) Transportation Science , vol.39 , Issue.1 , pp. 104-118
    • Bräysy, O.1    Gendreau, M.2
  • 7
    • 16244404291 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, part II: Metaheuristics
    • Bräysy, O. and Gendreau, M. (2005b) 'Vehicle routing problem with time windows, part II: Metaheuristics', Transportation Science, Vol. 39, No. 1, pp.119-139.
    • (2005) Transportation Science , vol.39 , Issue.1 , pp. 119-139
    • Bräysy, O.1    Gendreau, M.2
  • 8
    • 33744757412 scopus 로고    scopus 로고
    • Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
    • Chen, A.L., Yang, G.K. and Wu, Z.M. (2006) 'Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem', Journal of Zhejiang University: Science, Vol. 7, No. 4, pp.607-614.
    • (2006) Journal of Zhejiang University: Science , vol.7 , Issue.4 , pp. 607-614
    • Chen, A.L.1    Yang, G.K.2    Wu, Z.M.3
  • 10
    • 0001834106 scopus 로고    scopus 로고
    • MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows
    • Corne, D, Dorigo, M. and Glover, F, Eds, McGraw-Hill, London, pp
    • Gambardella, L.M., Taillard, E. and Agazzi, G. (1999) 'MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows', in Corne, D., Dorigo, M. and Glover, F. (Eds.): New Ideas in Optimization, McGraw-Hill, London, pp.63-76.
    • (1999) New Ideas in Optimization , pp. 63-76
    • Gambardella, L.M.1    Taillard, E.2    Agazzi, G.3
  • 11
    • 36749094527 scopus 로고    scopus 로고
    • A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems
    • Jarboui, B., Damak, N., Siarry, P. and Rebai, A. (2008) 'A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems', Applied Mathematics and Computation, Vol. 195, No. 1, pp.299-308.
    • (2008) Applied Mathematics and Computation , vol.195 , Issue.1 , pp. 299-308
    • Jarboui, B.1    Damak, N.2    Siarry, P.3    Rebai, A.4
  • 14
    • 0031140531 scopus 로고    scopus 로고
    • An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation
    • Kohl, N. and Madsen, O.B.G. (1997) 'An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation', Operations Research, Vol. 45, No. 3, pp.395-406.
    • (1997) Operations Research , vol.45 , Issue.3 , pp. 395-406
    • Kohl, N.1    Madsen, O.B.G.2
  • 16
    • 67849089859 scopus 로고    scopus 로고
    • A comparison between algorithms VNS with PSO and VNS without PSO for job-shop scheduling problems
    • Pongchairerks, P. and Kachitvichyanukul, V. (2007) 'A comparison between algorithms VNS with PSO and VNS without PSO for job-shop scheduling problems', International Journal of Computational Science, Vol. 1, No. 2, pp.179-191.
    • (2007) International Journal of Computational Science , vol.1 , Issue.2 , pp. 179-191
    • Pongchairerks, P.1    Kachitvichyanukul, V.2
  • 17
    • 67849118089 scopus 로고    scopus 로고
    • A two-level particle swarm optimization algorithm on job-shop scheduling problems
    • Pongchairerks, P. and Kachitvichyanukul, V. (2009) 'A two-level particle swarm optimization algorithm on job-shop scheduling problems', Int. J. Operational Research, Vol. 4, No. 4, pp.390-411.
    • (2009) Int. J. Operational Research , vol.4 , Issue.4 , pp. 390-411
    • Pongchairerks, P.1    Kachitvichyanukul, V.2
  • 20
    • 33751191658 scopus 로고    scopus 로고
    • A hybrid particle swarm optimization for job shop scheduling problem
    • Sha, D.Y. and Hsu, C.Y. (2006) 'A hybrid particle swarm optimization for job shop scheduling problem', Computers and Industrial Engineering Vol. 51, No. 4, pp.791-808.
    • (2006) Computers and Industrial Engineering , vol.51 , Issue.4 , pp. 791-808
    • Sha, D.Y.1    Hsu, C.Y.2
  • 21
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problems with time window constraints
    • Solomon, M.M. (1987) 'Algorithms for the vehicle routing and scheduling problems with time window constraints', Operations Research, Vol. 35, No. 2, pp.254-265.
    • (1987) Operations Research , vol.35 , Issue.2 , pp. 254-265
    • Solomon, M.M.1
  • 22
    • 0035330330 scopus 로고    scopus 로고
    • Hybrid genetic algorithms in solving vehicle routing problems with time window constraints
    • Tan, K.C., Lee, L.H. and Ou, K. (2001) 'Hybrid genetic algorithms in solving vehicle routing problems with time window constraints', Asia-Pacific Journal of Operational Research, Vol. 18, No. 1, pp.121-130.
    • (2001) Asia-Pacific Journal of Operational Research , vol.18 , Issue.1 , pp. 121-130
    • Tan, K.C.1    Lee, L.H.2    Ou, K.3
  • 23
    • 33751236810 scopus 로고    scopus 로고
    • A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
    • Tasgetiren, M.F., Liang, Y.C., Sevkli, M. and Gencyilmaz, G. (2007) 'A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem', European Journal of Operational Research, Vol. 177, No. 3, pp.1930-1947.
    • (2007) European Journal of Operational Research , vol.177 , Issue.3 , pp. 1930-1947
    • Tasgetiren, M.F.1    Liang, Y.C.2    Sevkli, M.3    Gencyilmaz, G.4


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