TY  - CONF
EP  - 115
UR  - https://www.scopus.com/inward/record.uri?eid=2-s2.0-84922570845&doi=10.1109%2fMCDM.2014.7007195&partnerID=40&md5=5ab9bfa7f812ba58a61567dee2c75af1
A1  - Pierre, D.M.
A1  - Zakaria, N.
SN  - 9781479944682
PB  - Institute of Electrical and Electronics Engineers Inc.
Y1  - 2015///
KW  - Decision making; Routing algorithms; Vehicle routing; Vehicles
KW  -  Brute-force approach; Comparative studies; Crossover; Crossover operator; Multi-objective genetic algorithm; Mutation; Vehicle routing problem with time windows; Vehicle Routing Problems
KW  -  Genetic algorithms
TI  - Partially optimized cyclic shift crossover for multi-objective genetic algorithms for the multi-objective vehicle routing problem with time-windows
ID  - scholars6053
SP  - 106
N1  - cited By 11; Conference of 2014 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making, MCDM 2014 ; Conference Date: 9 December 2014 Through 12 December 2014; Conference Code:110094
N2  - The complexity of the Vehicle Routing Problems (VRPs) and their applications in our day to day life has garnered a lot of attentions in the area of optimization. Recently, attentions have turned to multi-objective VRPs with Multi-Objective Genetic Algorithms (MOGAs). MOGAs, thanks to its genetic operators such as selection, crossover, and/or mutation, constantly modify a population of solutions in order to find optimal solutions. However, given the complexity of VRPs, conventional crossover operators have major drawbacks. The Best Cost Route Crossover is lately gaining popularity in solving multi-objective VRPs. It employs a brute force approach to generate new children. Such approach may be unacceptable when presented with a relatively large problem instance. In this paper, we introduce a new crossover operator, called Partially Optimized Cyclic Shift Crossover (POCSX). A comparative study, between a MOGA based on POCSX, and a MOGA which is based on the Best Cost Route Crossover affirms the level of competitiveness of the former. © 2014 IEEE.
AV  - none
ER  -