[PDF] Top 20 Automated tuning of an algorithm for the vehicle routing problem

... We introduced several modifications to SMAC in Section 5.3.5 that might make the tuning method perform better in our case. We were not yet able to identify the most promising modification. To our knowledge, the ... See full document

... The vehicle routing problem with intermediate stops (VRPIS) was introduced by Schneider et ...electric vehicle routing problem with time windows and recharging stations ...VNS/TS ... See full document

... Abstract— Vehicle Routing problem (VRP) is the challenging and sophisticated optimization problem which can be solved by various approaches like Exact methods, meta- heuristic optimization ... See full document

... the vehicle routing problem has been widely studied since the first formulation was applied to fuel distribution by Dantzig and Ramser (1959), the version involving multiple deposits and different ... See full document

... The vehicle routing problem is a well-known optimization issue in transportation and logistics network ...The vehicle routing problem with split deliveries and pickups is ... See full document

... constructive routing algorithm for fleet size and mix vehicle routing problem is proposed in which residual costs rather than vehicle types are considered for route ...The ... See full document

... Colony algorithm has proved to be useful in various fields of problems such as assignment problems, scheduling problems, solving transportation problems ...Colony algorithm to solve vehicle ... See full document

... The Vehicle Routing Problem with Backhauls (VRPB) is an extension of the classical Vehicle Routing Problem (VRP) that includes both a set of customers to whom products are to be ... See full document

... search algorithm (HS) to solve the capacitated vehicle routing problem (CVRP) which is the first variant of the well-known vehicle routing problem introduced by Dantzing ... See full document

... the Vehicle Routing Problem (VRP) in terms of their objectives, their characteristics and the types of proposed algorithms to solve ...portfolio problem was introduced by Doerner et ...the ... See full document

... the Vehicle Routing Problem (VRP) using evolutionary algorithms [5] [8] ...optimization problem that belongs to the NP-complete ...the problem, it is not possible to use the exact ... See full document

... the vehicle routing problem with split pick-ups with an uncountable (infinite) number of state and action ...the problem with undirected arcs by assuming symmetric ...cutting-plane ... See full document

... single vehicle: Iterated Local Search, Tabu Search, Simulated Annealing, Ant Colony Optimization and Evolutionary Algorithm (Genetic Algorithm) that found better solution quality in respect to cyclic ... See full document

... optimization algorithm on a num­ ber of test problems from the ...of Vehicle Routing Problem ( VRP ) instances from various sources, with the demand given in these problems being used as the ... See full document

... genetic algorithm (GA) to the basic vehicle routing problem with tow-dimensional loading constraints ...(2L-CVRP). Vehicle routing problem encompasses a whole class of ... See full document

... The vehicle routing problem (VRP) has been an important research topic during the last decades because of his vital role in the productive systems ...the problem when limited vehicle ... See full document

... related problem also frequently seen in practice and studied is the ...branch-and-cut algorithm into a Monte Carlo solution approach to solve large-sized problems ... See full document

... optimization problem otherwise known as Vehicle Routing Problem (VRP) and the issue is solved by using the nearest neighbor heuristic ...the algorithm and simulate the ... See full document

... the vehicle routing problem with dynamic ...Salesman Problem embedded in the ...Capacitated Vehicle Routing Problem (CVRP) within an acceptable time frame while offering ... See full document

... The Vehicle Routing Problem with Time Windows (VRPTW) consists of constructing least cost routes from a depot to a set of geographically scattered service points and back to the depot, satisfying ... See full document