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 proposed work presented a modified MAX-MIN Ant System (MMAS) algorithm to solve the routing problem, in which known demand are supplied from a store house with parallel routes for new local search. Routing Problem is an optimization problem and solved to nearly optimum by heuristics. The objective of routing issues is to use a fleet of vehicles with specified capacity to serve a number of users...
The single vehicle pickup and delivery problem with time window (1-PDPTW) is an important class of vehicle routing problem. This problem aims to find a shortest route for a single vehicle to deliver objects from origin to destination, subject to load limit and time window of delivery. This study develops an ant colony optimization (ACO) method for the 1-PDPTW. Specifically, the constraints of time...
Many distribution companies must deliver and pick up goods to satisfy customers. This problem is called the Vehicle Routing Problem with Mixed linehauls and Backhauls (VRPMB) which considers that some goods must be delivered from a depot to linehaul customers, while others must be picked up at backhaul customers to be brought to the depot. This paper studies an enriched version called Heterogeneous...
In this paper, the VRPTWRV (VRPTW with Re-used Vehicle) was presented and a mathematical programming model with multiple objects was constructed correspondingly. The heuristic information and Pseudo-random probability selection rule are improved according to the principle of serving customers with earlier service beginning time, shorter service time and earlier ending time firstly based on Ant Colony...
MACS-DVRPTW, an Ant Colony Optimization based approach useful to solve dynamic vehicle routing problems with time windows, is presented. MACS-DVRPTW is organized with a hierarchy of artificial ant colonies designed to successively optimize a multiple objective function: the first colony minimizes the number of vehicles while the second colony minimizes the traveled distances. Cooperation between colonies...
This paper deals with the real-time regulation of traffic within a disrupted transportation system. We present an approach of ant colony optimization in order to solve a spatial reconfiguration problem of multimodal transport network. It is a multicriteria problem. In fact, it consists of real-time route planning with three criteria to be optimized: The travel time, the travel distance and the passenger...
Ant colony optimization (ACO) is a meta-heuristic approach to tackle hard combinatorial optimization problems. The basic component of ACO is a solution construction mechanism, which simulates the decision-making processes of ant colonies as they forage for food and find the most efficient routes from their nests to food sources. Due to its constructive nature, we hybridize the solution construction...
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.