in a logistic system, decisions on location of depot, vehicle routing and assignment of routes to vehicles should be considered simultaneously. the location-routing problems are defined to find the optimal number and locations of depots, and at the same time with the distribution routes for the vehicles. because of the complexity and the time consuming computation, this problem belongs to a cla...

The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...

Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...

Combinatorial optimization problems are usually modeled in a static fashion. In this kind of problems, all data are known in advance, i.e. before the optimization process has started. However, in practice, many problems are dynamic, and change while the optimization is in progress. For example, in the dynamic vehicle routing problem (DVRP), new orders arrive when the working day plan is in prog...

Vehicle routing problem is a NP-hard problem in combination optimization problem, It is influenced by many factors, and the process is complex. However, the search space of particle swarm algorithm is limited and prone to precocious phenomenon. In this paper, we based on the original particle swarm optimization, present a new way of location update algorithm (VPSO).VPSO in the process of solvin...

In this paper, we propose a metaheuristic based on annealing-like restarts to diversify and intensify local searches for solving the vehicle routing problem with time windows (VRPTW). Using the Solomon s benchmark instances for the problem, our method obtained seven new best results and equaled 19 other best results. Extensive comparisons indicate that our method is comparable to the best in pu...

This work examines the Capacitated Vehicle Routing Problem with Balanced Routes and Time Windows (CVRPBRTW). The problem aims at optimizing the total distance cost, the number of vehicles used, and the route balancing, under the existence of time windows and other constraints. The problem is formulated as a Multi-Objective Optimization Problem where all objectives are tackled simultaneously, so...

Vehicle routing problems (VRPs) represent an important research stream in applied combinatorial optimization. As the problems emerging from the practice become more constrained and large, more sophisticated approaches are required to address them. This paper tackles the Multiple Compartment Vehicle Routing Problem with Time Windows. This extension of the classical VRP consists of an unlimited h...

This paper presents the SR-GCWS-CS probabilistic algorithm that combines Monte Carlo simulation with splitting techniques and the Clarke and Wright savings heuristic to find competitive quasi-optimal solutions to the Capacitated Vehicle Routing Problem (CVRP) in reasonable response times. The algorithm, which does not require complex fine-tuning processes, can be used as an alternative to other...

Metaheuristic algorithms have been investigated intensively to address highly complex combinatorial optimisation problems. However, most metaheuristic designed manually by researchers of different expertise without a consistent framework support effective algorithm design. This paper proposes general search formulate in unified way range metaheuristics. defines generic algorithmic components, i...