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.
The heterogeneous fleet vehicle routing problem with time windows is a variant of the classical vehicle routing problem. This paper defines a mathematical model of this problem and proposes a variable neighborhood tabu search algorithm to solve it. The initial solution is obtained by GENIUS and the giant tour algorithm. Our algorithm employs a variable neighborhood mechanism to search the optimal...
The existence of powerful constraint satisfaction algorithms is not the sole reason of the wide success of the CSP framework. The interest of this framework is also that it offers a generic and simple way for the modeling of real world applications. Nevertheless these applications call for tasks that often differ from a classical search for a solution. The aim of the present paper is not to provide...
We start with the background and the solutions of vehicle routing problem, and then focus on the interpretation of Tabu search algorithm and the impact of its key factors. In particular, the idea of tabu search algorithm is applied to solve the vehicle routing problem. We design a new intuitive and easy to understand client-direct-arrangement solution method, and finally realize the algorithm through...
This paper presents a Quadtree algorithm which is one of the several possible methods that can be used to store an unknown amount of terrain data. The Quadtree algorithm is often used for visualizing large terrain. The Triangulated Irregular Network (TIN) method has been developed recently but it is difficult to make geographical operations such as neighbor finding, searching, and updating. The purpose...
In this paper we propose a tabu search heuristic embedded in adaptative memory procedure to solve the profitable arc tour problem (PATP). The PATP is a variant of the well-known vehicle routing problem in which a set of vehicle tours are constructed. The objective is to find a set of cycles in the tours of vehicle that maximize the collection of profits minus travel costs, which is in its turn subject...
This paper presents an algorithm called CSP-IRPTW for the vehicles routing problem with time windows (VRPTW), which applies the PCP method (precedence constraint posting) used for models of scheduling as a CSP (constraint satisfaction problem). PCP involves the calculation of the shortest path in partial and global form, between pairs of nodes and among all the nodes respectively, in the graph that...
A knowledge representation - "GCS ternary" method for the model of capacitated vehicle routing problems (CVRP) was introduced on the basis of knowledge representation theories in artificial intelligence (AI) and knowledge engineering (KE) in order to decrease the deficiencies of model representation in decision support systems (DSS) for vehicle routing problems (VRP) in logistics distribution...
In this paper, we have solved the resequencing and feature assignment problem (RFAP) by an iterative search scheme, which can obtain optimum solutions for instances sized as large as that in reality. The search scheme is based on a beam search heuristic, which outperform other heuristics in previous literature. The algorithms proposed can therefore be utilized to improve the vehicle manufacturing...
Vehicle routing problem with time windows (VRPTW) is a well-known and complex combinatorial problem, which has received considerable attention in recent years. In this paper, we propose an improved genetic algorithm to solve the VRPTW problem. The proposed approach, called IGA, employs two novel genetic operators. To verify the performance of IGA, we test it on six famous benchmark problems. Simulation...
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.