I-DCOP: Train Classification Based on an Iterative Process Using Distributed Constraint Optimization

作     者：Denise M.V. Sato André P. Borges Peter Márton Edson E. Scalabrin 

作者机构：Federal Institute of Education Science and Technology of Parana Graduate Program in Informatics Pontifical Catholic University of Parana Curitiba Brazil Faculty of Management and Computer Science University of Zilina Zilina Slovakia 

出 版 物：《Procedia Computer Science》 

年 卷 期：2015年第51卷

页      面：2297-2306页

主　　题：Train Classification Classification Schedules I-DCOP OMTC DCOP. 

摘      要：This paper presents an iterative process based on Distributed Constraint Optimization (I-DCOP), to solve train classification problems. The input of the I-DCOP is the train classification problem modelled as a DCOP, named Optimization Model for Train Classification (OMTC). OMTC generates a feasible schedule for a train classification problem defined by the inbound trains, the total of outbound trains and the cars assigned to them. The expected result, named feasible schedule, leads to the correct formation of the outbound trains, based on the order criteria defined. The OMTC also minimizes the schedule execution time and the total number of roll-ins (operation executed on cars, sometimes charged by the yards). I-DCOP extends the OMTC including the constraints of limited amount of classification tracks ant their capacity. However, these constraints are included iteratively by adding domain restrictions on the OMTC. Both OMTC and I-DCOP have been measured using scenarios based on real yard data. OMTC has generated optimal and feasible schedules to the scenarios, optimizing the total number of roll-ins. I-DCOP solved more complex scenarios, providing sub-optimal solutions. The experiments have shown that distributed constraint optimization problems can include additional constraints based on interactively defined domain.