The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In order to satisfy with the individual and various demand of customer, establish multi-type vehicles vehicle scheduling with picking-delivery model. According to the characteristics of model, hybrid genetic algorithm is used to get the optimization solution. First of all, use natural number coding so as to simplify the problem; use the individual amount control choice strategy so as to guarantee...
In order to solve the traffic counting location (TCL) problem, ant colony optimization (ACO) algorithm was introduced, and also some rudimentary numerical results for the TCL set covering model for a simple network were given out. Considering the two goals (maximal coverage and minimal resource utilization) of TCL problem are generally conflicting, this paper tries to incorporate some methods. Two...
Ant Colony Optimization (ACO) is a metaheuristic method that inspired by the behavior of real ant colonies. In this paper, we propose a hybrid ACO algorithm for solving vehicle routing problem (VRP) heuristically in combination with an exact algorithm to improve both the performance of the algorithm and the quality of solutions. In the basic VRP, geographically scattered customers of known demand...
Efficient shortest path algorithm in road networks plays an important role in car navigation system. This paper brings forward the bidirectional A* algorithm based on the hierarchical thinking. Simultaneously, improved the data structure of A* algorithm and the expanded mode of nodes, greatly reduced the running time and scale of algorithm search, enhanced the speed and accuracy of path planning.
Traveling salesman problem is widely utilized as the typical issue for algorithm performance research because of its important engineering and theoretical value. An adaptive Markov Chain Monte Carlo algorithm is employed in resolving TSP for the purpose of ameliorating the temperature management problems in the original Metropolis algorithm. In order to get the balance between the runtime and route...
This paper proposes a novel ant colony optimization named MMAS-MDS algorithm (max-min ant system extended by multidimensional scaling) for solving the traveling salesman problem more effectively in the congested transportation systems. Global heuristic information related to time-distance is put into the probabilistic selection rule of the ant tour construction. It provides global guides for promising...
Based on the principle of kernel route, a tabu search algorithm is designed for large-scale integrated vehicle routing problem (LSIVRP) with constraints of capacity and delivery distance. The algorithm has two phases: initial optimization and post-optimization. In initial optimization, the kernel routes in route library are updated constantly to form the framework of optimal routes. In the first phase...
The logistics vehicle scheduling problem is a widely existent problem in distribution. In fact, it is the vehicle routing problem with time window. In the vehicle routing problem with time windows (VRPTW), there are two main objectives. The primary objective is to reduce the number of vehicles, the secondary one is to minimize the total distance travelled by all vehicles. This is an NP-complete optimization...
The capacitated location-routing problem (CLRP) belongs to the field of logistics of transportation. The CLRP appears as a combination of two difficult problems: the facility location problem (FLP) and the vehicle routing problem (VRP).It is an NP-hard problem. In order to solve practical large scale capacitated LRP, We propose a hybrid ant colony algorithm to solve the CLRP. To compare the proposed...
It is necessary to decompose a large map into small pieces while performing vehicle navigation path analysis in an onboard device. A principal component analysis based network decomposition is constructed to solve this problem. An index of connectivity is proposed in this method, by which the most correlative vertices relative to the destination vertices can be extracted from the complete road network...
A hybrid tabu search algorithm, which generates initial solution by genetic algorithm, is proposed here to solve the vehicle routing problems with time windows (VRPTW). Experimental result shows that this algorithm is better than the other known algorithms.
This paper proposes a heuristic algorithm for fast mining association rules by multidimensional scaling (MDS). It takes the similarity measurements as the MDS proximities and develops a practical MDS model to generate decentralized configuration of points that represent the stops on vehicle routes. This algorithm extends the SMACOF algorithm by the steps of grouping and join. The experiments show...
This paper describes a new design of Tabu search (ts) algorithm for solving the vehicle routing problem with time windows (VRPTW). Since VRPTW is a well known NP-hard problem, heuristic algorithms such as Tabu search are always used to get a good approach. The former published designs of TS usually focus on the neighbor structure, the relaxation to the objective function or the multi-period algorithms...
Routing systems have become very attractive recently. They aim to help users on finding the optimal path to their destinations regarding travel distance,travel time, and other criteria. There are many issues to be investigated such as the multi-criteria personalization of the paths according to user preferences. This paper discusses main routing algorithms and presents the Coolest path algorithm which...
This paper is aimed to solve the multi-facility location problems of distribution centers by multi-objective decision method. After analyzing the requirements and characteristics of distribution time, it put forward a multi-facility location model in which the distribution cost was taken as decision objective and the distribution time was changed to a group of constrains. It designed a bi-step heuristics...
In order to overcome the shortages of the conventional bus route generation algorithm which aims to maximize the number of direct travelers on the shortest path, this paper present an improvement route generation algorithm for the design of bus network, which aims to maximize the direct passenger-kilometers per unit length and minimize the average travel time of direct travelers on each route at the...
In this article we study the capacitated location routing problem (CLRP) which is defined as a combination of two problems: the facility location problem (FLP) and the vehicle routing problem (VRP). The CLRP is not just a purely academic construct; it has many applications in the practice. We propose a hybrid approach based on a tabu search algorithm combined with an improved ant colony system to...
The path planning problem has become the most important part in the field of the logistics to cut down the cost of the distribution. But for some special instance, for example, time and traffic jam, purely GIS canpsilat give a direct resolvent. Aiming at this problem, a new method, GROP, GIS and rules-based Optimal Path for logistics, was presented in this paper. Firstly, we institute rules for all...
Expected growth in use and implementation of wireless sensor networks (WSNs) in different environments and for different applications creates new security challenges. In WSNs, a malicious node may initiate incorrect path information, change the contents of data packets, and even hijack one or more genuine network nodes. As the network reliability completely depends on individual nodespsila presence...
In this paper, a distribution system consisting of a single manufacture and many geographically dispersed agents is studied. The manufacture distributes the trial-sale productions to many agents in an online fashion. Namely, without any information in the future, the manufacture will determine how many goods would be transported to the agents during every step. The goal is to minimize total transportation...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.