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

A general variable neighborhood search for solving the multi-objective open vehicle routing problem

JOURNAL OF HEURISTICS 2020年第3期26卷 423-452页

作者： Sanchez-Oro, Jesus Lopez-Sanchez, Ana D. Colmenar, J. Manuel Rey Juan Carlos Univ C Tulipan S-N Madrid 28933 Spain Pablo De Olavide Univ Ctra Utrera Km 1 Seville 41013 Spain

The multi-objective open vehicle routing problem (MO-OVRP) is a variant of the classic vehicle routing problem in which routes are not required to return to the depot after completing their service and where more than one objective is optimized. This work is intended to solve a more realistic and general version of the problem by considering three different objective functions. MO-OVRP seeks solutions that minimize the total number of routes, the total travel cost, and the longest route. For this purpose, we present a general variable neighborhood search algorithm to approximate the efficient set. The performance of the proposal is supported by an extensive computational experimentation which includes the comparison with the well-known multi-objective genetic algorithm NSGA-II.

关键词： General variable neighborhood search NSGA-II Open vehicle routing problem sweep algorithm Local search Multi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

Industrial strength polygon clipping: A novel algorithm with applications in VLSI CAD

引用

COMPUTER-AIDED DESIGN 2010年第12期42卷 1189-1196页

作者： Simonson, Lucanus J. Intel Corp Santa Clara CA 95054 USA

We present an algorithm to compute the topology and geometry of an arbitrary number of polygon sets in the plane, also known as the map overlay. This algorithm can perform polygon clipping and related operations of interest in VLSI CAD. The algorithm requires no preconditions from input polygons and satisfies a strict set of post conditions suitable for immediate processing of output polygons by downstream tools. The algorithm uses sweepline to compute a Riemann-Stieltjes integral over polygon overlaps in O((n+s) log(n)) time given n polygon edges with s intersections. The algorithm is efficient and general, handling degenerate inputs implicitly. Particular care was taken in implementing the algorithm to ensure numerical robustness without sacrificing efficiency. We present performance comparisons with other polygon clipping algorithms and give examples of real world applications of our algorithm in an industrial software setting. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Polygon clipping Map overlay sweep algorithm VLSI Application Boost Computational geometry Polygon

来源：评论

学校读者我要写书评

暂无评论

Heuristics for the multi-vehicle covering tour problem

引用

COMPUTERS & OPERATIONS RESEARCH 2000年第1期27卷 29-42页

作者： Hachicha, M Hodgson, MJ Laporte, G Semet, F Univ Montreal Ctr Rech Transports Montreal PQ H3C 3J7 Canada Univ Alberta Dept Earth & Atmospher Sci Edmonton AB T6G 2E3 Canada Univ Montreal GRIS Dept Adm Sante Montreal PQ H3C 3J7 Canada Univ Valenciennes & Hainaut Cambresis Lab Informat & Math Appliquees F-59304 Valenciennes France

The multi-vehicle covering tour problem is defined on a graph G = (V boolean OR W, E), where W is a set of vertices that must collectively be covered by up to in vehicles. The problem consists of determining a set of total minimum length vehicle routes on a subset of V, subject to side constraints, such that every vertex of W is within a prespecified distance from a route. Three heuristics are developed for this problem and tested on randomly generated and real data.

关键词： covering tour vehicle routing savings algorithm sweep algorithm route-first/cluster-second

来源：评论

学校读者我要写书评

暂无评论

A hybrid approach of ALNS with alternative initialization and acceptance mechanisms for capacitated vehicle routing problems

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2024年第10期27卷 13583-13606页

作者： Kuyu, Yigit cagatay Vatansever, Fahri KARSAN Automot R&D Dept Bursa Turkiye Bursa Uludag Univ Fac Engn Dept Elect & Elect Engn Bursa Turkiye

The vehicle routing problem (VRP) with capacity constraints is a challenging problem that falls into the category of non-deterministic polynomial-time hard (NP-hard) problems. Finding an optimal solution to this problem is difficult as it involves numerous possible route combinations and constraints. The Adaptive Large Neighborhood Search (ALNS) has been widely employed to solve VRPs by searching for optimal solutions using a variety of dynamic destroy and repair operators, which gradually improve the initial solution. This study investigates six alternative initialization mechanisms and one distinct acceptance criterion for ALNS as the selection of an initial solution in ALNS is a crucial factor affecting the efficiency of the search for feasible regions. The process combines ALNS with the aforementioned procedures, resulting in a hybrid of seven methods. To evaluate the performance of the initialization mechanism and acceptance criterion in ALNS, 50 capacitated vehicle routing benchmark instances are employed. High-dimensional problems are also included for more comprehensive analysis. The improvement in the accuracy of the solutions achieved by each variant is reported.

关键词： Adaptive large neighborhood search Saving algorithm Sequential route-building algorithm sweep algorithm Matching algorithm Capacitated vehicle routing

来源：评论

学校读者我要写书评

暂无评论

New best solutions to VRPSPD benchmark problems by a perturbation based algorithm

引用

EXPERT SYSTEMS WITH APPLICATIONS 2012年第5期39卷 5641-5648页

作者： Jun, Yeowoon Kim, Byung-In Pohang Univ Sci & Technol POSTECH Dept Ind & Management Engn Pohang 790084 Kyungbuk South Korea

This paper discusses the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), in which both pickup and delivery tasks simultaneously occur at various customer locations. The objective is to design a set of minimum distance routes with the minimum number of vehicles satisfying all the customers. This paper proposes a heuristic algorithm consisting of a route construction procedure, a route improvement procedure, and a solution perturbation procedure. A new sweep-based route construction method is developed to generate better initial solutions. In the route improvement procedure, a series of inter- and intra-route improvement algorithms are applied. The perturbation procedure perturbs a solution by removing some routes and stops from the solution and reinserting them into the solution. The last procedure is used to escape from local optima. Computational experiments on various benchmark instances are performed to evaluate our algorithm against the previously proposed approaches. New best solutions for many benchmark instances are found. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： VRPSPD Vehicle routing problem Simultaneous pickup and delivery sweep algorithm Perturbation

来源：评论

学校读者我要写书评

暂无评论

An Effective Order-Aware Hybrid Genetic algorithm for Capacitated Vehicle Routing Problems in Internet of Things

引用

IEEE ACCESS 2019年 7卷 86102-86114页

作者： Lin, Na Shi, Yanjun Zhang, Tongliang Wang, Xuping Dalian Univ Technol Sch Mech Engn Dalian 116024 Peoples R China Dalian Univ Technol Sch Econ & Management Dalian 116024 Peoples R China

The Internet of Things integrates lots of capacitated vehicles in smart logistics. The routing for capacitated vehicles is a combinatorial optimization problem which has been widely studied in recent years. This paper proposes an effective order-aware hybrid genetic algorithm for the capacitated vehicle routing problem in the Internet of Things. The method is characterized by an improved initialization strategy and a problem-specific crossover operator. The former combines the sweep algorithm with randomness to harmonize the contradiction between diversity and convergence, while the latter integrates neighborhood search heuristics to find the offspring with the best fitness and check constraints simultaneously. A large number of simulations have been carried out, and the results validated the effectiveness of our algorithm.

关键词： Internet of Things capacitated vehicle routing problem order-aware hybrid genetic algorithm sweep algorithm neighborhood search heuristics

来源：评论

学校读者我要写书评

暂无评论

Balanced cable routing for offshore wind farms with obstacles

引用

NETWORKS 2022年第4期80卷 386-406页

作者： Cazzaro, Davide Pisinger, David Tech Univ Denmark DTU Management Akad Vej 358 DK-2800 Lyngby Denmark Vattenfall BA Wind Jupitervej 6 DK-6000 Kolding Denmark

The cable routing problem is the task of designing theminimum-cost electrical network between the turbines of offshore wind farmswhile satisfying several constraints. It contributes to decreasing wind energycosts, favoring the green transition. This paper focuses on balanced cablerouting, studying both branched and radial network topology. First, we proposea visibility graph to route cables around obstacles and boundaries present inthe wind farm area. Next, we develop a novel Large Neighborhood Search (LNS)heuristic using neighborhoods of increasing complexity: swap, exchanging two turbines between root-branches;double swap, exchanging two pairs of turbines;cycle swap, moving turbines between root-branches;and re-partition, re-partitioning and re-routing two adjacentroot-branches. We also extend the LNS heuristic to the unbalanced branchedconfiguration to compare to existing literature. On average, it finds solutionsof the same quality using two orders of magnitude less run-time, improving thesolutions in five cases.

关键词： large neighborhood search math-heuristic network design offshore wind farms sweep algorithm visibility graph

来源：评论

学校读者我要写书评

暂无评论

Nonlinear Dot Plots

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2018年第1期24卷 616-625页

作者： Rodrigues, Nils Weiskopf, Daniel Univ Stuttgart VISUS IEEE Comp Soc Stuttgart Germany

Conventional dot plots use a constant dot size and are typically applied to show the frequency distribution of small data sets. Unfortunately, they are not designed for a high dynamic range of frequencies. We address this problem by introducing nonlinear dot plots. Adopting the idea of nonlinear scaling from logarithmic bar charts, our plots allow for dots of varying size so that columns with a large number of samples are reduced in height. For the construction of these diagrams, we introduce an efficient two-way sweep algorithm that leads to a dense and symmetrical layout. We compensate aliasing artifacts at high dot densities by a specifically designed low-pass filtering method. Examples of nonlinear dot plots are compared to conventional dot plots as well as linear and logarithmic histograms. Finally. we include feedback from an expert review.

关键词： Nonlinear dot plot statistical graphics sweep algorithm layout

来源：评论

学校读者我要写书评

暂无评论

Monotone response surface of multi-factor condition: estimation and Bayes classifiers

引用

JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY 2023年第2期85卷 497-522页

作者： Cheung, Ying Kuen Diaz, Keith M. Columbia Univ Dept Biostat New York NY 10032 USA Columbia Univ Dept Med New York NY 10032 USA

We formulate the estimation of monotone response surface of multiple factors as the inverse of an iteration of partially ordered classifier ensembles. Each ensemble (called product-of-independent-probability-escalation (PIPE)-classifiers) is a projection of Bayes classifiers on the constrained space. We prove that the inverse of PIPE-classifiers (iPIPE) exists, and propose algorithms to efficiently compute iPIPE by reducing the space over which optimisation is conducted. The methods are applied in analysis and simulation settings where the surface dimension is higher than what the isotonic regression literature typically considers. Simulation shows that iPIPE-based credible intervals achieve nominal coverage probability and are more precise compared to unconstrained estimation.

关键词： clinical decision support tool partial ordering posterior quantiles sweep algorithm weighted posterior gain

来源：评论

学校读者我要写书评

暂无评论

A heuristic based approach to vehicle routing model for Third Party Reverse Logistics provider

引用

INTERNATIONAL JOURNAL OF SERVICES TECHNOLOGY AND MANAGEMENT 2009年第1期12卷 106-125页

作者： Sasikumar, P. Kannan, Govindan Haq, A. Noorul Natl Inst Technol Dept Prod Engn Tiruchirappalli 620015 Tamil Nadu India Univ Southern Denmark Dept Business & Econ Odense Denmark

Recovery of used products is receiving much attention recently due to growing environmental concern. One of the main difficulties associated with product recovery activities is the degree of uncertainty in terms of timing and quantity of returned products. Thus, managing return flow requires a specialised infrastructure and relatively high handling cost and time. For that reason, demand for reverse logistics services from Third Party Reverse Logistics (3PRLs) providers is increasing. Vehicle routing plays a central role in logistics management. The aim of this study is to introduce a heuristic based approach for solving the Vehicle Routing Problem (VRP) of 3PRLs which can be described as the problem of designing optimal routes from one depot to a number of customers subject to constraints.

关键词： 3PRLs third party reverse logistics VRP vehicle routing problem TS tabu search sweep algorithm Clarke-Wright algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：