[PDF] Top 20 Contributions to the single and multiple vehicle routing problem with deliveries and selective pickup

... In the Single Vehicle Routing Problem with Deliveries and Selective Pickups (SVR- PDSP) there are a set of customers to be served and a depot ... See full document

... algorithm. The first objective is to minimize the total number of vehicles used, and the second, to minimize the total cost, which is the weighted sum of the ... See full document

... studies the implementation of heuristics and scatter search (SS) metaheuristic in a real heterogeneous fleet vehicle routing problem with time windows and split ... See full document

... alent to solving multiple TSP problems at once [96]. Due to the difficulty of this problem (NP-hard) and because of its many industrial applications, it has been largely studied ... See full document

... of the classical VRP, called the open vehicle routing problem (OVRP), attracted the attention of practitioners and ...required to return to the depot ... See full document

... is the conVRP. This optimization problem demands the definition of vehicle routes for several periods, maintaining a certain level of consistency on pre-selected ...for the ... See full document

... Su¨ral and Bookbinder [30] are the first to directly address this ...present the problem using the notation α/β/γ, where α denotes the number of ve- hicles (1 for ... See full document

... numerical and experimental study of the aerodynamics of a generic pickup was ...on the dimensions of the most representative models of the light pickup fleet in ...edges ... See full document

... presented the vehicle routing optimization system developed to be integrated with an existing ...ERP. The optimization procedure takes into consideration the need for a ... See full document

... Rochat and Taillard22 have developed an adaptive memory mechanism for the capacity and route duration constrained VRP and for the VRP with time windows, based on the earlier [r] ... See full document

... solutions to the problem, we can use the route improvement strategies in the ...involves the inclusion of a local exchange procedure to act as an improvement heuristic ... See full document

... all the artificial ants have improved the solutions through the heuristics, the pheromone trails will be ...is the main feature of an ACO algorithm which assists at improving future ... See full document

... in the sequence {15,16, … , 25} should be transferred to another vehicle ...Then, the vehicle agent starts to examine which one of the 11 remaining tasks should be ...due ... See full document

... geograficamente dispersas, encontrar o melhor conjunto de rotas para atender todos os. clientes[r] ... See full document

... stable and saturates carbon in the liquid solution. The degree of bath saturation is dependent on the amount of vanadium ...way, with the appropriate addition of vanadium, all ... See full document

... inglês Vehicle Routing Problem with Time Windows) é uma extensão do CVRP onde cada cliente deve ter seu atendimento iniciado em uma janela de tempo e o veículo associado deve atendê-lo durante ... See full document

... in the temperature of 7 C less, than in cast iron with 0,50% Cu, but it is still higher than in cast iron with ...decreased and pearlite disap- peared in cast iron metal matrix ... See full document

... inefficient. The reason is that there is no a priori bound about the number of times a given station is going to be visited by a same ...in the case when K = 1 (α very large), v(x) values are ... See full document

... decomposable problem (Engelbrecht, 2007). Accordingly, the true fitness of an individual can only be obtained from its interaction with other individuals from the same or other ...well ... See full document

... No processo de distribuição é necessário fazer a entrega de bens e serviços para clientes dispersos geograficamente, nesse processo encontra-se o Vehicle Routing Problem (VRP). O VRP, ou Problema de ... See full document