Buscar
Mostrando ítems 21-30 de 336
The open capacitated arc routing problem
(Pergamon-Elsevier B.V. Ltd, 2011-11-01)
The Open Capacitated Arc Routing Problem (OCARP) is a NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours that services a subset of edges with ...
A Cluster-based Optimization Approach for the Multi-depot Heterogeneous Fleet Vehicle Routing Problem with Time Windows
(Elsevier Science, 2007-12)
This paper presents a novel three-phase heuristic/algorithmic approach for the multi-depot routing problem with time windows and heterogeneous vehicles. It has been derived from embedding a heuristic-based clustering ...
Roteamento dinâmico de veículos: análise do impacto em atividades de prestação de serviço
(Universidade Federal de São CarlosBRUFSCarPrograma de Pós-Graduação em Engenharia de Produção - PPGEP, 2008-12-15)
In recent years, several studies have been revising static distribution models used by companies in order to incorporate intrinsic dynamic features of transport operations. Thanks to new technologies such as global positioning ...
The open capacitated arc routing problem
(Pergamon-elsevier Science LtdOxfordInglaterra, 2011)
Combining Heuristics with Simulation and Fuzzy Logic to Solve a Flexible-Size Location Routing Problem under UncertaintyCombinación de heurística con simulación y lógica difusa para resolver un problema de enrutamiento de ubicación de tamaño flexible bajo incertidumbre
(Algorithms, 15/12/2020)
The location routing problem integrates both a facility location and a vehicle routing problem. Each of these problems are NP-hard in nature, which justifies the use of heuristic-based algorithms when dealing with large-scale ...
Integrating packing and distribution problems and optimization through mathematical programming
(Growing Science, 2016-10)
This paper analyzes the integration of two combinatorial problems that frequently arise in production and distribution systems. One is the Bin Packing Problem (BPP) problem, which involves finding an ordering of some objects ...
Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique
(Revista Computación y Sistemas; Vol. 13 No.3, 2010-02-18)
Abstract. In this paper a Memetic Algorithm (MA) is proposed for solving the Vehicles Routing Problem with Time Win-dows (VRPTW) multi-objective, using a constraint satisfaction heuristic that allows pruning of the search ...
Propuesta para la implementación de un modelo de ruteo de buses escolares para la comunidad agustiniana de la jornada nocturna de la Uniagustiniana.
The mobility of the students of the night shift from the Uniagustiniana to their homes is affected due to the low frequency of the public transport system, which causes prolonged times in waiting for a bus that carried out ...
Método heurístico para el problema de ruteo de vehículos aplicado a la empresa distribuidora Representaciones Continental
(Universidad de La Salle. Ediciones Unisalle, 15 d)