메뉴 건너뛰기




Volumn 4, Issue , 2005, Pages 3338-3343

A two-phase hybrid heuristic search approach to the location-routing problem

Author keywords

Decomposition; Heuristic; Hybrid; Location routing problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DECISION MAKING; DECOMPOSITION; INTEGRATION; PROBLEM SOLVING; ROUTERS;

EID: 27944457133     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (20)

References (15)
  • 1
  • 2
    • 0006218834 scopus 로고
    • Cost function in the location of depots for multi-delivery journeys
    • Webb MH., "Cost function in the location of depots for multi-delivery journeys", Operations Research Quarterly, 19, 311-328, 1968.
    • (1968) Operations Research Quarterly , vol.19 , pp. 311-328
    • Webb, M.H.1
  • 3
    • 0032689016 scopus 로고    scopus 로고
    • A two-phase tabu search approach to the location routing problem
    • Tuzun D., Burke. L, "A two-phase tabu search approach to the location routing problem", European Journal of Operational Research, 116, 87-99, 1999.
    • (1999) European Journal of Operational Research , vol.116 , pp. 87-99
    • Tuzun, D.1    Burke, L.2
  • 4
    • 0036722144 scopus 로고    scopus 로고
    • Heuristic solutions to multi-depot location-routing problem
    • Wu T.H., Low C., Bai J.W., "Heuristic solutions to multi-depot location-routing problem", Computers & Operations Research 29, 1393-1415, 2002.
    • (2002) Computers & Operations Research , vol.29 , pp. 1393-1415
    • Wu, T.H.1    Low, C.2    Bai, J.W.3
  • 5
    • 0024067262 scopus 로고
    • Solving a family of multi-depot vehicle routing and location routing problems
    • Laporte G., Nobert Y., Taillefer S., "Solving a family of multi-depot vehicle routing and location routing problems", Transportation Science,22, 172, 1988.
    • (1988) Transportation Science , vol.22 , pp. 172
    • Laporte, G.1    Nobert, Y.2    Taillefer, S.3
  • 6
    • 0024962821 scopus 로고
    • Models and exact solutions for a class of stochastic location routing problems
    • Laport G., Louveaux F., Mercure H., "Models and exact solutions for a class of stochastic location routing problems", European Journal of Operational Research, 39, 71-78, 1989.
    • (1989) European Journal of Operational Research , vol.39 , pp. 71-78
    • Laport, G.1    Louveaux, F.2    Mercure, H.3
  • 8
    • 21344485247 scopus 로고
    • Heuristic procedures for the practical-sized uncapacitated location-capacitated routing problems
    • Chien, W.T., "Heuristic procedures for the practical-sized uncapacitated location-capacitated routing problems", Decision Sciences, 24, 995-1021, 1993.
    • (1993) Decision Sciences , vol.24 , pp. 995-1021
    • Chien, W.T.1
  • 9
    • 0030244403 scopus 로고    scopus 로고
    • Nested heuristic methods for the location-routing problem
    • Nagy G., Salhi S., "Nested heuristic methods for the location-routing problem", Journal of Operational Research Society, 47, 1184-1174, 1996.
    • (1996) Journal of Operational Research Society , vol.47 , pp. 1184-11174
    • Nagy, G.1    Salhi, S.2
  • 10
    • 0022267384 scopus 로고
    • A warehouse location-routing problem
    • Perl J., Daskin, M., "A warehouse location-routing problem", Transportation Research, 19B (5), 381-396, 1985.
    • (1985) Transportation Research , vol.19 B , Issue.5 , pp. 381-396
    • Perl, J.1    Daskin, M.2
  • 11
    • 0000419596 scopus 로고
    • Scheduling of vehicle from a central depot to a number of delivery points
    • Clarke G., Wright J., "Scheduling of vehicle from a central depot to a number of delivery points", Operations Research 12,568-581, 1964.
    • (1964) Operations Research , vol.12 , pp. 568-581
    • Clarke, G.1    Wright, J.2
  • 12
    • 84908780328 scopus 로고
    • Computer solutions of the TSP
    • Lin S., "Computer solutions of the TSP', Bell Systems Technical Journal, 44,2245-2269, 1965
    • (1965) Bell Systems Technical Journal , vol.44 , pp. 2245-2269
    • Lin, S.1
  • 13
    • 0346009088 scopus 로고    scopus 로고
    • D-Ants: Saving based Ants divide and conquer the vehicle routing problem
    • Reimann M., Doerner K., "D-Ants: Saving based Ants divide and conquer the vehicle routing problem", Computer & Operations Research 31, 563-591, 2004.
    • (2004) Computer & Operations Research , vol.31 , pp. 563-591
    • Reimann, M.1    Doerner, K.2


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