Results 11 to 20 of about 450,226 (197)
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
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
A Hybrid Large Neighborhood Search Algorithm for Solving the Multi Depot UAV Swarm Routing Problem
IEEE Access, 2021 This paper focuses on a modified Multi-Depot Unmanned Aerial Vehicle Routing Problem (MMDUAVRP). Comparing to classic multi-depot vehicle routing problem, our studied problem has no constraints to restrict the depot where the Unmanned Aerial Vehicle (UAV)
Xiaohui Li +4 more
doaj +1 more source
Aerospace, 2023 The runway system is more likely to be a bottleneck area for airport operations because it serves as a link between the air routes and airport ground traffic.
Jiaming Su +3 more
doaj +1 more source
Discretization-Strategy-Based Solution for Berth Allocation and Quay Crane Assignment Problem
Journal of Marine Science and Engineering, 2022 The continuous berth allocation and quay crane assignment problem considers the size of berths and ships, the number of quay cranes, the dynamic ships and non-crossing constraints of quay cranes.
Min Tang +3 more
doaj +1 more source
Large Neighborhood Search with Decision Diagrams
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022 Local search is a popular technique to solve combinatorial optimization problems efficiently. To escape local minima one generally uses metaheuristics or try to design large neighborhoods around the current best solution. A somewhat more black box approach consists in using an optimization solver to explore a large neighborhood.
Gillard, Xavier, Schaus, Pierre
openaire +2 more sources
Very large‐scale neighborhood search
International Transactions in Operational Research, 2000 AbstractNeighborhood search algorithms are often the most effective approaches available for solving partitioning problems, a difficult class of combinatorial optimization problems arising in many application domains including vehicle routing, telecommunications network design, parallel machine scheduling, location theory, and clustering.
R.K. Ahuja, J.B. Orlin, D. Sharma
openaire +3 more sources
Gaussian variable neighborhood search for the file transfer scheduling problem [PDF]
Yugoslav Journal of Operations Research, 2016 This paper presents new modifications of Variable Neighborhood Search approach for solving the file transfer scheduling problem. To obtain better solutions in a small neighborhood of a current solution, we implement two new local search ...
Dražić Zorica
doaj +1 more source
Large Neighborhood Search [PDF]
, 2010 Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better candidate solutions in each iteration and hence traverse a more
Pisinger, David, Røpke, Stefan
openaire +2 more sources
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