Vehicle Routing Problem (VRP) has become an integral part in logistic operations which determines optimal routes for several vehicles to serve customers. The basic version of VRP is Capacitated VRP (CVRP) which considers equal capacities for all vehicles. The objective of CVRP is to minimize the total traveling distance of all vehicles to serve all the customers. Various methods are used to sol...

To solve the problem of vehicle routing problem under capacity limitation, this paper puts forward a novel method of logistics distribution route optimization based on genetic algorithm and ant colony optimization algorithm (GA-ACO). On the first stage, improved genetic algorithm with a good global optimization searching ability is used to find the feasible routes quickly. On the second stage, ...

Ant algorithm is a novel meta-heuristic optimization algorithm, but at the same time there are some disadvantages. This paper proposed an ant colony algorithm with route evaluation based on the basic ant colony algorithm. After all ant complete the route search once, the current search situation can be evaluated according to an improved formula of standard deviation, then to decide to update gl...

The Mobile IPv6 protocol includes a route optimization mechanism that improves routing efficiency by informing correspondent nodes about the current care-of address of the mobile node. Mobile node physical location may be associated with its topologically correct IP address. Revealing the mobile node’s care-of address can therefore be used to track the mobile with certain accuracy, which compro...

The generation of route descriptions is a fundamental task of navigation systems. A particular problem in this context is to identify routes that can easily be described and processed by users. In this work, we present a framework for representing route networks with the qualitative information necessary to evaluate and optimize route descriptions with regard to ambiguities in them. We identify...

The enormous size and complexity of current and future integrated circuits (IC’s) presents a host of challenging global, combinatorial optimization problems. As IC’s enter the nanometer scale, there is increased demand for scalable and adaptable algorithms for VLSI physical design: the transformation of a logicaltemporal circuit specification into a spatially explicit one. There are several key...

Logistics distribution has become the key research to improve efficiency and reduce the cost of logistics. Based on the survey of current situation and optimization algorithms, a novel optimization scheme is presented in this paper. For a lot of distribution sites in a city, firstly K-means clustering algorithm is adopted to get local distribution centers and their scope, and then ant colony al...

The generation of route descriptions is a fundamental task of navigation systems. A particular problem in this context is to identify routes that can easily be described and processed by users. In this work, we present a framework for representing route networks with the qualitative information necessary to evaluate and optimize route descriptions with regard to ambiguities in them. We identify...