Results 71 to 80 of about 450,226 (197)
An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem [PDF]
, 2016 We study the mixed capacitated general routing problem (MCGRP) in which a fleet of capacitated vehicles has to serve a set of requests by traversing a mixed weighted graph. The requests may be located on nodes, edges, and arcs.
DELL'AMICO, Mauro +3 more
core +3 more sources
A Heuristic Approach for a Real-World Electric Vehicle Routing Problem
Algorithms, 2019 To develop a non-polluting and sustainable city, urban administrators encourage logistics companies to use electric vehicles instead of conventional (i.e., fuel-based) vehicles for transportation services.
Mengting Zhao, Yuwei Lu
doaj +1 more source
Permutation Flowshop Scheduling in ED Aluminium Using Metaheuristic Approaches
Journal of Industrial Engineering and Halal IndustriesThis study proposes metaheuristics to solve the permutation flowshop scheduling problem in ED Aluminium which produces kitchen utensils. The aim is to find the processing sequence of products that results in the shortest total completion time, minimizing
Haposan Vincentius Manalu +4 more
doaj +1 more source
Large Neighborhood Local Search for the Maximum Set Packing Problem [PDF]
, 2013 In this paper we consider the classical maximum set packing problem where set cardinality is upper bounded by $k$. We show how to design a variant of a polynomial-time local search algorithm with performance guarantee $(k+2)/3$. This local search algorithm is a special case of a more general procedure that allows to swap up to $ (\log n)$ elements per
Ward, Justin, Sviridenko, Maxim
openaire +3 more sources
Complete local search with memory [PDF]
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu search, most of these heuristics are memoryless. In this paper we
Ghosh, D., Sierksma, G.
core +1 more source
Complex & Intelligent SystemsThe Vehicle Routing Problems with Soft Time Windows (VRPSTWs) presents a common challenge in practical scenarios, which has spurred the development of various algorithmic solutions.
Hao Jiang +3 more
doaj +1 more source
Adaptive Large Neighborhood Search Enhances Global Network Alignment
VNU Journal of Science: Computer Science and Communication Engineering, 2019 Aligning protein-protein interaction networks from different species is a useful mechanism for figuring out orthologous proteins, predicting/verifying protein unknown functions or constructing evolutionary relationships. The network alignment problem is proved to be NP-hard, requiring exponential-time algorithms, which is not feasible for the fast ...
Do Duc Dong +4 more
openaire +2 more sources
Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems [PDF]
The generalized minimum spanning tree problem is a generalization of the minimum spanning tree problem. This network design problems finds several practical applications, especially when one considers the design of a large-capacity backbone network ...
Ghosh, Diptesh
core
A hybrid adaptive large neighborhood search for time-dependent open electric vehicle routing problem with hybrid energy replenishment strategies. [PDF]
PLoS One, 2023 Fan L.
europepmc +1 more source
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + + [PDF]
, 2009 We present a hybrid solver (called $\mathbb{GELATO}$) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal + + ). $\mathbb{GELATO}$ allows to easily develop and use hybrid meta-heuristic combining CP and LS phases (in particular Large Neighborhood Search).
CIPRIANO, Raffaele +2 more
openaire +2 more sources