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 paper describes a system for the solution of Dial a Ride Problem (DRP). Dial a Ride Problem (DRP) is to take over the passenger from a place of departure to a place of arrival. It is characterized by a set of transport demands and a number of vehicles available. The ultimate aim is to offer an alternative to displacement optimized individually and collectively. The DRP is classified as NP-hard...
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...
In view of the characteristics of the fixed job scheduling problem, by establishing the sequential network model among work pieces the fixed job scheduling is converted into the optimal directed path decomposition problem, and the minimal path assignment cost of the sequential network model is the optimization objective. Then a heuristic algorithm based on the simulated annealing is presented, and...
Vehicle routing problem is a well-known NP problem, many heuristic algorithms, such as genetic algorithm, simulated annealing algorithm is applied in the problem. Particle swarm optimization (PSO) is a new evolutionary computation technique. Although PSO algorithm possesses many attractive properties, the method of encoding in NP problem need further to investigated. In the paper, a novel real number...
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.