skip to main content
Idioma:
Primo Search
Clear Search Box
Search in: Busca Geral
Busca Avançada
Busca por Índices
Tipo de recurso Mostra resultados com: Mostra resultados com: Índice

Heuristics for the multi-vehicle covering tour problem

Hachicha, Mondher ; John Hodgson, M ; Laporte, Gilbert ; Semet, Frédéric

Computers & operations research, 2000, Vol.27 (1), p.29-42 [Periódico revisado por pares]

New York: Elsevier Ltd

Texto completo disponível

Citações Citado por
  • Título:
    Heuristics for the multi-vehicle covering tour problem
  • Autor: Hachicha, Mondher ; John Hodgson, M ; Laporte, Gilbert ; Semet, Frédéric
  • Assuntos: Algorithms ; Covering tour ; Heuristic ; Linear programming ; Operations research ; Route-first/cluster-second ; Routes ; Savings algorithm ; Studies ; Sweep algorithm ; Theory ; Vehicle routing ; Vehicles
  • É parte de: Computers & operations research, 2000, Vol.27 (1), p.29-42
  • Descrição: The multi-vehicle covering tour problem is defined on a graph G=(V∪W, E) , where W is a set of vertices that must collectively be covered by up to m vehicles. The problem consists of determining a set of total minimum length vehicle routes on a subset of V, subject to side constraints, such that every vertex of W is within a prespecified distance from a route. Three heuristics are developed for this problem and tested on randomly generated and real data. Scope and purpose In the problem considered in this article, we are given two sets of locations. The first set, V, consists of potential locations at which some vehicles may stop, and the second set, W are locations not actually on vehicle routes, but within an acceptable distance of a vehicle route. The problem is to construct several vehicle routes through a subset of V, all starting and ending at the same locations, subject to some side constraints, having a total minimum length, and such that every location of W is within a reasonable distance of a route. A common application of this problem arises in the delivery of health care facilities by mobile units in developing countries. Here, vehicles travel through a limited number of villages, and every location that is not visited must be within walking distance of a visited location. This article proposes three heuristics capable of solving instances of realistic size within reasonable computing times.
  • Editor: New York: Elsevier Ltd
  • Idioma: Inglês
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.