Hybrid Cooperative Co-Evolution Algorithm for Uncertain Vehicle Scheduling
As a typical scheduling problem, the vehicle scheduling problem (VSP) plays a significant role in public transportation systems. VSP is difficult to solve, since it is classified as a high-dimensional combination optimization problem, which is well known as an NP-hard problem. Although the existing...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2018-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8268102/ |
id |
doaj-3ac563fafe024df1b9d11e1414e06474 |
---|---|
record_format |
Article |
spelling |
doaj-3ac563fafe024df1b9d11e1414e064742021-03-29T21:33:25ZengIEEEIEEE Access2169-35362018-01-016717327174210.1109/ACCESS.2018.27972688268102Hybrid Cooperative Co-Evolution Algorithm for Uncertain Vehicle SchedulingLu Sun0https://orcid.org/0000-0001-7779-4484Lin Lin1Haojie Li2Mitsuo Gen3School of Software, Dalian University of Technology, Dalian, ChinaDUT-RU International School of Information Science and Engineering, Dalian University of Technology, Dalian, ChinaDUT-RU International School of Information Science and Engineering, Dalian University of Technology, Dalian, ChinaFuzzy Logic Systems Institute, Iizuka, JapanAs a typical scheduling problem, the vehicle scheduling problem (VSP) plays a significant role in public transportation systems. VSP is difficult to solve, since it is classified as a high-dimensional combination optimization problem, which is well known as an NP-hard problem. Although the existing studies on VSP usually assume that all factors in the problem are deterministic and known in advance, various uncertain factors are always present in practical applications, in particular uncertain processing time. In this paper, we consider the problem of VSP with an uncertain processing time. In order to solve this problem, a hybrid cooperative co-evolution algorithm (hccEA) is proposed. First, we design two-phase encoding and decoding mechanisms with the aim to search a larger solution space and filter infeasible solutions for the genetic algorithm (GA) and particle swarm optimization (PSO). Second, to overcome performance degradation due to high-dimensional variables, a modified PSO is embedded into the cooperative co-evolution framework, which is called ccPSO. Third, a self-adaptive mechanism for parameters of PSO is proposed to balance the uncertain factors. Then, the GA and the ccPSO work alternately in an iterative way. Finally, numerical experiments under an uncertain environment verify the superiority of the proposed hccEA based on comparisons with state-of-the-art algorithms.https://ieeexplore.ieee.org/document/8268102/Cooperative co-evolutionevolutionary optimizationvehicle schedulinguncertainty |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Lu Sun Lin Lin Haojie Li Mitsuo Gen |
spellingShingle |
Lu Sun Lin Lin Haojie Li Mitsuo Gen Hybrid Cooperative Co-Evolution Algorithm for Uncertain Vehicle Scheduling IEEE Access Cooperative co-evolution evolutionary optimization vehicle scheduling uncertainty |
author_facet |
Lu Sun Lin Lin Haojie Li Mitsuo Gen |
author_sort |
Lu Sun |
title |
Hybrid Cooperative Co-Evolution Algorithm for Uncertain Vehicle Scheduling |
title_short |
Hybrid Cooperative Co-Evolution Algorithm for Uncertain Vehicle Scheduling |
title_full |
Hybrid Cooperative Co-Evolution Algorithm for Uncertain Vehicle Scheduling |
title_fullStr |
Hybrid Cooperative Co-Evolution Algorithm for Uncertain Vehicle Scheduling |
title_full_unstemmed |
Hybrid Cooperative Co-Evolution Algorithm for Uncertain Vehicle Scheduling |
title_sort |
hybrid cooperative co-evolution algorithm for uncertain vehicle scheduling |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2018-01-01 |
description |
As a typical scheduling problem, the vehicle scheduling problem (VSP) plays a significant role in public transportation systems. VSP is difficult to solve, since it is classified as a high-dimensional combination optimization problem, which is well known as an NP-hard problem. Although the existing studies on VSP usually assume that all factors in the problem are deterministic and known in advance, various uncertain factors are always present in practical applications, in particular uncertain processing time. In this paper, we consider the problem of VSP with an uncertain processing time. In order to solve this problem, a hybrid cooperative co-evolution algorithm (hccEA) is proposed. First, we design two-phase encoding and decoding mechanisms with the aim to search a larger solution space and filter infeasible solutions for the genetic algorithm (GA) and particle swarm optimization (PSO). Second, to overcome performance degradation due to high-dimensional variables, a modified PSO is embedded into the cooperative co-evolution framework, which is called ccPSO. Third, a self-adaptive mechanism for parameters of PSO is proposed to balance the uncertain factors. Then, the GA and the ccPSO work alternately in an iterative way. Finally, numerical experiments under an uncertain environment verify the superiority of the proposed hccEA based on comparisons with state-of-the-art algorithms. |
topic |
Cooperative co-evolution evolutionary optimization vehicle scheduling uncertainty |
url |
https://ieeexplore.ieee.org/document/8268102/ |
work_keys_str_mv |
AT lusun hybridcooperativecoevolutionalgorithmforuncertainvehiclescheduling AT linlin hybridcooperativecoevolutionalgorithmforuncertainvehiclescheduling AT haojieli hybridcooperativecoevolutionalgorithmforuncertainvehiclescheduling AT mitsuogen hybridcooperativecoevolutionalgorithmforuncertainvehiclescheduling |
_version_ |
1724192624526491648 |