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.
A new hybrid particle swarm optimization (HPSO) algorithm which is based on particle swarm optimization algorithm and simulated annealing algorithm is proposed in this paper for solving multiple capacitated vehicle routing problem. The basic scheme consists in Particle swarm optimization with time-varying parameters and simulated annealing with memory and tempering features. Results from the computational...
In this plethora of increased competitiveness and globalization the effective management of the warehouse system is a challenging task. Realizing that proper scheduling of the warehouses is necessary to outperform the competitors on cost, lead time, and customer service basis (Koster, 1998); the proposed research focuses on optimization of warehouse scheduling problems. This research aims to minimize...
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...
The standard simulated algorithm has been applied into vehicle routing problem, and it has the common defects of slow convergence and easily being trapped into local minima. In this paper, a new stochastic approach called the simulated annealing genetic algorithm is proposed to solve stochastic vehicle routing problems and the solution is then compared with that from simulated algorithm. Results from...
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.