A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
A Memetic Algorithm for the Linear Ordering Problem with Cumulative Costs
[article]
2014
arXiv
pre-print
Preserved Fulltext
This paper introduces an effective memetic algorithm for the linear ordering problem with cumulative costs. ...
The proposed algorithm combines an order-based recombination operator with an improved forward-backward local search procedure and employs a solution quality based replacement criterion for pool updating ...
Acknowledgments We are grateful for comments by the referees for their comments that help us improve the paper. This ...
arXiv:1405.4510v1
fatcat:iwfm6zdp4baybddy4dyvngv5ta
Dual objective oil and gas field development project optimization of stochastic time cost tradeoff problems
2018
Advances in Geo-Energy Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Analysis of an example project, applying eight distinct work-item time-cost relationships, demonstrates with the aid of metaheuristic profiling, that the memetic STCTP algorithm coded in Visual Basic for ...
Keywords: Stochastic project time-cost tradeoff problems TCTP dual-objective nondominated sorting optimization memetic optimization algorithm with chaotic sampling metaheuristic profiling pareto frontier ...
, provided the original work is properly cited. ...
doi:10.26804/ager.2018.01.02
fatcat:r3sip6awljeafppbmpl2iqpw7i
EVOLUTIONARY ALGORITHMS FOR CAPACITATED ARC ROUTING PROBLEMS WITH TIME WINDOWS
2006
IFAC Proceedings Volumes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper presents this new model and a memetic algorithm with new memetic operators able to tackle the time windows constraints in arc routing. ...
The Capacitated Arc Routing Problem (CARP) involves vehicles routing, serving a set of arcs in a network. ...
This research shows that memetic algorithm can obtain good solutions to arc routing problems with time windows compared to insertion heuristics. ...
doi:10.3182/20060517-3-fr-2903.00174
fatcat:7lscsz4gd5aadcmxydlnd5p5ki
Solving Linear Systems of Equations using a Memetic Algorithm
2012
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper proposes a memetic algorithm (MA) to solve linear systems of equations, by transforming the linear system of equations into an optimization problem. ...
In cases where no accurate solution for a linear system of equations exists, an approximate solution can be acceptable and it can be obtained by the proposed method. General Terms Algorithms. ...
Memetic algorithms are a family of metaheuristics for optimization that combine different algorithmic approaches for solving a problem. ...
doi:10.5120/9341-3658
fatcat:rrfccqhxdnhafl77o5dktsiytq
Hybrid evolutionary techniques for the maintenance scheduling problem
2000
IEEE Transactions on Power Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
The resulting algorithm from this hybrid approach has been termed a Memetic Algorithm. This paper investigates the use of a memetic algorithm for the thermal generator maintenance scheduling problem. ...
We compare the memetic algorithms with a variety of algorithms that include the local search operators on their own and a range of algorithms that apply the local search operator to randomly generated ...
It would be interesting to see whether the algorithm presented here could be usefully applied to this problem, and also if the technique can produce good results for a related problem in the electricity ...
doi:10.1109/59.852110
fatcat:kgydn7valrhnhexbyam7okdnae
Bankruptcy Prediction Using Memetic Algorithm with Fuzzy Approach: Empirical Evidence from Iran
2012
International Journal of Economics and Finance
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Thus we develop a Hybrid model which is an adaptive Memetic Algorithm combined with fuzzy approach that generates and optimizes a set of if-then rules for bankruptcy prediction. ...
In order to facilitate investor's decision making regarding potential investment opportunities, this paper seeks to demonstrate that it is model specific constraints that limits the usefulness of accounting ...
Furthermore, suppose that the local search produces a new individual i' with f(i') < f(i) for a minimization problem. The designer of the algorithm must now choose between two alternative options. ...
doi:10.5539/ijef.v4n5p116
fatcat:l6ytsd72f5dixoioraturi5zmq
Multiobjective Memetic Algorithm Applied to the Optimisation of Water Distribution Systems
2014
Water resources management
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A novel multi-objective memetic algorithm (MA) is introduced as a solution method to this type of problem. ...
The MA hybridises a robust genetic algorithm (GA) with a local improvement operator consisting of the classic Hooke and Jeeves direct search method and a cultural learning component. ...
Conclusions A memetic algorithm (MA) is developed and compared with a robust and widely used genetic algorithm (GA) in the solution of the least-cost water distribution system (WDS) design problem. ...
doi:10.1007/s11269-014-0608-0
fatcat:44wu2g7dcnbxtm6obmwwoymmoq
A memetic algorithm for the vehicle routing problem with time windows
2008
Reserche operationelle
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The proposed solution method is a memetic algorithm (MA), a genetic algorithm hybridised with a local search. ...
This article deals with the vehicle routing problem with time windows (VRPTW). This problem consists in determining a leastcost set of trips to serve customers during specific time windows. ...
CGH is a sophisticated cooperative method, alternating between a genetic algorithm, which builds a set of high-quality trips, and the resolution of a partitioning problem with a public domain linear programming ...
doi:10.1051/ro:2008021
fatcat:loxzijpv2vfqroo36qvmmmnste
Application of Shuffled Frog Leaping Algorithm to Long Term Generation Expansion Planning
2012
International Journal of Computer and Electrical Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Least-cost GEP is concerned with a highly constrained non-linear discrete dynamic optimization problem. ...
The SFLA is a novel meta-heuristic optimization method inspired from the natural memetic evolution of a group of frogs when searching for the location that has the maximum amount of available food [6] ...
Least-cost GEP is concerned with a highly constrained non-linear discrete dynamic optimization problem. ...
doi:10.7763/ijcee.2012.v4.461
fatcat:fvnsvdttcvgjja46aeuq4wzog4
Improving Iterated Local Search Solution for the Linear Ordering Problem with Cumulative Costs (LOPCC)
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper the linear ordering problem with cumulative costs is approached. The best known algorithm solution for the problem is the tabu search proposed by Duarte. ...
The results show that the heuristic construction phase has a major impact on the tabu search algorithm performance, which tends to diminish with large instances. ...
Linear Ordering Problem with Cumulative Costs (LOPCC) Now we review the works directly related to the Linear Ordering Problem with Cumulative Costs (LOPCC). ...
doi:10.1007/978-3-642-15390-7_19
fatcat:pb66x7pmbbes3apawgngu6dcam
Single Vs Hierarchical Population-Based Memetic Algorithm for Sat-Encoded Industrial Problems:A Statistical Comparison
2012
International Journal of Artificial Intelligence & Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this work, a hierarchical population-based memetic algorithm for solving the satisfiability problem is presented. ...
KEYWORDS Satisfiability problem, Memetic algorithm, Hierarchical algorithm, ...
CONCLUSION A new approach for solving the satisfiability problem based on a hierarchical memetic algorithm is presented. ...
doi:10.5121/ijaia.2012.3607
fatcat:zf2rvlafszczflzo4fefnpmo2i
A Parallel Memetic Algorithm to Solve the Vehicle Routing Problem with Time Windows
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper presents a parallel memetic algorithm for solving the vehicle routing problem with time windows (VRPTW). ...
The VRPTW is a well-known NP-hard discrete optimization problem with two objectives. ...
Centre for Mathematical and Computational Modeling, Warsaw University, Wroc law Centre for Networking and Supercomputing. ...
arXiv:1402.6942v1
fatcat:vyjsvspbnvdxhpbsp5xvil353y
An Efficient Evolutionary Metaheuristic for the Traveling Repairman (Minimum Latency) Problem
2020
International Journal of Computational Intelligence Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
These algorithms have proven to be efficient approaches for the solution of NP-hard discrete optimization problems such as the Traveling Salesman Problem (TSP) with Time Windows. ...
A B S T R A C T In this paper we revisit the memetic evolutionary family of metaheuristics, called Discrete Bacterial Memetic Evolutionary Algorithm (DBMEA), whose members combine Furuhashi's Bacterial ...
Garcia et al. introduced an even better, linear algorithm for the TRP on a path [5] . ...
doi:10.2991/ijcis.d.200529.001
fatcat:6b4hfjjkp5c3fpyfttyolupk2m
A Comparison of Population-based Optimization Techniques for Water Distribution System Expansion and Operation
2014
Procedia Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents a water distribution system expansion and operation methodology employing population-based optimization algorithms applied to the Battle of Background Leakage Assessment for Water Networks ...
The problem is formulated as constrained single and multiple-objective optimization problems and implemented in a generic hydraulic optimization and benchmarking software application (Acquamark). ...
The initial results for the memetic algorithms and Parallel Differential Evolution were disappointing. ...
doi:10.1016/j.proeng.2014.11.154
fatcat:bazode2ykjafnlwgks34lycx3a
A direct memetic approach to the solution of Multi-Objective Optimal Control Problems
2016
2016 IEEE Symposium Series on Computational Intelligence (SSCI)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The MOOCP is first transcribed into a Non-linear Programming Problem (NLP) with Direct Finite Elements in Time (DFET) and then solved with a particular formulation of the Multi Agent Collaborative Search ...
Multi Agent Collaborative Search is a memetic algorithm in which a population of agents combines local search heuristics, exploring the neighbourhood of each agent, with social actions exchanging information ...
The optimal control problem is first transcribed into a Non-linear Programming Problem with Direct Finite Element Transcritpion (DFET) [6] and then into two optimisation problems: a bilevel optimisation ...
doi:10.1109/ssci.2016.7850103
dblp:conf/ssci/VasileR16
fatcat:vzvneptk7zfthnflhgaikynumu
« Previous
Showing results 1 — 15 out of 445 results