Results 61 to 70 of about 109,601 (167)
Penalized Likelihood Methods for Estimation of Sparse High Dimensional Directed Acyclic Graphs
, 2009 Directed acyclic graphs (DAGs) are commonly used to represent causal relationships among random variables in graphical models. Applications of these models arise in the study of physical, as well as biological systems, where directed edges between nodes ...
A. Shojaie, G. Michailidis, Huang
core +5 more sources
An Adaptive Large Neighborhood Search for a Green Vehicle Routing Problem with Depot Sharing
MathematicsIn urban logistics distribution, vehicle carbon emissions during the distribution process significantly contribute to environmental pollution. While developing green logistics is critical for the sustainable growth of the logistics industry, existing ...
Zixuan Wu +4 more
doaj +1 more source
The Self-Organization of Interaction Networks for Nature-Inspired Optimization
, 2009 Over the last decade, significant progress has been made in understanding complex biological systems, however there have been few attempts at incorporating this knowledge into nature inspired optimization algorithms.
Pham, Q. Tuan +2 more
core +1 more source
An adaptive large neighborhood search for a vehicle routing problem with cross-dock under dock resource constraints [PDF]
, 2015 International audienceIn this work, we study the impact of dock resource constraints on the cost of VRPCD ...
Gendreau, Michel +3 more
core +2 more sources
Seven ways to improve example-based single image super resolution
, 2015 In this paper we present seven techniques that everybody should know to improve example-based single image super resolution (SR): 1) augmentation of data, 2) use of large dictionaries with efficient search structures, 3) cascading, 4) image self ...
Rothe, Rasmus +2 more
core +1 more source
Reinforced Adaptive Large Neighborhood Search
, 2011 The Large Neighborhood Search metaheuristic for solving Constrained Optimization Problems has been proved to be effective on a wide range of problems. This Local Search heuristic has the particu- larity of using a complete search (such as Constraint Programming) to explore the large neighborhoods obtained by relaxing a fragment of the variables of the ...
Mairy, Jean-Baptiste +3 more
openaire +1 more source
Location Decision Making and Transportation Route Planning Considering Fuel Consumption
Journal of Open Innovation: Technology, Market and Complexity, 2019 This study presents the Location Routing Problem (LRP) for which we have created a model for the integration of locating facilities and vehicle routing decisions to solve the problem.
Chalermchat Theeraviriya +3 more
doaj +1 more source
Complexity, 2020 Due to huge amount of greenhouse gases emission (such as CO2), freight has been adversely affecting the global environment in facilitating the global economy.
Zixuan Yu +4 more
doaj +1 more source
Alexandria Engineering JournalMost existing logistics optimization models assume static demand or ignore transportation replenishment, which limits their applicability in dynamic agricultural environments.
Delong Zhu +8 more
doaj +1 more source
Operator Selection in Adaptive Large Neighborhood Search using Deep Reinforcement Learning
arXiv, 2022 Large Neighborhood Search (LNS) is a popular heuristic for solving combinatorial optimization problems. LNS iteratively explores the neighborhoods in solution spaces using destroy and repair operators. Determining the best operators for LNS to solve a problem at hand is a labor-intensive process.
Reijnen, Robbert +3 more
openaire +1 more source