Results 11 to 20 of about 109,601 (167)

Adaptive large neighborhood search for mixed integer programming [PDF]

open access: yesMathematical Programming Computation, 2021
AbstractLarge Neighborhood Search (LNS) heuristics are among the most powerful but also most expensive heuristics for mixed integer programs (MIP). Ideally, a solver adaptively concentrates its limited computational budget by learning which LNS heuristics work best for the MIP problem at hand.
openaire   +1 more source

The Dynamic Electric Carsharing Relocation Problem

open access: yesEURO Journal on Transportation and Logistics, 2021
This article addresses a relocation and recharging problem faced by modern carsharing operators who manage a fleet of electric vehicles. As customers utilize the fleet, batteries are depleted and vehicles are possibly left in low-demand locations ...
Simen Hellem   +5 more
doaj   +1 more source

Buffer capacity allocation in unreliable production lines: An adaptive large neighborhood search approach

open access: yesEngineering Science and Technology, an International Journal, 2021
The design of a production line directly affects the system performance which is usually measured by its throughput. The problem involving determination of the optimal capacity and location of the buffers in a production line is known as the buffer ...
Mehmet Ulaş Koyuncuoğlu, Leyla Demir
doaj   +1 more source

Modified ALNS Algorithm for a Processing Application of Family Tourist Route Planning: A Case Study of Buriram in Thailand

open access: yesComputation, 2021
This research presents a solution to the family tourism route problem by considering daily time windows. To find the best solution for travel routing, the modified adaptive large neighborhood search (MALNS) method, using the four destructions and the ...
Narisara Khamsing   +4 more
doaj   +1 more source

Matheuristic search techniques for the consistent inventory routing problem with time windows and split deliveries

open access: yesOperations Research Perspectives, 2020
This article introduces a new variant of the inventory routing problem related to real-world businesses. Specifically, in the beverage industry, business customers such as restaurants and bars, demand consistent delivery times, have different opening ...
Emilio J. Alarcon Ortega   +2 more
doaj   +1 more source

Adaptive Large Neighborhood Search Metaheuristic for the Capacitated Vehicle Routing Problem with Parcel Lockers

open access: yesLogistics, 2023
Background: The growth of e-commerce necessitates efficient logistics management to address rising last-mile delivery challenges. To overcome some of the last-mile delivery costs, parcel lockers as a delivery option, can be an alternative solution.
Amira Saker, Amr Eltawil, Islam Ali
doaj   +1 more source

Adaptive Large Neighborhood Search to Solve Multi-Level Scheduling and Assignment Problems in Broiler Farms

open access: yesJournal 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

Mobility offer allocations in corporate settings

open access: yesEURO Journal on Computational Optimization, 2021
Corporate mobility is often based on a fixed assignment of vehicles to employees. Relaxing this fixation and including alternatives such as public transportation or taxis for business and private trips could increase fleet utilization and foster the use ...
Sebastian Knopp   +2 more
doaj   +1 more source

An adaptive large neighborhood search for the multiple-day music rehearsal problems

open access: yesComputers & Industrial Engineering, 2021
Abstract This paper presents an Adaptive Large Neighborhood Search (ALNS) framework to solve the Multiple-Day Music Rehearsal Problem (MMRP), where music pieces with different player sets and durations are arranged in a predefined number of rehearsal days so that the total days of attendance and waiting times experienced by all players are minimized.
Jarumaneeroj, Pisit, Sakulsom, Noppadon
openaire   +1 more source

Multi-objective Discrete Combinatorial Optimization Algorithm Combining Problem-Decomposition and Adaptive Large Neighborhood Search [PDF]

open access: yesJisuanji kexue yu tansuo
In order to efficiently obtain solutions for large-scale multi-objective optimization problems in reality, to achieve a balance among convergence, diversity, and uniformity has gradually become one of the important goals in multi-objective optimization ...
WEI Qian, JI Bin
doaj   +1 more source

Home - About - Disclaimer - Privacy