Applying the Mahalanobis–Taguchi System to Vehicle Handling
نویسندگان
چکیده
منابع مشابه
Applying the Mahalanobis-Taguchi System to Vehicle Ride
The Mahalanobis Taguchi System is a diagnosis and forecasting method for multivariate data. Mahalanobis distance is a measure based on correlations between the variables and different patterns that can be identified and analyzed with respect to a base or reference group. The Mahalanobis Taguchi System is of interest because of its reported accuracy in forecasting small, correlated data sets. Th...
متن کاملApplying the Ant System to the Vehicle Routing
In this paper we use a recently proposed metaheuristic, the Ant System, to solve the Vehicle Routing Problem (VRP) in its basic form, i.e. with capacity and distance restrictions, one central depot and identical vehicles. A \hybrid" Ant System algorithm is rst presented and then improved using problem speciic information (savings, capacity utilization). Experiments on various aspects of the alg...
متن کاملApplying Constraint Handling Rules to HPSG
Constraint Handling Rules (CHR) have provided a realistic solution to an over-arching problem in many elds that deal with constraint logic programming: how to combine recursive functions or relations with constraints while avoiding non-termination problems. This paper focuses on some other bene ts that CHR, speci cally their implementation in SICStus Prolog, have provided to computational lingu...
متن کاملApplying Schur Complements for Handling
We describe a set of procedures for computing and updating an inverse representation of a large and sparse unsymmetric matrix A. The representation is built of two matrices: an easily invertible, large and sparse matrix A 0 and a dense Schur complement matrix S. An eecient heuristic is given that nds this representation for any matrix A and keeps the size of S as small as possible. Equations wi...
متن کاملApplying Monte Carlo Techniques to the Capacitated Vehicle Routing Problem
This paper describes a new method for solving the Capacitated Vehicle Routing Problem (CVRP). The CVRP is defined as the problem of delivering goods from a depot to a number of customers with a fleet of capacitated vehicles, minimizing the cost of distributing the goods while respecting the capacity constraints of the vehicles. We have developed a method based on Monte Carlo Simulation (MCS) an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Concurrent Engineering
سال: 2006
ISSN: 1063-293X,1531-2003
DOI: 10.1177/1063293x06073568