Results 271 to 280 of about 11,269,656 (310)
Some of the next articles are maybe not open access.
Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search
AAAI Conference on Artificial Intelligence, 2023Anytime multi-agent path finding (MAPF) is a promising approach to scalable path optimization in large-scale multi-agent systems. State-of-the-art anytime MAPF is based on Large Neighborhood Search (LNS), where a fast initial solution is iteratively ...
Thomy Phan +3 more
semanticscholar +1 more source
IEEE Transactions on Reliability, 2022
Spatial resource allocation is common in batch scheduling problems. It is usually modeled as simple capacity constraints, which hurts the accuracy of a solution if a geometric layout is required in multidimensional space.
Jiang Zeng, Xiaopan Zhang
semanticscholar +1 more source
Spatial resource allocation is common in batch scheduling problems. It is usually modeled as simple capacity constraints, which hurts the accuracy of a solution if a geometric layout is required in multidimensional space.
Jiang Zeng, Xiaopan Zhang
semanticscholar +1 more source
Very Large-Scale Neighborhood Search
2021Very Large-Scale Neighborhood Search is not an algorithm or a class of algorithms, but rather a conceptual framework which can be used for solving combinatorial optimization problems. The approach “concentrates on neighborhood search algorithms where the size of the neighborhood is ‘very large’ with respect to the size of the input data.” Typically ...
Maniezzo, Vittorio +2 more
openaire +2 more sources
Neural large neighborhood search for routing problems
Artificial Intelligence, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
André Hottung, Kevin Tierney
openaire +2 more sources
Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem
European Conference on Artificial Intelligence, 2019Learning how to automatically solve optimization problems has the potential to provide the next big leap in optimization technology. The performance of automatically learned heuristics on routing problems has been steadily improving in recent years, but ...
André Hottung, Kevin Tierney
semanticscholar +1 more source
IEEE Transactions on Aerospace and Electronic Systems
Super-agile satellites are high-performance earth observation satellites with active push-brooming capability and a real-time attitude control system.
Guohua Wu +4 more
semanticscholar +1 more source
Super-agile satellites are high-performance earth observation satellites with active push-brooming capability and a real-time attitude control system.
Guohua Wu +4 more
semanticscholar +1 more source
Propagation Guided Large Neighborhood Search
2004In this article, we explore how neighborhoods for the Large Neighborhood Search (LNS) framework can be automatically defined by the volume of propagation of our Constraint Programming (CP) solver. Thus we can build non trivial neighborhoods which will not be reduced to zero by propagation and whose size will be close to a parameter of the search ...
Laurent Perron +2 more
openaire +1 more source
IEEE transactions on intelligent transportation systems (Print), 2020
The generalized lock scheduling problem (GLSP) is a mixed integer optimization problem which consists of a ship placement (SP) and a lockage operation scheduling (LOS) sub-problem. In previous research, the GLSP is solved by different exact and heuristic
Bin Ji +4 more
semanticscholar +1 more source
The generalized lock scheduling problem (GLSP) is a mixed integer optimization problem which consists of a ship placement (SP) and a lockage operation scheduling (LOS) sub-problem. In previous research, the GLSP is solved by different exact and heuristic
Bin Ji +4 more
semanticscholar +1 more source
Very Large-Scale Neighborhood Search
2013One of the central issues in developing neighborhood search techniques is defining the neighborhood. As a rule of thumb, larger neighborhoods contain higher quality local optimal solutions compared to smaller neighborhoods. However, larger neighborhoods also typically require more time to search than smaller neighborhoods.
Douglas S. Altner +3 more
openaire +1 more source
An Adaptive Large Neighborhood Search for the Location-routing Problem with Intra-route Facilities
Transportation Science, 2018Recent research on location-routing problems has been focusing on locating facilities as the starting and end point of routes. In this paper, we investigate a new type of location-routing problem.
Maximilian Schiffer, G. Walther
semanticscholar +1 more source