Results 21 to 30 of about 221,092 (272)
Fitting censored quantile regression by variable neighborhood search [PDF]
, 2015 Quantile regression is an increasingly important topic in statistical analysis. However, fitting censored quantile regression is hard to solve numerically because the objective function to be minimized is not convex nor concave in regressors. Performance
AD Toksari +40 more
core +1 more source
Mathematics, 2023 Logistics problems represent an important class of real-world problems where even small improvements in solution quality can lead to significant decreases in operational costs.
Luka Matijević +2 more
doaj +1 more source
Designing WDM networks by a variable neighborhood search
Journal of Telecommunications and Information Technology, 2006 With the ever-rising data volume that is demanded by the market, network planning in order to minimize the necessary investment while meeting the demands is constantly an important task for the network providers.
Belén Melián-Batista +2 more
doaj +1 more source
IEEE Access, 2023 In recent years, some phenomena such as the COVID-19 pandemic have caused the autonomous vehicle (AV) to attract much attention in theoretical and applied research.
Maryam Farahani +2 more
doaj +1 more source
Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
Computers & Operations Research, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lai, Xiangjing +3 more
openaire +2 more sources
A Modified Migrating Birds Optimization for Multi-Objective Lot Streaming Hybrid Flowshop Scheduling
Shanghai Jiaotong Daxue xuebao, 2022 This paper proposes an adaptive migrating birds optimization (AMBO) method based on variable neighborhood search to solve the inequal lot streaming hybrid flowshop scheduling problem (ILS-HFSP) for a 2+1+1 hybrid flowshop, which realizes multi-objective ...
TANG Hongtao, WANG Dannan, SHAO Yiping, ZHAO Wenbin, JIANG Weiguang, CHEN Qingfeng
doaj +1 more source
Bringing order into the neighborhoods: relaxation guided variable neighborhood search [PDF]
Journal of Heuristics, 2007 In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new Variable Neighborhood Descent (VND) algorithm. The ordering of the neighborhood structures in this VND is determined dynamically by solving relaxations of them. The objective
Puchinger, Jakob, Raidl, Günther
openaire +2 more sources
A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem
Mathematics, 2022 The dynamic single row facility layout problem (DSRFLP) is defined as the problem of arranging facilities along a straight line during a multi-period planning horizon with the objective of minimizing the sum of the material handling and rearrangement ...
Gintaras Palubeckis +2 more
doaj +1 more source
Multiobjective Scheduling of Logistics UAVs Based on Variable Neighborhood Search
Applied Sciences, 2020 This study focuses on the issue of logistics Unmanned Aerial Vehicle (UAV) distribution in urban environment and an automatic delivery system to support the delivery of packages.
Yixuan Li +4 more
doaj +1 more source
New variable neighborhood search method for minimum sum coloring problem on simple graphs [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2018 The minimum sum coloring problem (MSCP) is to find a legal vertex coloring for G using colors represented by natural numbers (1,2, . . .) such that the total sum of the colors assigned to the vertices is minimized. The aim of this paper is to present the
Kh. Erfani, S. Rahimi, J. fathali
doaj +1 more source