Results 1 to 10 of about 9,501,678 (288)
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
David Pisinger, Stefan Ropke
core +7 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
exaly +4 more sources
Large Neighborhood Search for Electric Vehicle Fleet Scheduling
Energies, 2023 This work considers the problem of planning how a fleet of shared electric vehicles is charged and used for serving a set of reservations. While exact approaches can be used to efficiently solve small to medium-sized instances of this problem, heuristic ...
Steffen Limmer +2 more
doaj +1 more source
A hybrid VNS matheuristic for a bin packing problem with a color constraint [PDF]
Yugoslav Journal of Operations Research, 2021 We study a new variant of the bin packing problem with a color constraint. Given a finite set of items, each item has a set of colors. Each bin has a color capacity, the total number of colors for a bin is the unification of colors for its items and ...
Kochetov Yury, Kondakov Arteam
doaj +1 more source
A Single-Product Multi-Period Inventory Routing Problem under Intermittent Demand
Information, 2023 Demand fluctuations and uncertainty bring challenges to inventory management, and intermittent demand patterns increase the risk of inventory backlogs and raise inventory holding costs.
Xin Song, Daofang Chang, Tian Luo
doaj +1 more source
Explanation-based large neighborhood search [PDF]
Constraints, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lorca, Xavier +2 more
openaire +5 more sources
Large neighborhood local search for the p-median problem [PDF]
Yugoslav Journal of Operations Research, 2005 In this paper we consider the well known p-median problem. We introduce a new large neighborhood based on ideas of S.Lin and B.W. Kernighan for the graph partition problem. We study the behavior of the local improvement and Ant Colony algorithms with new
Kochetov Yuri +3 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
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