Results 31 to 40 of about 11,269,656 (310)
Bilevel large neighborhood search for the electric autonomous dial-a-ride problem
Transportation Research Interdisciplinary Perspectives, 2023 The electric autonomous dial-a-ride problem (E-ADARP) represents a challenging and practically relevant extension of the dial-a-ride problem, which takes electric vehicle charging into account. It introduces battery constraints and the option to recharge
Steffen Limmer
doaj +1 more source
Transportation Research Record, 2021 Decision-makers in synchromodal transport (ST) have different preferences toward different objectives, such as cost, time, and emissions. To solve the conflicts among objectives and obtain preferred solutions, a preference-based multi-objective ...
Yimeng Zhang, B. Atasoy, R. Negenborn
semanticscholar +1 more source
Neighborhood detection and rule selection from cellular automata patterns [PDF]
, 1999 Using genetic algorithms (GAs) to search for cellular automation (CA) rules from spatio-temporal patterns produced in CA evolution is usually complicated and time-consuming when both, the neighborhood structure and the local rule are searched ...
Billings, S.A., Yang, Y.X.
core +2 more sources
Journal of Industrial and Management Optimization, 2022 In considering route optimization from multiple distribution centers called depots via some intermediate facilities called satellites to final customers with multiple commodities request, we introduce the Multi-Commodity Two-Echelon Vehicle Routing ...
Shengyang Jia +3 more
semanticscholar +1 more source
Journal of Open Innovation: Technology, Market and Complexity, 2019 This research aimed to present a solution to the problem of production scheduling and assignment in broiler farms, which thus enabled the farms to achieve maximum profit.
Natthanan Praseeratasang +5 more
doaj +1 more source
Large Quasi-Tree Drawing: A Neighborhood Based Approach [PDF]
2009 13th International Conference Information Visualisation, 2009 In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects have shown the interest of devicing dedicated tools for visualizing such graphs. Our method addresses a challenging problem which consists in computing a layout of large graphs (
Bourqui, Romain, Auber, David
openaire +3 more sources
An adaptive neutrosophic large neighborhood search and its application [PDF]
Neutrosophic Sets and SystemsAn adaptive large neighborhood search (ALNS) lacks a clear measure for assessing the improvement degree in the new solution, which causes fuzziness and uncertainty in the operator score.
Jun Jiang +4 more
doaj +1 more source
International Journal of Health Geographics, 2020 Background Virtual neighborhood audits have been used to visually assess characteristics of the built environment for health research. Few studies have investigated spatial predictive properties of audit item responses patterns, which are important for ...
Jesse J. Plascak +6 more
doaj +1 more source
Practical characterization of large networks using neighborhood information [PDF]
Knowledge and Information Systems, 2018 Characterizing large online social networks (OSNs) through node querying is a challenging task. OSNs often impose severe constraints on the query rate, hence limiting the sample size to a small fraction of the total network. Various ad-hoc subgraph sampling methods have been proposed, but many of them give biased estimates and no theoretical basis on ...
Wang, Pinghui +5 more
openaire +3 more sources
Multi-Objective Large Neighborhood Search [PDF]
, 2013 Large neighborhood search (LNS) [25] is a framework that combines the expressiveness of constraint programming with the efficiency of local search to solve combinatorial optimization problems. This paper introduces an extension of LNS, called multi-objective LNS (MO-LNS), to solve multi-objective combinatorial optimization problems ubiquitous in ...
Pierre Schaus, Renaud Hartert
openaire +1 more source