메뉴 건너뛰기




Volumn 30, Issue 4, 2017, Pages 333-348

Ant colony optimization for split delivery inventory routing problem

Author keywords

Ant colony optimization; Inventory; Routing

Indexed keywords


EID: 85036529512     PISSN: 01279084     EISSN: None     Source Type: Journal    
DOI: 10.22452/mjcs.vol30no4.5     Document Type: Article
Times cited : (9)

References (29)
  • 1
    • 84890564346 scopus 로고    scopus 로고
    • 'A branch-and-cut algorithm for the multi-product multi-vehicle inventoryrouting problem'
    • L. C. Coelho, and G. Laporte, 'A branch-and-cut algorithm for the multi-product multi-vehicle inventoryrouting problem'.International Journal of Production Research, Vol. 5, No. 23-24,2013, pp.7156-7169
    • (2013) International Journal of Production Research , vol.5 , Issue.23-24 , pp. 7156-7169
    • Coelho, L.C.1    Laporte, G.2
  • 2
    • 79958186123 scopus 로고    scopus 로고
    • 'An efficient hybrid genetic algorithm for the multi-product multiperiod inventory routing problem'
    • N.H. Moin, S.Salhi and N.A.B.Aziz, 'An efficient hybrid genetic algorithm for the multi-product multiperiod inventory routing problem'. Int. J. Production Economics, Vol. 133, 2011, pp. 334-343
    • (2011) Int. J. Production Economics , vol.133 , pp. 334-343
    • Moin, N.H.1    Salhi, S.2    Aziz, N.A.B.3
  • 4
    • 40849140755 scopus 로고    scopus 로고
    • 'A new model and hybrid approach for large scale inventory routing problems'
    • Y. Yu, H. Chen, and F. Chu, 'A new model and hybrid approach for large scale inventory routing problems'. European Journal of Operational Research, Vol. 189. No. 3, 2008, pp. 1022-1040
    • (2008) European Journal of Operational Research , vol.189 , Issue.3 , pp. 1022-1040
    • Yu, Y.1    Chen, H.2    Chu, F.3
  • 5
    • 4544373774 scopus 로고    scopus 로고
    • 'A price-directed approach to stochastic inventory/routing'
    • D.Adelman,'A price-directed approach to stochastic inventory/routing'.Operations Research, Vol. 52, No. 4, 2004, pp. 499-514
    • (2004) Operations Research , vol.52 , Issue.4 , pp. 499-514
    • Adelman, D.1
  • 6
    • 0036474928 scopus 로고    scopus 로고
    • 'The stochastic inventory routing problem with direct deliveries'
    • A. J.Kleywegt, V. S. Nori, and M. W. Savelsbergh, 'The stochastic inventory routing problem with direct deliveries'. Transportation Science, Vol. 36, No.1, 2002, pp. 94-118
    • (2002) Transportation Science , vol.36 , Issue.1 , pp. 94-118
    • Kleywegt, A.J.1    Nori, V.S.2    Savelsbergh, M.W.3
  • 7
    • 1642324107 scopus 로고    scopus 로고
    • 'Dynamic programming approximations for a stochastic inventory routing problem'
    • A. J. Kleywegt, V. S. Nori, and M. W. Savelsbergh, 'Dynamic programming approximations for a stochastic inventory routing problem'. Transportation Science, Vol. 38, No. 1, 2004, pp. 42-70
    • (2004) Transportation Science , vol.38 , Issue.1 , pp. 42-70
    • Kleywegt, A.J.1    Nori, V.S.2    Savelsbergh, M.W.3
  • 8
    • 84864752936 scopus 로고    scopus 로고
    • 'Large scale stochastic inventory routing problems with split delivery and service level constraints'
    • Y. Yu, C. Chu, H. Chen, and F.Chu, 'Large scale stochastic inventory routing problems with split delivery and service level constraints'. Annals of Operations Research, Vol. 197, No. 1, 2012, pp. 135-158
    • (2012) Annals of Operations Research , vol.197 , Issue.1 , pp. 135-158
    • Yu, Y.1    Chu, C.2    Chen, H.3    Chu, F.4
  • 9
    • 27144476151 scopus 로고    scopus 로고
    • 'Modeling inventory routing problems in supply chains of high consumption products'
    • E. H. Aghezzaf, B.Raa, and H.Van Landeghem, 'Modeling inventory routing problems in supply chains of high consumption products'.European Journal of Operational Research, Vol. 169, 2006, pp. 1048-1063
    • (2006) European Journal of Operational Research , vol.169 , pp. 1048-1063
    • Aghezzaf, E.H.1    Raa, B.2    Van Landeghem, H.3
  • 10
    • 6344267061 scopus 로고    scopus 로고
    • 'A Probabilistic Analysis of a Fixed Partition Policy for the Inventory-Routing Problem'
    • S.Anily, and J.Bramel, 'A Probabilistic Analysis of a Fixed Partition Policy for the Inventory-Routing Problem'.Naval Research Logistics, Vol. 51, 2004, pp. 925-948.DOI: 10.1002/nav.20031
    • (2004) Naval Research Logistics , vol.51 , pp. 925-948
    • Anily, S.1    Bramel, J.2
  • 11
    • 10644237167 scopus 로고    scopus 로고
    • 'A decomposition approach for the inventory-routing problem'
    • A.M. Campbell and M.W.P Savelsbergh, 'A decomposition approach for the inventory-routing problem'. Transportation Science, Vol. 38, No. 4, 2004, pp. 488-502
    • (2004) Transportation Science , vol.38 , Issue.4 , pp. 488-502
    • Campbell, A.M.1    Savelsbergh, M.W.P.2
  • 12
    • 0021489143 scopus 로고
    • 'A combined vehicle routing and inventory allocation problem'
    • A. Federgruen and P. Zipkin,'A combined vehicle routing and inventory allocation problem'. Operations Research, Vol. 32, 1984, pp. 1019-1036
    • (1984) Operations Research , vol.32 , pp. 1019-1036
    • Federgruen, A.1    Zipkin, P.2
  • 13
    • 0001837441 scopus 로고
    • 'An integrated inventory routing allocation and vehicle routing problem'
    • T.W.Chien, A.Balakrishnan, and R. T. Wong, 'An integrated inventory routing allocation and vehicle routing problem'.Transportation Science, Vol. 23, No. 2, 1989, pp. 67-76
    • (1989) Transportation Science , vol.23 , Issue.2 , pp. 67-76
    • Chien, T.W.1    Balakrishnan, A.2    Wong, R.T.3
  • 14
    • 0043059830 scopus 로고
    • 'Savings by split delivery routing'
    • M.Dror and P.Trudeau, 'Savings by split delivery routing'. Transportation Science, Vol. 23, 1989, pp. 141-145
    • (1989) Transportation Science , vol.23 , pp. 141-145
    • Dror, M.1    Trudeau, P.2
  • 17
    • 84886432636 scopus 로고    scopus 로고
    • 'Multi Parents Extended Precedence Preservative Crossover for Job Shop Scheduling Problems'
    • O. C. Sin,N. H. Moin, and M. Omar, 'Multi Parents Extended Precedence Preservative Crossover for Job Shop Scheduling Problems'. Malaysian Journal of Computer Science, Vol. 26, No. 3, 2013
    • (2013) Malaysian Journal of Computer Science , vol.26 , Issue.3
    • Sin, O.C.1    Moin, N.H.2    Omar, M.3
  • 19
    • 84921682232 scopus 로고    scopus 로고
    • 'Adaptive Routing Update Approach for Vanet Using Local Neighbourhood Change Information'
    • A. Rasheed, S. Ajmal and A. Qayyum, 'Adaptive Routing Update Approach for Vanet Using Local Neighbourhood Change Information'. Malaysian Journal of Computer Science, 27, 4, 2014
    • (2014) Malaysian Journal of Computer Science , vol.27 , Issue.4
    • Rasheed, A.1    Ajmal, S.2    Qayyum, A.3
  • 20
    • 77952672360 scopus 로고    scopus 로고
    • 'A modified ant colony optimization algorithm for multi-item inventory routing problem with demand uncertainty'
    • S. H. Huang and P. C. Lin, 'A modified ant colony optimization algorithm for multi-item inventory routing problem with demand uncertainty'. Transportation Research Part E, Vol. 46, 2010, pp. 598-611
    • (2010) Transportation Research Part E , vol.46 , pp. 598-611
    • Huang, S.H.1    Lin, P.C.2
  • 21
    • 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, Vol. 35, No. 2, 1987, pp. 254-265
    • (1987) Operations Research , vol.35 , Issue.2 , pp. 254-265
    • Solomon, M.M.1
  • 22
    • 78049425453 scopus 로고    scopus 로고
    • 'Bilevel model for production-distribution-planning solved by using ant colony optimization'
    • H. I.Calvete, C. Galé, and M. J. Oliveros, 'Bilevel model for production-distribution-planning solved by using ant colony optimization'. Computers and Operation Research, Vol. 38, 2010, pp. 320-327
    • (2010) Computers and Operation Research , vol.38 , pp. 320-327
    • Calvete, H.I.1    Galé, C.2    Oliveros, M.J.3
  • 26
    • 27644543634 scopus 로고    scopus 로고
    • Ant Colony Optimization Theory: A Survey
    • M.Dorigo, and C.Blum, 'Ant Colony Optimization Theory: A Survey'. Theoretical Computer Science, Vol. 344, No. 2-3, 2005, pp. 243-278
    • (2005) Theoretical Computer Science , vol.344 , Issue.2-3 , pp. 243-278
    • Dorigo, M.1    Blum, C.2
  • 29
    • 0015604699 scopus 로고
    • 'An Effective Heuristic Algorithm for the Traveling-Salesman Problem'
    • S. Lin and B. W. Kernighan, 'An Effective Heuristic Algorithm for the Traveling-Salesman Problem'. Operations Research, Vol. 21, 1973, pp. 498-516
    • (1973) Operations Research , vol.21 , pp. 498-516
    • Lin, S.1    Kernighan, B.W.2


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