메뉴 건너뛰기




Volumn 1, Issue , 2004, Pages 7-12

Computational intelligence approach to real-world cooperative vehicle dispatching problem

Author keywords

Computational Intelligence; Cooperative deliveries; Vehicle Dispatching Problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; REAL TIME SYSTEMS; VEHICLES;

EID: 8844221407     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (7)

References (11)
  • 2
    • 0000727113 scopus 로고
    • Routing problems: A bibliography
    • G. Laporte and I.H. Osman, "Routing Problems: A bibliography", Ann. Oper. Res., vol.61, pp.227-262, 1995.
    • (1995) Ann. Oper. Res. , vol.61 , pp. 227-262
    • Laporte, G.1    Osman, I.H.2
  • 3
    • 0006554462 scopus 로고
    • A 3-opt based simulated annealing algorithm for the vehicle routing problem
    • A.S. Alfa, S.S. Heragu, and M. Chen, "A 3-opt based simulated annealing algorithm for the vehicle routing problem", Comp. Ind. Eng., vol.21, pp.635, 1991.
    • (1991) Comp. Ind. Eng. , vol.21 , pp. 635
    • Alfa, A.S.1    Heragu, S.S.2    Chen, M.3
  • 4
    • 21144460138 scopus 로고
    • Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
    • I.H. Osman, "Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem", Ann.Oper.Res., vol.41,pp.421-451, 1993.
    • (1993) Ann.Oper.Res. , vol.41 , pp. 421-451
    • Osman, I.H.1
  • 5
    • 0000922749 scopus 로고    scopus 로고
    • The vehicle routing problem with time window -part1: Tabu search
    • J.Y. Potvin, T. Kervahut, B.L. Gacia, and J.M. Rousseau, "The vehicle routing problem with time window -part1: Tabu Search", ORSAJ. Comp., vol.8, pp.158-164, 1996.
    • (1996) ORSAJ. Comp. , vol.8 , pp. 158-164
    • Potvin, J.Y.1    Kervahut, T.2    Gacia, B.L.3    Rousseau, J.M.4
  • 6
    • 0031139685 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with soft time windows
    • E. Taillard, P. Badeau, "A tabu search heuristic for the vehicle routing problem with soft time windows", Transportation Science, vol.31, pp. 170-186, 1997.
    • (1997) Transportation Science , vol.31 , pp. 170-186
    • Taillard, E.1    Badeau, P.2
  • 8
    • 85040491885 scopus 로고    scopus 로고
    • Genetic algorithms for vehicle dispatching
    • F. Leclerc and J.Y. Potvin, "Genetic algorithms for vehicle dispatching", Int. Trans. Opl. Res., vol.4-5/6, pp.391-400, 1997.
    • (1997) Int. Trans. Opl. Res. , vol.4-6 , pp. 391-400
    • Leclerc, F.1    Potvin, J.Y.2
  • 9
    • 8844266718 scopus 로고    scopus 로고
    • A study to a synthetic solution for vehicle routing, scheduling, & dispatching problem with single depot
    • Tsukuba, Japan
    • K. Chen, Y. Takama, and K. Hirota, "A study to a synthetic solution for vehicle routing, scheduling, & dispatching problem with single depot," The Fourth Asian Fuzzy Systems Symposium, Tsukuba, Japan, pp.487-492, 2000.
    • (2000) The Fourth Asian Fuzzy Systems Symposium , pp. 487-492
    • Chen, K.1    Takama, Y.2    Hirota, K.3
  • 11
    • 43949164756 scopus 로고
    • Simulated annealing: Practice versus theory
    • L. Ingber, "Simulated Annealing: Practice versus Theory," Mathl. Comput. Modelling, vol. 18-11, pp.29-57, 1993.
    • (1993) Mathl. Comput. Modelling , vol.18 , Issue.11 , pp. 29-57
    • Ingber, L.1


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