... the vehiclerouting problem with environmental penalty, allowing to diminish the environmental impact in highly concurred areas, while providing alternative routes that minimize the associated costs of ...
... The VehicleRouting Problem (VRP) [10] consists in delivering goods to a set of customers with known demands through minimum cost vehicle routes, beginning and finishing at the ...
... Dependent VehicleRouting Problem (SDVRP) extends the classical VRP by incor- porating compatibility dependencies among customers and vehicle ...several vehicle types, each of them with ...
... anisotropic vehicle velocity restrictions for building the cost matrix required for multi-vehiclerouting on natural terrain and disaster ...multi-vehiclerouting, but on the ...
... In the last decades, the well-known problem of vehiclerouting has derived into a number of different variants. One of these variants is the VehicleRouting Problem with Time Windows. It is in ...
... The family of VRP models and his study is extensive. The most study model in their taxonomy is the capacitated vehiclerouting problem CVRP; the time windows restrictions form a generalisation of this model ...
... Electrical vehiclerouting problems (EVRP) are related to distribution logistics and difficulties in collection involving a series of customers with certain demands that must be entirely satisfied with ...
... the vehiclerouting-allocation problem (VRAP), introduced by Beasley & Nascimento ...the routing costs for the customers visited and the assignment costs and penalties for those not on the ...
... Todos los días se entregan productos en diferentes puntos de una ciudad, teniendo como referencia un origen que es el punto de distribución. Uno de los objetivos de los distribuidores es determinar el número de vehículos ...
... and routing problem(OBRP) regarding heterogeneous vehiclerouting problem (HVRP), in order to identify whether there are any differences and similarities between these ...the Vehicle ...
... The Symmetric Problems are structured as follows. Chapter 1 describes the Traveling Salesman Problem. It includes a description of its variants and applications, in addition to a review of the state of the art on TSP. It ...
... of vehicle—in order to solve the heterogeneous version of the ...of vehicle are se- lected following some specific ...of vehicle (each type of vehicle has a different capacity) to be used in ...
... III new ILP-based refinement heuristic for VehicleRouting Problems. They considerate the DCVRP, where k minimum-cost routes through a central depot have to be constructed so as to cover all customers while ...
... The CVRP has been selected mainly because there are huge amounts of models, techniques, benchmarks, and research on this topic. Hence, the proposed methodology can be easily compared —in terms of computational efficiency ...
... of vehiclerouting problems in ...Capacitated VehicleRouting Problem with Time Windows (CVRPTW) to collect different cargo-demand with mixed vehicle-fleet The CVRPTW is solved using ...
... Authors of [44] worked on the home health care routing and scheduling problem. The problem was treated as a vehiclerouting problem with time windows (VRPTW) and multi-depots. Although the ...
... (Multi-Depot VehicleRouting Problem, MDVRP) busca satisfacer la demanda de todos los clientes minimizando el costo total de las rutas que parten de distintos depósitos para entregar los productos a los ...
... Juan, AA.; Faulin, J.; Grasman, S; et al. (2011) Using safety stocks and simulation to solve the vehiclerouting problem with stochastic demands. A Conference Information: 4th International Workshop on ...
... Time constrained sequencing and routing problems arise in many practical applications. Typically, computational difficult for those type of problems has been measured in terms of its size. However the difficult ...
... homogeneous vehicle fleet of size m with known capacity that have to serve the customers that are located in a certain geographical ...single vehicle, and (iii) the total demand of a route does not exceed ...