Examinando por Materia "Vehicle routing"

Mostrando 1 - 5 de 5
  • No hay miniatura disponible
    Ítem
    Cumulated capacitated vehicle routing problem with indirect deliveries : mathematical formulation and hybrid solution approach
    (Universidad EAFIT, 2020) Giraldo López, Jenny Marcela; Rivera Agudelo, Juan Caralos; Rivera Agudelo, Juan Carlos
  • No hay miniatura disponible
    Ítem
    A Mixed-Integer Linear Programming Model for a Selective Vehicle Routing Problem
    (Springer Verlag, 2018-01-01) Posada A.; Rivera J.C.; Palacio J.D.; Posada A.; Rivera J.C.; Palacio J.D.; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
    In this paper, we propose a new vehicle routing problem variant. The new problem is a type of selective vehicle routing model in which it is not necessary to visit all nodes, but to visit enough nodes in such a way that all clusters are visited and from which it is possible to cover all nodes. Here, a mixed-integer linear programming formulation (MILP) is proposed in order to model the problem. The MILP is tested by using adapted instances from the generalized vehicle routing problem (GVRP). The model is also tested on small size GVRP instances as a special case of our proposed model. The results allow to evaluate the impact of clusters configuration in solver efficacy. © 2018, Springer Nature Switzerland AG.
  • No hay miniatura disponible
    Ítem
    A Mixed-Integer Linear Programming Model for a Selective Vehicle Routing Problem
    (Springer Verlag, 2018-01-01) Posada A.; Rivera J.C.; Palacio J.D.; Posada A.; Rivera J.C.; Palacio J.D.; Universidad EAFIT. Departamento de Ciencias; Modelado Matemático
    In this paper, we propose a new vehicle routing problem variant. The new problem is a type of selective vehicle routing model in which it is not necessary to visit all nodes, but to visit enough nodes in such a way that all clusters are visited and from which it is possible to cover all nodes. Here, a mixed-integer linear programming formulation (MILP) is proposed in order to model the problem. The MILP is tested by using adapted instances from the generalized vehicle routing problem (GVRP). The model is also tested on small size GVRP instances as a special case of our proposed model. The results allow to evaluate the impact of clusters configuration in solver efficacy. © 2018, Springer Nature Switzerland AG.
  • No hay miniatura disponible
    Ítem
    Rutas seguras de transporte de residuos hospitalarios en Medellín
    (Universidad EAFIT, 2022) Urcuqui Henao, Ana Cristina; Valencia Díaz, Édison
  • No hay miniatura disponible
    Ítem
    Solving the assignment of customers to trucks and visit days in a periodic routing real-world case1
    (Pontificia Universidad Javeriana, 2018-01-01) Duque Correa A.F.; Baldoquín de la Peña M.G.; Duque Correa A.F.; Baldoquín de la Peña M.G.; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
    Introduction: This work proposes a model and two heuristic algorithms to assign customers to trucks and visit days as a first phase in the solution of a real-world routing problem, which is closely related to the PVRP (Periodic Vehicle Routing Problem), but a strategic decision of the company imposes the additional constraint that every customer must always be visited by the same truck. Methods: The proposed model will group the customers that are visited the same day by the same truck as close as possible by means of centroid-based clustering. The first proposed heuristic has a constructive stage and three underlying improvement heuristics, while the second uses an exact linear programming algorithm. Results: The algorithms are evaluated by instances taken from the literature and generated, taking into account the characteristics presented in the real-world case. © 2018, Pontificia Universidad Javeriana. All rights reserved.