Results 91 to 100 of about 450,226 (197)
Improved Differential Evolution Algorithm to Solve the Advertising Method Selection Problem
Journal of Open Innovation: Technology, Market and Complexity, 2019 This article proposes a methodology to resolve the advertising method selection problem (AdSP). The use of different advertising methods for the same product can generate different responses in terms of the product’s sales volume. Companies selling
Malichan Thongkham, Tassin Srivarapongse
doaj +1 more source
Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
, 2017 We propose a new genetic algorithm with optimal recombination for the asymmetric instances of travelling salesman problem. The algorithm incorporates several new features that contribute to its effectiveness: (i) Optimal recombination problem is solved ...
AV Eremeev +12 more
core +1 more source
Applied SciencesCompared to fossil fuel-based internal combustion vehicles, electric vehicles with lower local pollution and noise are becoming more and more popular in urban logistic distribution.
Dan Wang, Weibo Zheng, Hong Zhou
doaj +1 more source
Fast and Readable Layered Network Visualizations Using Large Neighborhood Search
IEEE Transactions on Visualization and Computer GraphicsLayered network visualizations assign each node to one of several parallel axes. They can convey sequence or flow data, hierarchies, or multiple data classes, but edge crossings and long edges often impair readability. Layout algorithms can reduce edge crossings and shorten edges using quick heuristics or optimal methods that prioritize human ...
Connor Wilson +3 more
openaire +2 more sources
Local Search Techniques for Constrained Portfolio Selection Problems
, 2001 We consider the problem of selecting a portfolio of assets that provides the investor a suitable balance of expected return and risk. With respect to the seminal mean-variance model of Markowitz, we consider additional constraints on the cardinality of ...
Schaerf, Andrea
core +1 more source
The Path Planning Problem of Robotic Delivery in Multi-Floor Hotel Environments
SensorsRobots have been widely adopted in transportation and delivery applications. Path planning plays a critical role in determining the performance of robotic systems in these tasks.
Linghui Han +3 more
doaj +1 more source
, 2016 We consider the problem of scheduling multiple, large-scale, make-to-order assemblies under resource, assembly area, and part availability constraints. Such problems typically occur in the assembly of high volume, discrete make-to-order products.
Heß, Karsten, Kolisch, Rainer
core
An adaptive large neighborhood search for a full truckload routing problem in public works [PDF]
, 2015 International audienceThis paper presents a truck routing and scheduling problem faced by a public works company. Itconsists of optimizing the collection and delivery of materials between sites, using a heterogeneousfleet of vehicles.
Bostel, Nathalie +3 more
core +2 more sources
Large Neighborhood Search for Variants of TSP
, 2007 To solve problems with Local Search procedures, neighborhoods have to be defined. During the resolution, a solution is typically replaced by the best solution found in its neighborhood. A question concerns the size of the neighborhood. If a small neighborhood can be explored in polynomial time, a large neighborhood search may bring a faster convergence
Bontoux, Boris +2 more
openaire +1 more source
A Lin-Kernighan Heuristic for Single Row Facility Layout [PDF]
The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is known to be NP-hard.
Ghosh, Diptesh, Kothari, Ravi
core