메뉴 건너뛰기




Volumn 8, Issue 2, 2011, Pages 107-112

Optimization of capacitated vehicle routing problem by Nested Particle Swarm Optimization

Author keywords

Capacitated vehicle routing problem (CVRP); Local optimization; Metaheuristic techniques; Nested Particle Swarm Optimization (NPSO); Travelling salesman problem (TSP)

Indexed keywords


EID: 79952493594     PISSN: 15469239     EISSN: 15543641     Source Type: Journal    
DOI: 10.3844/ajassp.2011.107.112     Document Type: Article
Times cited : (26)

References (22)
  • 1
    • 59349116768 scopus 로고    scopus 로고
    • Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem
    • DOI: 10.1016/j.cie.2008.06.012
    • Ai, J. and V. Kachitvichyanukul, 2009. Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Comput. Indus. Eng., 56: 380-387. DOI: 10.1016/j.cie.2008.06.012
    • (2009) Comput. Indus. Eng , vol.56 , pp. 380-387
    • Ai, J.1    Kachitvichyanukul, V.2
  • 2
    • 59349110114 scopus 로고    scopus 로고
    • A particle swarm optimization for the capacitated vehicle routing problem
    • Ai, T.J. and V. Kachitvichyanukul, 2007. A particle swarm optimization for the capacitated vehicle routing problem. Int. J. Logistics SCM Syst., 2: 50-55.
    • (2007) Int. J. Logistics SCM Syst , vol.2 , pp. 50-55
    • Ai, T.J.1    Kachitvichyanukul, V.2
  • 3
    • 0006554462 scopus 로고
    • A 3-opt based simulated annealing algorithm for vehicle routing problems
    • DOI: 10.1016/0360-8352(91)90165-3
    • Alfa, A.S., S.S. Heragu and M. Chen, 1991. A 3-opt based simulated annealing algorithm for vehicle routing problems. Comput. Indus. Eng., 21: 635-639. DOI: 10.1016/0360-8352(91)90165-3
    • (1991) Comput. Indus. Eng , vol.21 , pp. 635-639
    • Alfa, A.S.1    Heragu, S.S.2    Chen, M.3
  • 4
    • 0037395316 scopus 로고    scopus 로고
    • A genetic algorithm for the vehicle routing problem
    • DOI: 10.1016/S0305-0548(02)00051-5
    • Baker, B.M. and M.A. Ayechew, 2003. A genetic algorithm for the vehicle routing problem. Comput. Operations Res., 30: 787-800. DOI: 10.1016/S0305-0548(02)00051-5
    • (2003) Comput. Operations Res , vol.30 , pp. 787-800
    • Baker, B.M.1    Ayechew, M.A.2
  • 5
    • 0020504118 scopus 로고
    • Routing and scheduling of the vehicle and crews: The state of the art
    • Bodin, L., B.L. Golden, A. Assad and M.O. Ball, 1983. Routing and scheduling of the vehicle and crews: The state of the art. Comp. Operations Res., 10: 63-212.
    • (1983) Comp. Operations Res , vol.10 , pp. 63-212
    • Bodin, L.1    Golden, B.L.2    Assad, A.3    Ball, M.O.4
  • 6
    • 0033446619 scopus 로고    scopus 로고
    • An improved ant system algorithm for thevehicle routing problem
    • DOI: 10.1023/A:1018940026670
    • Bullnheimer, R., F. Hartl and C. Strauss, 1999. An improved ant system algorithm for thevehicle routing problem. Annals Operation Res., 89: 319-328. DOI: 10.1023/A:1018940026670
    • (1999) Annals Operation Res , vol.89 , pp. 319-328
    • Bullnheimer, R.1    Hartl, F.2    Strauss, C.3
  • 7
    • 33744757412 scopus 로고    scopus 로고
    • Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
    • DOI: 10.1631/jzus.2006.A0607
    • Chen, A.L., G.K. Yang and Z.M. Wu, 2006. Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. J. Zhejiang Univ. Sci., 7: 607-614. DOI: 10.1631/jzus.2006.A0607
    • (2006) J. Zhejiang Univ. Sci , vol.7 , pp. 607-614
    • Chen, A.L.1    Yang, G.K.2    Wu, Z.M.3
  • 8
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • DOI: 10.1287/opre.12.4.568
    • Clarke, G. and J.V. Wright, 1964. Scheduling of vehicles from a central depot to a number of delivery points. Operations Res., 12: 568-581. DOI: 10.1287/opre.12.4.568
    • (1964) Operations Res , vol.12 , pp. 568-581
    • Clarke, G.1    Wright, J.V.2
  • 9
    • 34047270838 scopus 로고    scopus 로고
    • 1st Edn., ISTE, London, ISBN: 1905209045
    • Clerc M., 2006. Particle Swarm Optimization. 1st Edn., ISTE, London, ISBN: 1905209045, 243.
    • (2006) Particle Swarm Optimization , pp. 243
    • Clerc, M.1
  • 11
    • 0001953950 scopus 로고
    • The truck dispatching problem
    • DOI: 10.1287/mnsc.6.1.80
    • Dantzig, G.B. and J.H. Ramser, 1959. The truck dispatching problem. Manage. Sci., 6: 80-91. DOI: 10.1287/mnsc.6.1.80
    • (1959) Manage. Sci , vol.6 , pp. 80-91
    • Dantzig, G.B.1    Ramser, J.H.2
  • 12
    • 0028530194 scopus 로고
    • A tabu search heuristic for the vehicle routing problem
    • DOI: 10.1287/mnsc.40.10.1276
    • Gendreau, M., A. Hertz and G. Laporte, 1994. A tabu search heuristic for the vehicle routing problem. Manage. Sci., 40: 1276-1290. DOI: 10.1287/mnsc.40.10.1276
    • (1994) Manage. Sci , vol.40 , pp. 1276-1290
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 16
    • 0004222346 scopus 로고    scopus 로고
    • 1st Edn., Morgan Kaufman Publishers, USA., ISBN-10: 1558605959
    • Kennedy, J., R. Eberhart and Y. Shi, 2001. Swarm Intelligence. 1st Edn., Morgan Kaufman Publishers, USA., ISBN-10: 1558605959, 512.
    • (2001) Swarm Intelligence , pp. 512
    • Kennedy, J.1    Eberhart, R.2    Shi, Y.3
  • 17
    • 21144444352 scopus 로고    scopus 로고
    • A new branch-and-cut algorithm for the capacitated vehicle routing problem
    • DOI: 10.1007/s10107-003-0481-8
    • Lysgaard, J., A.N. Letchford and R.W. Eglese, 2004. A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathem. Programm., 100: 423-445. DOI: 10.1007/s10107-003-0481-8
    • (2004) Mathem. Programm , vol.100 , pp. 423-445
    • Lysgaard, J.1    Letchford, A.N.2    Eglese, R.W.3
  • 18
    • 77953735424 scopus 로고    scopus 로고
    • Optimized crossover genetic algorithm for vehicle routing problem with time windows
    • DOI: 10.3844/ajassp.2010.95.101
    • Nazif, H. and L.S. Lee, 2010. Optimized crossover genetic algorithm for vehicle routing problem with time windows. Am. J. Applied Sci., 7: 95-101. DOI: 10.3844/ajassp.2010.95.101
    • (2010) Am. J. Applied Sci , vol.7 , pp. 95-101
    • Nazif, H.1    Lee, L.S.2
  • 19
    • 20544477332 scopus 로고    scopus 로고
    • The vehicle routing problem with time windows Part II: Genetic Search
    • DOI: 10.1287/ijoc.8.2.165
    • Potvin, J.Y. and S. Bengio, 1996. The vehicle routing problem with time windows Part II: Genetic Search. Informs J. Comput., 8: 165-172. DOI: 10.1287/ijoc.8.2.165
    • (1996) Informs J. Comput , vol.8 , pp. 165-172
    • Potvin, J.Y.1    Bengio, S.2
  • 20
    • 77956806741 scopus 로고    scopus 로고
    • A modified partially mapped multicrossover genetic algorithm for two-dimensional bin packing problem
    • DOI: 10.3844/jmssp.2010.157.162
    • Sarabian, M. and L.V. Lee, 2010. A modified partially mapped multicrossover genetic algorithm for two-dimensional bin packing problem. J. Math. Stat., 6: 157-162. DOI: 10.3844/jmssp.2010.157.162
    • (2010) J. Math. Stat , vol.6 , pp. 157-162
    • Sarabian, M.1    Lee, L.V.2
  • 21
    • 79952528246 scopus 로고    scopus 로고
    • Production scheduling for dispatching ready mixed concrete trucks using bee colony optimization
    • DOI:10.3844/ajeassp.2010.7.14
    • Srichandum, S. and T. Rujirayanyong, 2010. Production scheduling for dispatching ready mixed concrete trucks using bee colony optimization. Am. J. Eng. Applied Sci., 3: 7-14. DOI:10.3844/ajeassp.2010.7.14
    • (2010) Am. J. Eng. Applied Sci , vol.3 , pp. 7-14
    • Srichandum, S.1    Rujirayanyong, T.2
  • 22
    • 33845512751 scopus 로고
    • Parallel iterative search methods for vehicle routing problems
    • DOI: 10.1002/net.3230230804
    • Thaillard, E., 1993. Parallel iterative search methods for vehicle routing problems. Networks, 23: 661-673. DOI: 10.1002/net.3230230804
    • (1993) Networks , vol.23 , pp. 661-673
    • Thaillard, E.1


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