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.
City logistics is facing the challenging problem of providing a quick-response and on-time delivery service in congested urban areas with frequent traffic jams. The dynamically changing traffic conditions make the predetermined best transportation plans suboptimal and consequently cause increased logistics cost and even greater air pollution. To help the driver determine time-optimal routing solutions...
In this paper, the vehicle routing problem with time windows (VRPTW) was considered, and a mixed integer programming mathematic model of VRPTW was proposed in detail. Meantime, an improved ant colony algorithm (IACA) was proposed to overcome the shortcomings of premature convergence and slow convergence of conventional ant colony algorithm (ACA). The experiment results showed that the IACA can solve...
VMI (vendor managed inventory) policy coordinates effectively the antinomy between the inventory and the transportation within logistics distribution system. Under VMI mode, integrating inventory and transportation of the supplier and the demander as a whole is considered to achieve the optimization of total distribution cost. In view of typical one-warehouse multiretailer distribution network in...
The paper describes the distribution vehicle routing optimization scheduling problem, and presents a mathematical model. Ant colony system which is a novel simulated evolutionary algorithm, it can good for NP-Hard problem. According to the features of the Vehicle routing problem with time windows and the ant colony algorithm, an improved ant colony system is proposed to solve this problem. An improved...
Logistics has received considerable attention recently due to the rapid technological development of electronics and the Internet. Normally, clients expect items to be delivered at times that are convenient for their own schedules. Therefore, a multi-objective problem (MOP) model that simultaneously considers the depot desires and clients expectations can better elucidate the real logistics operations...
In this paper we develop a tool (DALSIM - delivery areas and logistics simulation), following the hybrid model described in our previous work that uses the operations research and systems dynamics. The tool is composed of two modules: a module for the simulation of delivery areas at local level based on queuing systems, and the second one simulates the spread of the obstruction on the overall flow...
The location-routing problem is one of the problems in distribution network designing and logistic management, whose mathematical model is proposed in this paper firstly. Since finding the optimal solution for this model is an NP(non-polynomial)problem, we divide the original problem into two sub-problems, i.e., one is the location-allocation problem and the other is general vehicle routing problem...
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.