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 multi-depot vehicle routing problem with time windows (MDVRPTW) is an extension to the classical vehicle routing problem (VRP); it is the major research topics in the supply chain management field. It aims to designing a set of minimum-cost routes for a vehicle fleet servicing many customers with known demands and predefined time windows.In this paper a hybrid metaheuristic algorithm is proposed...
This paper describes the split deliveries vehicle routing problem briefly and presents an improved tabu search algorithm. At each iteration, a neighbor solution at each iteration by removing a customer from a set of routes where it is currently visited and inserting it either into a new route or into an existing route that has enough residual capacity. The algorithm also considers the possibility...
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.