Results 21 to 30 of about 450,572 (276)
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
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
The Dynamic Electric Carsharing Relocation Problem
EURO 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
Variable Neighborhood Search for the Two-Echelon Electric Vehicle Routing Problem with Time Windows
Applied Sciences, 2022 Increasing environmental concerns and legal regulations have led to the development of sustainable technologies and systems in logistics, as in many fields.
Mehmet Anıl Akbay +3 more
doaj +1 more source
Mathematics, 2020 In this paper, an integrated production and distribution problem for perishable products is presented, which is an NP hard problem where a single machine, multi-customers, and homogenous vehicles with capacity constraints are considered. The objective is
Ling Liu, Sen Liu
doaj +1 more source
Simulated annealing with large-neighborhood search for two-echelon location routing problem
工程科学学报, 2017 Considering the multi-level distribution network has becoming more and more common, a two-echelon location routing problem (2E-LRP) model was established based on minimum total cost objective function.
LI Xiang, LI Su-jian, LI Hong
doaj +1 more source
Algorithms, 2021 For decades, the use of weights has proven its superior ability to improve dynamic local search weighting algorithms’ overall performance. This paper proposes a new mechanism where the initial clause’s weights are dynamically allocated based on the ...
Abdelraouf Ishtaiwi +4 more
doaj +1 more source
Large neighborhood search for the most strings with few bad columns problem [PDF]
, 2016 In this work, we consider the following NP-hard combinatorial optimization problem from computational biology. Given a set of input strings of equal length, the goal is to identify a maximum cardinality subset of strings that differ maximally in a pre ...
Blesa Aguilera, Maria Josep +3 more
core +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
Operations 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