A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector

Effective routing of vehicles remains a focal goal of all modern enterprises, thriving for excellence in project management with minimal investment and operational costs. This paper proposes a metaheuristic methodology for solving a practical variant of the well-known Vehicle Routing Problem, called Heterogeneous Fixed Fleet VRP (HFFVRP). Using a two-phase construction heuristic, called GEneralized ROute Construction Algorithm (GEROCA), the proposed metaheuristic approach enhances its flexibility to easily adopt various operational constraints. Via this approach, two real-life distribution problems faced by a dairy and a construction company were tackled and formulated as HFFVRP. Computational results on the aforementioned case studies show that the proposed metaheuristic approach (a) consistently outperforms previous published metaheuristic approaches we have developed to solve the HFFVRP, and (b) substantially improves upon the current practice of the company. The key result that impressed both companies’ management was the improvement over the bi-objective character of their problems: the minimization of the total distribution cost as well as the minimization of the number of the given heterogeneous number of vehicles used.     

A Skorokhod Problem formulation and large deviation analysis of a processor sharing model

Generalized processor sharing has been proposed as a policy for distributing processing in a fair manner between different data classes in high-speed networks. In this paper we show how recent results on the Skorokhod Problem can be used to construct and analyze the mapping that takes the input processes into the buffer content. More precisely, we show how to represent the map in terms of a Skorokhod Problem, and from this infer that the mapping is well defined (existence and uniqueness) and well behaved (Lipschitz continuity). As an elementary application we present some large deviation estimates for a many data source model. This revised version was published online in June 2006 with corrections to the Cover Date.     

The Cauchy Problem for a Class of Semilinear Wave Equations with Piecewise Constants Data

ＴｈｅＣａｕｃｈｙＰｒｏｂｌｅｍｆｏｒａＣｌａｓｓｏｆＳｅｍｉｌｉｎｅａｒＷａｖｅＥｑｕａｔｉｏｎｓｗｉｔｈＰｉｅｃｅｗｉｓｅＣｏｎｓｔａｎｔｓＤａｔａＺｈａｎｇＹｏｎｇｑｉａｎ（张永前）（ＩｎｓｔｉｔｕｔｅｏｆＭａｔｈｅｍａｔｉｃｓ，ＦｕｄａｎＵｎ...     

Delay optimization and energy balancing algorithm for improving network lifetime in fixed wireless sensor networks

Since wireless in terms of energy-restricted processes, dispersion radii, processing power limitations, buffers, bandwidth-limited connections, active network topologies, and network stream of traffic outlines, sensor networks provide difficult design issues. The number of hops and latency are decreased if there is a relay mote because it interacts directly with relay motes that are closer to the destination mote. The tremendous intensive research in the area of Wireless Sensor Networks (WSN) has gained a lot of significance among the technical community and research. The job of WSN is to sense the data using sensor motes, pass on the data to the destination detection mote which is associated with a processing center and can be used in multiple spans of Internet of Things (IoT) applications. Wireless sensor network has a set of sensor motes. By making use of sensor mote placement strategy all the sensor motes are spread in an area with each mote having its own exceptional location. Internet of things applications are delay sensitive those applications have a challenge of forming the complete path at a lower delay constraint. The proposal is to modify the game theory energy balancing algorithm by making use of relay motes so that overall network lifetime is increased. It has been proved that modified GTEB is better with respect to existing algorithms in terms of delay, figure of hops, energy depletion, figure of alive motes, figure of dead motes, lifespan ratio, routing overhead and throughput.     

Assessing and predicting changes in vegetation cover associated with military land use activities using field monitoring data at Fort Hood, Texas

We assessed short-term impacts of changes in military training load on vegetative cover at Fort Hood, TX. From 1989 to 1995, permanent field transects were monitored for vegetative cover and land use disturbance using standard army monitoring methods [Land Condition Trend Analysis (LCTA)]. Land use intensity (training load) was quantified and used to develop a model to predict future vegetation cover values. We found that standard Army monitoring methods detected changes in installation resources associated with changes in training load. Increased training loads were associated with increased measures of disturbance, decreased ground cover, and decreased aerial vegetative cover. We found that the spatial pattern of disturbance and vegetation cover remained relatively constant over the study period despite large variations in overall training load. Our model used the consistency in spatial cover patterns over time and the strong relationship between training load and vegetation cover to predict the impact of future training loads on vegetation.     

Optimizing garbage collection vehicle routing problem with alternative fuel-powered vehicles

Abstract

This paper considers the garbage collection problem in which vehicles with multiple compartments are used to collect the garbage. The vehicles are considered to be Alternative Fuel-powered Vehicles (AFVs). Compared with the traditional fossil fuel powered vehicles, the AFVs have limited fuel tank capacity. In addition, AFVs are allowed to refuel only at the depot. We provide a mathematical formulation and develop two solution approaches to solve the problem. The first approach is based on the saving algorithm, while the second is based on the ant colony system (ACS) metaheuristic. New problem instances have been generated to evaluate the performance of the proposed algorithms.     

Effect of Lateral Linear Stiffness on Nonlinear Characteristics of Hunting Motion of a Railway Wheelset

Railway wheelset experiences the problem of hunting above a critical speed, which is a kind of self-excited oscillation. At the critical speed, it is known that the system undergoes a subcritical Hopf bifurcation. Therefore, for clarifying the nonlinear characteristics of hunting it is very important to detect, for example, the nonlinear forces in the wheelset due to the creep forces acting between the wheels and rails, and the nonlinear component of the resorting forces by the suspensions. However, it is impossible to determine each force quantitatively. In the present paper, it is first shown, by using the center manifold theory and the method of normal form, that the nonlinear characteristics of the bifurcation in a wheelset model with two degrees of freedom are governed by a single parameter, hence each nonlinear force need not be detected when examining the nonlinear characteristics. Also, a method of determining the governing parameter from experimentally observed radiuses of the unstable limit cycle is proposed. Next, we experimentally investigate the variation of the parameter due to the presence of linear spring suspensions in the lateral direction and discuss the variation of the nonlinear characteristics of the hunting motion, which depends on the lateral stiffness. As a result, the improvement of the stability of the wheelset against the disturbance by the linear spring suspensions is clarified.     

Validating a GIS-based multi-criteria method for potential road identification

This paper investigated the validation of a multi-criteria method for identifying potential roads, and demonstrated the capability of analyzing GPS vehicle tracking data for identifying vehicle movement patterns and potential roads. The multi-criteria method was evaluated by comparing the predictions to the site visit results on 34 selected road segments meeting different criteria levels. Results show that locations meeting higher criteria levels have higher possibilities to be roads: an approximately 91% possibility of road existence for the locations meeting all five criteria; 55% for the locations meeting four criteria; and 14% for those meeting criteria level two or three. This approach provides an opportunity for land managers to update existing GIS roads map, or identify newly formed roads that may need either rehabilitation or inclusion into the roads maintenance program.     

The effect of velocity on rigid wheel performance

A simulation model to predict the effect of velocity on rigid-wheel performance for off-road terrain was examined. The soil–wheel simulation model is based on determining the forces acting on a wheel in steady state conditions. The stress distribution at the interface was analyzed from the instantaneous equilibrium between wheel and soil elements. The soil was presented by its reaction to penetration and shear. The simulation model describes the effect of wheel velocity on the soil–wheel interaction performances such as: wheel sinkage, wheel slip, net tractive ratio, gross traction ratio, tractive efficiency and motion resistance ratio. Simulation results from several soil-wheel configurations corroborate that the effect of velocity should be considered. It was found that wheel performance such as net tractive ratio and tractive efficiency, increases with increasing velocity. Both, relative wheel sinkage and relative free rolling wheel force ratio, decrease as velocity increases. The suggested model improves the performance prediction of off-road operating vehicles and can be used for applications such as controlling and improving off-road vehicle performance.     

Distributed computation of virtual coordinates for greedy routing in sensor networks

Sensor networks are emerging as a paradigm for future computing, but pose a number of challenges in the fields of networking and distributed computation. One challenge is to devise a greedy routing protocol—one that routes messages through the network using only information available at a node or its neighbors. Modeling the connectivity graph of a sensor network as a 3-connected planar graph, we describe how to compute on the network in a distributed and local manner a special geometric embedding of the graph. This embedding supports a geometric routing protocol called “greedy routing” based on the “virtual” coordinates of the nodes derived from the embedding.