Vehicle Routing problem (VRP) is the challenging and sophisticated optimization problem which can be solved by various approaches like Exact methods, metaheuristic optimization algorithm and Mathematical approaches including linear and integer programming Techniques. Exact algorithms can only solve relatively small problems of VRP. Several approximate algorithms have proven successfully to find...

Recent years, spatial data and observed data, such as digital road map, traffic route, vehicle speed, recordings events and others, are integrated and stored into the spatial temporal database systems. Various location-based services by using mobile phone are also becoming popular. In this paper, we focus on one of GIS-based scheduling applications concerning the availability of GPS technologie...

We propose a heuristic for a class of vehicle routing problems (VRPs) with minmax objective. These include the Capacitated VRP, the Capacitated VRP with multiple use of vehicles, and the Traveling Salesman Problem with multiple use of vehicles. A tabu search based adaptive memory procedure of instances indicate that the method produces very good solutions within reasonable computing times.

Many real-world optimization problems today are multi-objective multi-constraint generalizations of NP-hard problems. A classic case we study in this paper is the Inventory Routing Problem with Time Windows (IRPTW). IRPTW considers inventory costs across multiple instances of Vehicle Routing Problem with Time Windows (VRPTW). The latter is in turn extended with time-windows constraints from the...

Vehicle-routing problems (VRP), which can be considered a generalization of TSP, have been studied in depth. Many variants of the problem exist, most of them trying to find a set of routes with the shortest distance or time possible for a fleet of vehicles. This paper combines two important variants, the stochastic time-dependent VRP and the multi-objective VRP. A genetic algorithm for solving ...

Vehicle Routing Problem (VRP) is a real life constraint satisfaction problem to find minimal travel distances of vehicles to serve customers. Capacitated VRP (CVRP) is the simplest form of VRP considering vehicle capacity constraint. Constructive and clustering are the two popular approaches to solve CVRP. A constructive approach creates routes and attempts to minimize the cost at the same time...

This work introduces the Green Vehicle Routing Problem (GVRP). The GVRP is an extension of the well-known vehicle routing problem (VRP). Moreover, the GVRP includes an objective function that minimizes weighted distance. Minimizing weighted distance reduces fuel consumption and consequently CO2 emissions. Therefore, the GVRP is more environmentally friendly than traditional versions of the VRP....

One of the motivations of hyper-heuristic research is to investigate the development of adaptive decision support systems that can be applied to a range of different problems and different problem instances [5]. One possible approach is to dynamically adjust the preferences of a set of simple lowlevel heuristics (or neighbourhood operators) during the search. Hyper-heuristics have been used to ...

The Static and Stochastic Vehicle Routing Problem with Random Requests (SS-VRP-R) describes realistic operational contexts in which a fleet of vehicles has to serve customer requests appearing dynamically. Based on probabilistic knowledge about the appearance requests, SS-VRP-R seeks priori sequences vehicle relocations, optimizing expected responsiveness requests. In this paper, an existing co...

The number of optimization techniques in the combinatorial domain is large and diversified. Nevertheless, there is still a lack of real benchmarks to validate optimization algorithms. In this work we introduce VRPBench, a tool to create instances and visualize solutions to the Vehicle Routing Problem (VRP) in a planar graph embedded in the Euclidean 2D space. We use VRPBench to model a real-wor...