scholarly journals A ROUTING PROBLEM FOR THE DELIVERY OF A HOMOGENEOUS PRODUCT TO VARIOUS CLIENTS BY MOTOR VEHICLES

2020 ◽  
pp. 84-88
Author(s):  
N.I. Yusupova ◽  
R.S. Valeev
Keyword(s):  
Motor Vehicles ◽  
Routing Problem ◽  
Homogeneous Product

scholarly journals Optimal treatment of agricultural land – special multi-depot vehicle routing problem

2019 ◽  
Vol 65 (No. 12) ◽  
pp. 569-578
Author(s):  
Bisera Andric Gusavac ◽  
Milan Stanojevic ◽  
Mirjana Cangalovic
Keyword(s):  
Vehicle Routing ◽  
Chemical Treatment ◽  
Vehicle Routing Problem ◽  
Agricultural Land ◽  
Programming Model ◽  
Mixed Integer ◽  
Routing Problem ◽  
Land Treatment ◽  
Homogeneous Product ◽  
Time Problem

This paper describes a problem of optimal agricultural land treatment using aviation. The studied problem consists of determining the optimal routes for a given set of aircraft used for chemical treatment of arable agricultural land divided into parcels. This NP (nondeterministic polynomial time) problem is represented on a graph and a mixed integer mathematical programming model of the problem is formulated. This mathematical model is a specific variant of the multi-depot vehicle routing problem where a min-cost plan for the transportation of a homogeneous product (chemicals used for land treatment) from different supply locations (airfields) to different demand locations (agricultural parcels) should be generated. Some specifics of the agricultural land chemical treatment are described in the paper and the following specific conditions are taken into consideration: each parcel is treated only by one way of treatment and one aircraft; for each aircraft its chemical and fuel reservoir capacities are sufficient to serve its route. The complexity of the problem and the impossibility to obtain exact solutions for larger dimensions of the problem led to the formulation of a special heuristics which is presented in this paper. Numerical experiments are successfully conducted for larger problem dimensions and results are presented.

Long-term variations in individual particle types in the aerosol of Phoenix, Arizona, as determined using automated electron microprobe analysis and multivariate statistical techniques

1993 ◽  
Vol 51 ◽  
pp. 742-743
Author(s):  
Karen A. Katrinak ◽  
James R. Anderson ◽  
Peter R. Buseck
Keyword(s):  
Electron Microprobe ◽  
Fine Fraction ◽  
Coarse Fraction ◽  
Motor Vehicles ◽  
Multivariate Statistical Methods ◽  
Multivariate Statistical ◽  
X Ray ◽  
Mineral Particles ◽  
Anthropogenic Air Pollutants

Aerosol samples were collected in Phoenix, Arizona on eleven dates between July 1989 and April 1990. Elemental compositions were determined for approximately 1000 particles per sample using an electron microprobe with an energy-dispersive x-ray spectrometer. Fine-fraction samples (particle cut size of 1 to 2 μm) were analyzed for each date; coarse-fraction samples were also analyzed for four of the dates.The data were reduced using multivariate statistical methods. Cluster analysis was first used to define 35 particle types. 81% of all fine-fraction particles and 84% of the coarse-fraction particles were assigned to these types, which include mineral, metal-rich, sulfur-rich, and salt categories. "Zero-count" particles, consisting entirely of elements lighter than Na, constitute an additional category and dominate the fine fraction, reflecting the importance of anthropogenic air pollutants such as those emitted by motor vehicles. Si- and Ca-rich mineral particles dominate the coarse fraction and are also numerous in the fine fraction.

Selection tests for Army operators of heavy and light motor vehicles.

1953 ◽  
Author(s):  
Harold I. Stolder ◽  
Lewis R. Vavre ◽  
Charles W. Schumaker ◽  
Robert G. Pefferkorn ◽  
Richard W. Hopper
Keyword(s):  
Motor Vehicles

Fuzzy multi-objective location and routing problem

2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi
Keyword(s):  
Firefly Algorithm ◽  
High Reliability ◽  
Research Area ◽  
Nsga Ii ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Allocation ◽  
Multi Objective ◽  
Location Routing ◽  
The Cost

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.

Sign in / Sign up

Export Citation Format

Share Document