scholarly journals Multi-AGV dispatching and routing problem based on a three-stage decomposition method

2020 ◽  
Vol 17 (5) ◽  
pp. 5150-5172
Author(s):  
Yejun Hu ◽  
◽  
Liangcai Dong ◽  
Lei Xu
Keyword(s):  
Decomposition Method ◽  
Routing Problem ◽  
Agv Dispatching

The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm

2020 ◽  
Author(s):  
Zu-Jun Ma ◽  
Fei Yang ◽  
Ying Dai ◽  
Zuo-Jun Max Shen
Keyword(s):  
Column Generation ◽  
Real World ◽  
Decomposition Method ◽  
Environmental Conservation ◽  
Production Time ◽  
Routing Problem ◽  
Problem Model ◽  
New Variant ◽  
Labeling Algorithm ◽  
Nectar Source

Apiculture has gained worldwide interest because of its contributions to economic incomes and environmental conservation. In view of these, migratory beekeeping, as a high-yielding technique, is extensively adopted. However, because of the lack of an overall routing plan, beekeepers who follow the experiential migratory routes frequently encounter unexpected detours and suffer losses when faced with problems such as those related to nectar source capacities and the production of bee products. The migratory beekeeping routing problem (MBRP) is proposed based on the practical background of the commercial apiculture industry to optimize the global revenue for beekeepers by comprehensively considering nectar source allocation, migration, production and sales of bee products, and corresponding time decisions. The MBRP is a new variant of the vehicle routing problem but with significantly different production time decisions at the vertices (i.e., nectar sources). That is, only the overlaps between residence durations and flowering periods generate production benefits. Different sales visits cause different gains from the same products; in turn, these lead to different production time decisions at previously visited nectar source locations and even change the visits for production. To overcome the difficulty resulting from the complicated time decisions, we utilize the Dantzig–Wolfe decomposition method and propose a revised labeling algorithm for the pricing subproblems. The tests, performed on instances and a real-world case, demonstrate that the column generation method with the revised labeling algorithm is efficient for solving the MBRP. Compared with traditional routes, a more efficient overall routing schedule for migratory beekeepers is proposed. Summary of Contribution. Based on the practical background of commercial apiculture industry, this paper proposes a new type of routing problem named the migratory beekeeping routing problem (MBRP), which incorporates the selection of productive nodes and sales nodes as well as the production time decision at the productive nodes on a migratory beekeeping network. To overcome the difficulty resulting from the complicated time decisions, we utilize the Dantzig–Wolfe decomposition method and propose a revised labeling algorithm for the pricing subproblems. The tests, performed on instances and a real-world case, demonstrate that the column generation method with the revised labeling algorithm is efficient for solving the MBRP. Compared with traditional routes, a more efficient overall routing schedule for migratory beekeepers is proposed. Therefore, this paper is congruent with, and contributes to, the scope and mission of INFORMS Journal on Computing, especially the area of Network Optimization: Algorithms & Applications.

A decomposition method in non-linear programmm

Optimization ◽  
1975 ◽  
Vol 6 (4) ◽  
pp. 549-559
Author(s):  
L. Gerencsér
Keyword(s):  
Decomposition Method ◽  
Non Linear

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.

DECOMPOSITION METHOD FOR DETERMINING THE HIGH REFLECTED SECTIONS OF A COMPLEX OBJECT SURFACE

2018 ◽  
Vol 77 (11) ◽  
pp. 945-956 ◽  
Author(s):  
N. N. Kolchigin ◽  
M. N. Legenkiy ◽  
A. A. Maslovskiy ◽  
А. Demchenko ◽  
S. Vinnichenko ◽  
...  
Keyword(s):  
Decomposition Method ◽  
Complex Object ◽  
Object Surface

A Spectrum-Adaptive Decomposition Method for Effective Atomic Number Estimation Using Dual Energy CT

2020 ◽  
Vol 2020 (14) ◽  
pp. 293-1-293-7
Author(s):  
Ankit Manerikar ◽  
Fangda Li ◽  
Avinash C. Kak
Keyword(s):  
Atomic Number ◽  
Decomposition Method ◽  
Traditional Approach ◽  
Effective Atomic Number ◽  
Dual Energy ◽  
Performance Comparison ◽  
Estimation Methods ◽  
Dual Energy Ct ◽  
Projection Data ◽  
X Ray

Dual Energy Computed Tomography (DECT) is expected to become a significant tool for voxel-based detection of hazardous materials in airport baggage screening. The traditional approach to DECT imaging involves collecting the projection data using two different X-ray spectra and then decomposing the data thus collected into line integrals of two independent characterizations of the material properties. Typically, one of these characterizations involves the effective atomic number (Zeff) of the materials. However, with the X-ray spectral energies typically used for DECT imaging, the current best-practice approaches for dualenergy decomposition yield Zeff values whose accuracy range is limited to only a subset of the periodic-table elements, more specifically to (Z < 30). Although this estimation can be improved by using a system-independent ρe — Ze (SIRZ) space, the SIRZ transformation does not efficiently model the polychromatic nature of the X-ray spectra typically used in physical CT scanners. In this paper, we present a new decomposition method, AdaSIRZ, that corrects this shortcoming by adapting the SIRZ decomposition to the entire spectrum of an X-ray source. The method reformulates the X-ray attenuation equations as direct functions of (ρe, Ze) and solves for the coefficients using bounded nonlinear least-squares optimization. Performance comparison of AdaSIRZ with other Zeff estimation methods on different sets of real DECT images shows that AdaSIRZ provides a higher output accuracy for Zeff image reconstructions for a wider range of object materials.

Sign in / Sign up

Export Citation Format

Share Document