A novel multi-parent order crossover in genetic algorithm for combinatorial optimization problems
Authors:
- Anas ArramAAAnas Arram
- Masri AyobMasri Ayob
- 1 July 2019
- journal article
- research article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 133, 267-274
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Higher Education Malaysia (FRGS/1/2018/ICT02/UKM/01/1)
- Universiti Kebangsaan Malaysia (DIP-2014-039)
This publication has 21 references indexed in Scilit:
- Multi-objective genetic algorithm for berth allocation problem considering daytime preferenceComputers & Industrial Engineering, 2015
- Bird mating optimizer for discrete berth allocation problem2015
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminalsEuropean Journal of Operational Research, 2015
- Comparative Study of Meta-Heuristic Approaches for Solving Traveling Salesman ProblemsAsian Journal of Applied Sciences, 2014
- A new genetic algorithm for solving optimization problemsEngineering Applications of Artificial Intelligence, 2014
- Models for the discrete berth allocation problem: A computational comparisonTransportation Research Part E: Logistics and Transportation Review, 2011
- A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithmsSwarm and Evolutionary Computation, 2011
- Multi-parent extension of sequential constructive crossover for the travelling salesman problemInternational Journal of Operational Research, 2011
- Models and Tabu Search Heuristics for the Berth-Allocation ProblemTransportation Science, 2005
- An Analysis of the Effectiveness of Multi-parent Crossover2004