Buscar
Mostrando ítems 11-20 de 336
A model for solving the dynamic vehicle dispatching problem with customer uncertainty and time dependent link travel time
(Facultad de Ingeniería, Universidad de Antioquia, 2012)
In a real world case scenario, customer demands are requested at any time of the day requiring services that are not known in advance such as delivery or repairing equipment. This is called Dynamic Vehicle Routing (DVR) ...
A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
(SpringerALIADO - Analítica e Investigación para la Toma de DecisionesBerlín, Alemania, 2023)
A flexible and adaptive hyper-heuristic approach for (dynamic) capacitated vehicle routing problems
(PANSTWOWE WYDAWNICTWO NAUKOWE, 2012)
Using a hybrid heuristic to solve the balanced vehicle routing problem with loading constraintsUso de una heurística híbrida para resolver el problema de enrutamiento equilibrado de vehículos con restricciones de carga
(International Journal of Industrial Engineering Computations, 2020)
The Vehicle Routing Problem with Loading Constraints (VRPLC) is strongly related to real life applications in distribution logistics. It addresses the simultaneous loading and routing of vehicles, which are two crucial ...
Algoritmos para o problema de roteamento de veículos com coleta e entrega simultâneas
(Universidade Federal de Minas GeraisUFMG, 2007-07-13)
In this work we deal with the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). This is a basic problem of the reverse logistic, defined as: Given a transportation network with $n$ customers and one ...
A logistic case, the capacited vehicle routing problemUn problema logístico de programación de vehículos con capacidad finita
(Pereira : Universidad Tecnológica de PereiraFacultad de Ciencias Básicas, 2011)
Uma abordagem heurística para o problema de roteamento de veículos com designação de entregadores extras
(Universidade Federal de São CarlosBRUFSCarPrograma de Pós-Graduação em Engenharia de Produção - PPGEP, 2010-12-15)
The pursuit of excellence in customer service drives companies to investigate strategies that help to produce satisfactory solutions to the market, as is the case of beverage companies. One of the obstacles faced by this ...
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 ...