skip to main content
Visitante
Meu Espaço
Minha Conta
Sair
Identificação
This feature requires javascript
Tags
Revistas Eletrônicas (eJournals)
Livros Eletrônicos (eBooks)
Bases de Dados
Bibliotecas USP
Ajuda
Ajuda
Idioma:
Inglês
Espanhol
Português
This feature required javascript
This feature requires javascript
Primo Search
Busca Geral
Busca Geral
Acervo Físico
Acervo Físico
Produção Intelectual da USP
Produção USP
Search For:
Clear Search Box
Search in:
Busca Geral
Or hit Enter to replace search target
Or select another collection:
Search in:
Busca Geral
Busca Avançada
Busca por Índices
This feature requires javascript
This feature requires javascript
Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows
Chen, Zhi-Long ; Xu, Hang
Transportation science, 2006-02, Vol.40 (1), p.74-88
[Periódico revisado por pares]
Linthicum, MD: INFORMS
Texto completo disponível
Citações
Citado por
Exibir Online
Detalhes
Resenhas & Tags
Mais Opções
Nº de Citações
This feature requires javascript
Enviar para
Adicionar ao Meu Espaço
Remover do Meu Espaço
E-mail (máximo 30 registros por vez)
Imprimir
Link permanente
Referência
EasyBib
EndNote
RefWorks
del.icio.us
Exportar RIS
Exportar BibTeX
This feature requires javascript
Título:
Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows
Autor:
Chen, Zhi-Long
;
Xu, Hang
Assuntos:
Algorithms
;
Applied sciences
;
column generation
;
Distribution
;
dynamic vehicle routing
;
Exact sciences and technology
;
Fleet management
;
Ground, air and sea transportation, marine construction
;
Heuristic
;
Heuristics
;
Logistics
;
Mathematical models
;
Motor vehicle fleets
;
New order
;
Optimization
;
Planning
;
Planning methods
;
Road transport
;
Routes
;
Studies
;
Time
;
Time windows
;
Transportation
;
Transportation planning, management and economics
;
Travel time
;
Truck routes
;
Vehicle capacity
;
Vehicle routing
;
Vehicles
É parte de:
Transportation science, 2006-02, Vol.40 (1), p.74-88
Notas:
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
Descrição:
We consider a dynamic vehicle routing problem with hard time windows, in which a set of customer orders arrives randomly over time to be picked up within their time windows. The dispatcher does not have any deterministic or probabilistic information on the location and size of a customer order until it arrives. The objective is to minimize the sum of the total distance of the routes used to cover all the orders. We propose a column-generation-based dynamic approach for the problem. The approach generates single-vehicle trips (i.e., columns) over time in a real-time fashion by utilizing existing columns, and solves at each decision epoch a set-partitioning-type formulation of the static problem consisting of the columns generated up to this time point. We evaluate the performance of our approach by comparing it to an insertion-based heuristic and an approach similar to ours, but without computational time limit for handling the static problem at each decision epoch. Computational results on various test problems generalized from a set of static benchmark problems in the literature show that our approach outperforms the insertion-based heuristic on most test problems.
Editor:
Linthicum, MD: INFORMS
Idioma:
Inglês
Links
View record in Pascal Francis
This feature requires javascript
This feature requires javascript
Voltar para lista de resultados
This feature requires javascript
This feature requires javascript
Buscando em bases de dados remotas. Favor aguardar.
Buscando por
em
scope:(USP_VIDEOS),scope:("PRIMO"),scope:(USP_FISICO),scope:(USP_EREVISTAS),scope:(USP),scope:(USP_EBOOKS),scope:(USP_PRODUCAO),primo_central_multiple_fe
Mostrar o que foi encontrado até o momento
This feature requires javascript
This feature requires javascript