Results 31 to 40 of about 10,004,845 (289)
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
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
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 based on Neural Construction Heuristics
CoRR, 2022 We propose a Large Neighborhood Search (LNS) approach utilizing a learned construction heuristic based on neural networks as repair operator to solve the vehicle routing problem with time windows (VRPTW). Our method uses graph neural networks to encode the problem and auto-regressively decodes a solution and is trained with reinforcement learning on ...
Jonas K. Falkner +2 more
openaire +3 more sources
Adaptive large neighborhood search for mixed integer programming [PDF]
Mathematical 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 +2 more sources
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
Engineering 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
Solving DCOPs with Distributed Large Neighborhood Search
CoRR, 2017 The field of Distributed Constraint Optimization has gained momentum in recent years, thanks to its ability to address various applications related to multi-agent cooperation. Nevertheless, solving Distributed Constraint Optimization Problems (DCOPs) optimally is NP-hard.
Ferdinando Fioretto +4 more
openaire +2 more sources