检索结果-内蒙古大学图书馆

7th International Conference on Logistics Operations Management (GOL)

作者： Oumachtaq, Asma Ouzizi, Latifa Douimi, Mohammed Ecole Natl Super Arts & Metiers Math Modeling & Comp Sci Lab BP 15290 El Mansour Meknes Morocco

ISBN: (纸本)9783031686337;9783031686344

The Vehicle Routing Problem (VRP) is a classic combinatorial optimization problem with a wide range of uses, studied for over more than fifty years since Dantzig and Ramser. In this paper, we define and present the bi-objective Green Capacitated Vehicle Routing Problem (GCVRP), the primary goal of the problem is to identify vehicle routes that will serve a group of customers while reducing the overall distance traveled and the amount of carbon dioxide emissions, we formulate a mathematical model and suggest using the grasp (Greedy Randomized Adaptive Search Procedure) algorithm to solve the problem. The metaheuristic is tested on instances that we have proposed. The numerical experiment results demonstrate the algorithm's effectivenesswithin a reasonable amount of time in the case of small instances, permitting us to utilize it extensively in subsequent work.

关键词： Green capacitated vehicle routing problem CO2 emissions grasp algorithm

来源：评论

学校读者我要写书评

暂无评论

A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2007年第12期84卷 1731-1741页

作者： Khan, B. Shahul Hamid Prabhaharan, G. Asokan, P. Natl Inst Technol Dept Prod Engn Tiruchirappalli India

In this paper we address the problem of minimizing the weighted sum of makespan and maximum tardiness in an m-machine flow shop environment. This is a NP-hard problem in the strong sense. An attempt has been made to solve this problem using a metaheuristic called Greedy Randomized Adaptive Search Procedure (grasp). grasp is a competitive algorithm and is a meta-heuristic for solving combinatorial optimization problems. We have customized the basic concepts of grasp algorithm to solve a bicriteria flow shop problem and a new algorithm named B-grasp (Bicriteria grasp algorithm) is proposed. The new proposed algorithm is evaluated using benchmark problems taken from Taillard and compared with the existing simulated annealing based heuristic developed by Chakravarthy and Rajendran. Computational experiments indicate that the proposed algorithm is much better than the existing one in all cases.

关键词： flow shop makespan grasp algorithm metaheuristic

来源：评论

学校读者我要写书评

暂无评论

Integrated recovery of aircraft and passengers after airline operation disruption based on a grasp algorithm

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2016年 87卷 97-112页

作者： Hu, Yuzhen Song, Yan Zhao, Kang Xu, Baoguang Harbin Engn Univ Sch Econ & Management Harbin 150001 Heilongjiang Peoples R China Univ Iowa Dept Management Sci Iowa City IA 52242 USA Chinese Acad Sci Inst Policy & Management Beijing 100190 Peoples R China

This paper considers the integrated recovery of both aircraft routing and passengers. A mathematical model is proposed based on both the flight connection network and the passenger reassignment relationship. A heuristic based on a grasp algorithm is adopted to solve the problem. A passenger reassignment solution is demonstrated to be optimal in each iteration for a special case. The effectiveness of the heuristic is illustrated through experiments based on synthetic and real-world datasets. It is shown that the integrated recovery of flights and passengers can decrease both the recovery cost and the number of disrupted passengers. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Airline disruptions Integrated recovery Aircraft rerouting Passenger reassignment Heuristic grasp algorithm

来源：评论

学校读者我要写书评

暂无评论

A grasp algorithm for the multi-criteria minimum spanning tree problem

引用

ANNALS OF OPERATIONS RESEARCH 2008年第1期159卷 125-133页

作者： Arroyo, Jose Elias Claudio Vieira, Pedro Sampaio Vianna, Dalessandro Soares Univ Candido Mendes UCAM Campos Nucleo Pesquisa & Desenvolvimento NPD BR-28040320 Rio De Janeiro Brazil

This paper proposes a grasp (Greedy Randomized Adaptive Search Procedure) algorithm for the multi-criteria minimum spanning tree problem, which is NP-hard. In this problem a vector of costs is defined for each edge of the graph and the problem is to find all Pareto optimal or efficient spanning trees (solutions). The algorithm is based on the optimization of different weighted utility functions. In each iteration, a weight vector is defined and a solution is built using a greedy randomized constructive procedure. The found solution is submitted to a local search trying to improve the value of the weighted utility function. We use a drop-and-add neighborhood where the spanning trees are represented by Prufer numbers. In order to find a variety of efficient solutions, we use different weight vectors, which are distributed uniformly on the Pareto frontier. The proposed algorithm is tested on problems with r=2 and 3 criteria. For non-complete graphs with n=10, 20 and 30 nodes, the performance of the algorithm is tested against a complete enumeration. For complete graphs with n=20, 30 and 50 nodes the performance of the algorithm is tested using two types of weighted utility functions. The algorithm is also compared with the multi-criteria version of the Kruskal's algorithm, which generates supported efficient solutions.

关键词： grasp algorithm multi-criteria combinatorial optimization minimum spanning tree

来源：评论

学校读者我要写书评

暂无评论

A genetic algorithm to solve 3D traveling salesman problem with initial population based on a grasp algorithm

引用

JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2017年第1_suppl期17卷 S1-S10页

作者： Meneses, Sebastian Cueva, Rony Tupia, Manuel Guanira, Miguel Pontificia Univ Catolica Peru Lima Dept Engn Lima 32 Peru

In this paper, the problem of obtaining optimal routes on tridimensional environments is discussed. This scenario is called as Traveler Salesman Problem (TSP 3D-variation). As is widely known, TSP has NP-complexity so is necessary to apply techniques to solve it approximately (no exacts solutions available). The purpose of this research is to present a genetic algorithm to solve 3D-TSP variation. These kind of evolutionary algorithms are ideal for solving complex problems where necessary rearrangements and route optimization. In case of genetic algorithms, optimal solutions appear faster depending on the quality of initial population, so theory recommends using metaheuristics for generating this population. In this study, it has used a metaheuristic grasp algorithm to generate the initial population and, over it, apply the genetic operators proposed for optimizing individuals obtained. The results have optimal routes of movement and displacement and are directly applicable in the storage industry.

关键词： Traveling salesman problem TSP 3D-TSP problem Genetic algorithm grasp algorithm metaheuristics evolutionary algorithms bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Arithmetic coding with forbidden symbol and optimized adaptive context tree modeling (grasp algorithm) for H.264 video coders

Arithmetic coding with forbidden symbol and optimized adapti...

引用

International Conference on Signal Processing, Communications and Networks

作者： Logashanmugam, E. Sreejaa, B. S. Ramachandran, R. Sathyabama University Sri Venkateswara College of Engineering Chennai

ISBN: (纸本)9781424409969

In this paper we propose applying an adaptive context tree weighting method with a forbidden symbol in the H.264 coder. Arithmetic codes with a forbidden symbol and a trellis search techniques are employed on an order to estimate the best transmitted codeword. Instead of using the context modeling defined in the H.264 standard, the arithmetic code with a forbidden symbol uses a CTW method. The CABAC algorithm is replaced by grasp algorithm and the experimental results show that coding gains similar or superior to those obtained with the H.264/AVC CABAC algorithm and arithmetic coding.

关键词： advanced video coding arithmetic coding forbidden symbol grasp algorithm CTW method and compression

来源：评论

学校读者我要写书评

暂无评论

A grasp algorithm for Trailer Scheduling of Crossdock Operations in Cold-chain Logistics

A GRASP Algorithm for Trailer Scheduling of Crossdock Operat...

引用

International Conference on Industrial Engineering and Systems Management (IESM)

作者： Zheng, Feifeng Pang, Yaxin Donghua Univ Glorious Sun Sch Business & Management Shanghai Peoples R China

ISBN: (纸本)9781728115665

Crossdocks play a significant role in cold-chain logistics. This paper addresses a trailer scheduling problem with crossdock operation in cold-chain logistics. A mixed-integer linear programming (MILP) model is constructed in this paper. Internal operations and the scheduling on inbound and outbound trailers have been planned with the objective to minimize the total costs (penalty cost from suppliers and customers, inventory cost and transportation cost) incurred in transhipment. Not only the repacking operations at crossdock are considered, but also some features of the cold chain are taken into account in this model. A set of instances are tested by solver CPLEX. The running time to solve large-scale instances is fairly long. Therefore, we proposed a grasp algorithm for this problem to solve the large scale instances in reality. Finally, we compare the results of CPLEX and the grasp algorithm. The results indicate that the algorithm is of high efficiency.

关键词： Trailer Scheduling Crossdock Cold-chain MILP grasp algorithm

来源：评论

学校读者我要写书评

暂无评论

Evaluation of the Accuracy of the Aerosol Optical and Microphysical Retrievals by the grasp algorithm from Combined Measurements of a Polarized Sun-Sky-Lunar Photometer and a Three-Wavelength Elastic Lidar

引用

REMOTE SENSING 2023年第20期15卷 5010-5010页

作者： Oliveira, Daniel Camilo Fortunato dos Santos Sicard, Michael Rodriguez-Gomez, Alejandro Comeron, Adolfo Munoz-Porcar, Constantino Gil-Diaz, Cristina Lolli, Simone Dubovik, Oleg Lopatin, Anton Herrera, Milagros Estefania Herreras-Giralda, Marcos Univ Politecn Cataluna Dept Signal Theory & Commun CommSensLab Barcelona 08034 Spain Univ Reunion Lab Atmosphere & Cyclones F-97744 St Denis France CNR Inst Methodol Environm Anal IMAA I-85050 Tito Italy Univ Lille CNRS UMR 8518 LOA Lab Opt Atmospher LOA F-59650 Lille France GRASP SAS Generalized Retrieval Atmosphere & Surface Proper F-59260 Lezennes France

The versatile Generalized Retrieval of Aerosol and Surface Properties (grasp) algorithm exploits the advantages of synergic ground-based aerosol observations such as radiometric (sensitive to columnar aerosol optical and microphysical properties) and lidar (sensitive to vertical distribution of the optical properties) observations. The synergy is possible when the complementary data is mutually constrained by grasp parametrization that includes, for the first time ever, the degree of linear polarization (DoLP) parameter measured by a polarized sun-sky-lunar AERONET photometer (380, 440, 500, 675, 870, 1020, and 1640 nm) in synergy with the vertical profiles from an elastic lidar (355, 532, and 1064 nm). First, a series of numerical tests is performed using simulated data generated using a climatology of data and ground-based measurements. The inversions are performed with and without random noise for five different combinations of input data, starting from the AERONET-like dataset and increasing to the complex one by adding more information for three aerosol scenarios: I-high aerosol optical depth (AOD) with dominant coarse mode;II-low AOD with dominant coarse mode;III-high AOD with dominant fine mode. The inclusion of DoLP improves (i) the retrieval accuracy of the fine-mode properties when it is not dominant;(ii) the retrieval accuracy of the coarse-mode properties at longer wavelengths and that of the fine-mode properties at shorter wavelengths;(iii) the retrieval accuracy of the coarse-mode real part of the refractive index (up to 36% reduction), but has no effect on the retrieval of the imaginary part;(iv) reduces up to 83% the bias of the sphere fraction (SF) retrieval in coarse-mode dominated regimes;and (v) the root mean square error (RMSE) of the retrieval for most of the parameters in all scenarios. In addition, the addition of more photometer channels in synergy with a three-wavelength elastic lidar reduces the RMSE for the real part (67% in the coarse mo

关键词： grasp algorithm DoLP synergy photometer lidar

来源：评论

学校读者我要写书评

暂无评论

grasp/Δ: An efficient algorithm for the multi-objective portfolio optimization problem

引用

EXPERT SYSTEMS WITH APPLICATIONS 2023年 211卷

作者： Estrada-Padilla, Alejandro Gomez-Santillan, Claudia Fraire-Huacuja, Hector Joaquin Cruz-Reyes, Laura Rangel-Valdez, Nelson Morales-Rodriguez, Maria Lucila Puga-Soberanes, Hector Jose Inst Tecnol Ciudad Madero Tecnol Nacl Mexico Grad Program Div Ave 1o Mayo EsqSor Juana Ines Cruz S-N Cd Madero 89440 Tamaulipas Mexico CONACyT Tecnol Nacl Mexico Inst Tecnol Ciudad Madero Ave 1o Mayo Esq Sor Juana Ines Cruz S-N Cd Madero 89440 Tamaulipas Mexico Tecnol Nacl Mexico Grad Program Div Inst Tecnol Leon Ave Tecnol S-N Leon 37290 Guanajuato Mexico

The multi-objective portfolio optimization problem with fuzzy trapezoidal parameters involves a search for a subset of projects that, within the given available resources, maximizes the benefits while reducing the uncer-tainty. Traditionally, evolutionary algorithms are used to solve this problem;however, they do not exploit the locality structure of a solution or compute the values of its objective functions using the full set of n decision variables. As a result, the number of evaluations that can be computed within a fixed amount of time decreases as the size of the instances increases, yielding poor performance. This work proposes a new non-evolutionary grasp/& UDelta;algorithm that includes a novel local search with an efficient local computation strategy. The use of local computation reduces the number of operations required to compute the values of the objective functions from O(n) to O(1). Consequently, the increment in evaluations performed in the proposed approach increases the quality of the obtained solutions, particularly as the search space grows. An experiment conducted with instances of different sizes demonstrates the overall competitiveness of grasp/& UDelta;compared to other state-of-the-art al-gorithms. Our results show, as expected, that the differences in performance become statistically more significant when dealing with instances defined by large search spaces. These results were validated using non-parametric statistical tests.

关键词： Local computation algorithm grasp algorithm Multi-objective portfolio optimization problem Uncertainty Trapezoidal fuzzy numbers

来源：评论

学校读者我要写书评

暂无评论

grasp and Grid Computing to Solve the Location Area Problem

GRASP and Grid Computing to Solve the Location Area Problem

引用

World Congress on Nature and Biologically Inspired Computing

作者： Almeida-Luz, Sonia M. Rodriguez-Hermoso, Manuel M. Vega-Rodriguez, Miguel A. Gomez-Pulido, Juan A. Sanchez-Perez, Juan M. Polytech Inst Leiria Dept Informat Engn Sch Tech & Mgmt P-2400 Leiria Portugal Univ Extremadura Escuela Politecn Dept Technol Comp & Commun Caceres 10071 Spain

ISBN: (纸本)9781424450534

In this paper we present a new approach based on the grasp (Greedy Randomized Adaptive Search Procedure) metaheuristic to solve the Location Area (LA) problem over a grid computing environment. All the experiments carried out to complete this study were executed in a real grid environment provided by a virtual organization of the European project EGEE. These experiments were divided into sequential and parallel executions with the intention of analyzing the behavior of the different variants of grasp when applied to the LA problem. We have used four distinct test networks and also decided to compare the results obtained by this new approach with those achieved through other algorithms from our previous work and also by other authors. The experimental results show that this grasp based approach is very encouraging because, with the grid computing, the execution time is much more reduced and the results obtained are very similar to those of other techniques proposed in the literature.

关键词： location area problem location management grasp algorithm evolutionary algorithms grid computing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：