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 heterogeneous fleet vehicle routing problem with time windows is a variant of the classical vehicle routing problem. This paper defines a mathematical model of this problem and proposes a variable neighborhood tabu search algorithm to solve it. The initial solution is obtained by GENIUS and the giant tour algorithm. Our algorithm employs a variable neighborhood mechanism to search the optimal...
Rail high-speed passenger lines (HSPL) have been developed rapidly in China; however, the traditional rail crew scheduling mode called responsible mode, in which crews are bundled with vehicles, is hard to adapt to the transit characteristic of HSPL. Moreover, the utilization of rail crew resources is commonly inefficient and the scheduling methods are generally behindhand. To reduce the pressure...
Vehicle routing problem is an important combinatorial optimization problem. It has an important position in logistics optimization and supply chain management theory. Due to traffic flow, traffic incidents and other factors, the travel speed and travel time of road has large time-variability and randomness in real transport network. The study of vehicle routing problem in time-dependent network has...
Electrical storage devices can be very useful in electrified mass transit and in particular in trolleybus lines and tramways. In fact, storage devices are capable of supporting the line voltages of old lines, avoiding the opening of minimum voltage protective relays, especially when the new generation vehicles of greater power circulate. Among electrical storage devices, supercapacitors seem to be...
This study focuses on customer relations management, and utilizes route optimization to achieve efficient delivery. It applies a service-directed architecture technology to allow clients, sellers, and logistics industries in the supply chain to communicate more closely. Through interactive online orders, consumers could conveniently monitor the status of their orders. In this era of energy deficiency,...
A new method integrating reduced model and mixed design variables is proposed and applied in the lightweight design of a bus skeleton for the purpose of mass reduction without loss in structural performance. A whole skeleton model and a reduced model are built. All parts except chassis and floor assembly are reduced out using static reduction method. Reduced model is verified with finite element analysis...
It is necessary, for a modern enterprise, to solve the urgent problem that how to effectively integrate enterprise existing resources and increase overall operational efficiency. In this paper, a tally Devanning/Container Loading business system based on the lightweight framework of J2EE(Spring + Hibernate + Struts) was implemented, according to the detailed analysis of business requirements and goals...
The capacitated vehicle routing is a combinatorial optimization problem of that has aroused major interest because it is present in critical areas (logistics, transport and other) and it is a problem of considerable difficulty. There are currently several techniques that have been developed to try to solve this problem efficiently. In this paper, we present a solution to this problem based on the...
In this paper we propose a tabu search heuristic embedded in adaptative memory procedure to solve the profitable arc tour problem (PATP). The PATP is a variant of the well-known vehicle routing problem in which a set of vehicle tours are constructed. The objective is to find a set of cycles in the tours of vehicle that maximize the collection of profits minus travel costs, which is in its turn subject...
A heuristic algorithm for multiple vehicles routing problem with stochastic demand is proposed and the goal is to minimize the total traveling cost. Two-phase method is adopted to deal with this problem. In the first phase, an algorithm is proposed to partition customers into clusters, and the main task of the second phase is to design an effective routing through each cluster of customers to minimize...
In this paper, we have solved the resequencing and feature assignment problem (RFAP) by an iterative search scheme, which can obtain optimum solutions for instances sized as large as that in reality. The search scheme is based on a beam search heuristic, which outperform other heuristics in previous literature. The algorithms proposed can therefore be utilized to improve the vehicle manufacturing...
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.