메뉴 건너뛰기




Volumn 3, Issue 1, 2007, Pages 189-198

An intelligent solution system for a vehicle routing problem in urban distribution

Author keywords

Artificial intelligence (AI); Routing schemes; Urban distribution; Vehicle routing problem (VRP)

Indexed keywords


EID: 48249153231     PISSN: 13494198     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (47)

References (23)
  • 2
    • 61549140843 scopus 로고    scopus 로고
    • A survey of logistics delivery vehicle scheduling
    • Natural Science Edition
    • Yang, Y. and X. S. Gu, A survey of logistics delivery vehicle scheduling, Journal of Southeast University, Natural Science Edition, vol.33, pp.105-111, 2003.
    • (2003) Journal of Southeast University , vol.33 , pp. 105-111
    • Yang, Y.1    Gu, X.S.2
  • 3
    • 84867946486 scopus 로고    scopus 로고
    • Models, relaxations and exact approaches for the capacitated vehicle routing problem
    • Toth, P. and D. Vigo, Models, relaxations and exact approaches for the capacitated vehicle routing problem, Discrete Applied Mathematics, vol. 123, no. 1-3, pp.487-512, 2002.
    • (2002) Discrete Applied Mathematics , vol.123 , Issue.1-3 , pp. 487-512
    • Toth, P.1    Vigo, D.2
  • 5
    • 0000208259 scopus 로고    scopus 로고
    • A set-partitioning-based heuristic for the VSP
    • James, P. K. and J. F. Xu, A set-partitioning-based heuristic for the VSP, Journal on Computing, vol.ll, no.2, pp.161-172, 1999.
    • (1999) Journal on Computing , vol.100 , Issue.2 , pp. 161-172
    • James, P.K.1    Xu, J.F.2
  • 6
    • 0001574219 scopus 로고
    • A location based heuristic for general routing problems
    • Bramel, J. B. and D. Simchi-levi, A location based heuristic for general routing problems, Operations Research, vol.43, no.4, pp.649-660, 1995.
    • (1995) Operations Research , vol.43 , Issue.4 , pp. 649-660
    • Bramel, J.B.1    Simchi-levi, D.2
  • 7
    • 0036680973 scopus 로고    scopus 로고
    • A sweep-based algorithm for the fleet size and mix vehicle routing problem
    • Renaud, J. and F. F. Boctor, A sweep-based algorithm for the fleet size and mix vehicle routing problem, European Journal of Operational Research, vol. 140, no.8, pp.618-628, 2002.
    • (2002) European Journal of Operational Research , vol.140 , Issue.8 , pp. 618-628
    • Renaud, J.1    Boctor, F.F.2
  • 8
    • 0039780231 scopus 로고
    • Multi-terminal vehicle-dispatch algorithm
    • Gillett, B. E. and J. G. Johnson, Multi-terminal vehicle-dispatch algorithm, Omega, vol.4, no.6, pp.711-718, 1976.
    • (1976) Omega , vol.4 , Issue.6 , pp. 711-718
    • Gillett, B.E.1    Johnson, J.G.2
  • 9
    • 0026880159 scopus 로고
    • The traveling salesman problem: An overview of exact and approximate algorithms
    • Laporte, G., The traveling salesman problem: An overview of exact and approximate algorithms, European Journal of Operational Research, vol.59, pp.231-247, 1992.
    • (1992) European Journal of Operational Research , vol.59 , pp. 231-247
    • Laporte, G.1
  • 10
    • 0242490107 scopus 로고    scopus 로고
    • A decision support system for a real vehicle routing problem
    • Ruiz, R., C. Maroto and J. Alcaraz, A decision support system for a real vehicle routing problem, European Journal of Operational Research, vol. 153, no.3, pp.593-606, 2004.
    • (2004) European Journal of Operational Research , vol.153 , Issue.3 , pp. 593-606
    • Ruiz, R.1    Maroto, C.2    Alcaraz, J.3
  • 12
    • 0036027960 scopus 로고    scopus 로고
    • Local search heuristics for three-stage flow shop problems with secondary criterion
    • Gupta, J. N. D., K. Hennig and F. Werner, Local search heuristics for three-stage flow shop problems with secondary criterion, Computers & Operations Research, vol.29, no.2, pp.123-149, 2002.
    • (2002) Computers & Operations Research , vol.29 , Issue.2 , pp. 123-149
    • Gupta, J.N.D.1    Hennig, K.2    Werner, F.3
  • 14
    • 23344441137 scopus 로고    scopus 로고
    • A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
    • Montané, F. A. T. and R. D. Galvao, A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service, Computers & Operations Research, vol.33, no.3, pp.595-619, 2006.
    • (2006) Computers & Operations Research , vol.33 , Issue.3 , pp. 595-619
    • Montané, F.A.T.1    Galvao, R.D.2
  • 15
    • 0042097737 scopus 로고    scopus 로고
    • Efficient representation of state spaces for some dynamic models
    • Gowrisankaran, G., Efficient representation of state spaces for some dynamic models, Journal of Economic Dynamics & Control, vol.23, no.8, pp.1077-1098, 1999.
    • (1999) Journal of Economic Dynamics & Control , vol.23 , Issue.8 , pp. 1077-1098
    • Gowrisankaran, G.1
  • 16
    • 38149067257 scopus 로고    scopus 로고
    • Intelligent operations research and real-time optimal control for dynamic systems
    • Hu, X. P., Z. C. Xu and D. L. Yang, Intelligent operations research and real-time optimal control for dynamic systems, Journal of Management Sciences in China, vol.5, no.4, pp.13-21, 2002.
    • (2002) Journal of Management Sciences in China , vol.5 , Issue.4 , pp. 13-21
    • Hu, X.P.1    Xu, Z.C.2    Yang, D.L.3
  • 18
    • 2942671024 scopus 로고    scopus 로고
    • LINDO System Inc
    • LINDO System Inc., LINDO API User's Manual, http://www.lindo.com.
    • LINDO API User's Manual
  • 19
    • 0034139994 scopus 로고    scopus 로고
    • A probabilistic dynamic Technique for the distributed generation of very large state spaces
    • Knottenbelt, W. J., P. G. Harrison, M. A. Mestern and P. S. Kritzinger, A probabilistic dynamic Technique for the distributed generation of very large state spaces, Performance Evaluation, vol.39, nos.1-4, pp.127-148, 2000.
    • (2000) Performance Evaluation , vol.39 , Issue.1-4 , pp. 127-148
    • Knottenbelt, W.J.1    Harrison, P.G.2    Mestern, M.A.3    Kritzinger, P.S.4
  • 21
    • 0346009088 scopus 로고    scopus 로고
    • D-ants: Savings based ants divide and conquer the vehicle routing problem
    • Reimann, M., K. Doerner and R. F. Hartl, D-ants: Savings based ants divide and conquer the vehicle routing problem, Computers & Operations Research, vol.31, no.4, pp.563-91, 2004.
    • (2004) Computers & Operations Research , vol.31 , Issue.4 , pp. 563-591
    • Reimann, M.1    Doerner, K.2    Hartl, R.F.3
  • 22
    • 12244261649 scopus 로고    scopus 로고
    • Solving the vehicle routing problem with adaptive memory programming methodology
    • Tarantilis, C. D., Solving the vehicle routing problem with adaptive memory programming methodology, Computers & Operations Research, vol.32, no.9, pp.2309-2327, 2005.
    • (2005) Computers & Operations Research , vol.32 , Issue.9 , pp. 2309-2327
    • Tarantilis, C.D.1
  • 23
    • 30744464123 scopus 로고    scopus 로고
    • Implementing and testing the tabu cycle and conditional probability methods
    • Laguna, M., Implementing and testing the tabu cycle and conditional probability methods, Computers and Operations Research, vol.33, no.9, pp.2495-2507, 2006.
    • (2006) Computers and Operations Research , vol.33 , Issue.9 , pp. 2495-2507
    • Laguna, M.1


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