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.
This paper proposes a hybrid meta-heuristic, tabu threshold algorithm (TTA), to efficiently and effectively solve vehicle routing problem with time window constraints (VRPTW). TTA integrates tabu search (TS) and threshold accepting (TA). TS is one of the most popular generic heuristics in solving VRPTW in recent years, and TA is a combinatorial optimization meta-heuristic. The first objective is to...
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 this paper, author comes up with a new optimization algorithm about distribution routing planning. This method is used to make the best distribution route according to vehiclepsilas load capacity, distance from distribution centre and various client demand as well as cargo priority etc. The result could be displayed in electronic map. Proved by instances, this method can help managers to reduce...
Vehicle routing problem with time windows (VRPTW) is an NP-complete optimization problem. The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customers with fixed demand and time window constraints. A hybrid ant colony system (DSACA-VRPTW) is proposed to solve this problem. Firstly, each antpsilas solution might be improved by dynamic sweep Algorithm which...
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.