A Hybrid Classical Approach to a Fixed-Charged Transportation Problem

被引:0
作者
Pintea, Camelia-M. [1 ]
Sitar, Corina Pop [1 ]
Hajdu-Macelaru, Mara [1 ]
Petrica, Pop [1 ]
机构
[1] North Univ, Baia Mare 430083, Romania
来源
HYBRID ARTIFICIAL INTELLIGENT SYSTEMS, PT I | 2012年 / 7208卷
关键词
Hybrid algorithms; Nearest Neighbor; Transportation Problem;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Some of the most complex problems, nowadays, are transportation problems. A capacitated fixed-charge transportation problem is the problem we are trying to solve using hybrid classical approaches. The problem is considered with fixed capacities for each distribution centers and customers have particular demands. The model, as an economical model, minimizes the total cost as some distribution centers are selected in order to supply demands of all the customers. In order to find feasible solution for the mentioned problem, we are using some variants of Nearest Neighbor search algorithm. The problem as a whole is a two stages supply chain network: first we have to choose the distribution centers and next the customers based on their demand. The new approach is that we are starting from given customers' demands and select the best distribution centers. Some hybrid variants of Nearest Neighbor based on different probabilities are investigated and tested on large sizes data. Based on the numerical results we found a suitable hybrid version for the specified transportation problem.
引用
收藏
页码:557 / 566
页数:10
相关论文
共 19 条
[1]   On the fixed-charge transportation problem [J].
Adlakha, V ;
Kowalski, K .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1999, 27 (03) :381-388
[2]  
[Anonymous], 1973, Pattern Classification and Scene Analysis
[3]   An optimal algorithm for approximate nearest neighbor searching in fixed dimensions [J].
Arya, S ;
Mount, DM ;
Netanyahu, NS ;
Silverman, R ;
Wu, AY .
JOURNAL OF THE ACM, 1998, 45 (06) :891-923
[4]  
Chira C, 2010, COMPUT INFORM, V29, P337
[5]   A WEIGHTED NEAREST NEIGHBOR ALGORITHM FOR LEARNING WITH SYMBOLIC FEATURES [J].
COST, S ;
SALZBERG, S .
MACHINE LEARNING, 1993, 10 (01) :57-78
[6]  
Reyes LC, 2010, LECT NOTES ARTIF INT, V6077, P135, DOI 10.1007/978-3-642-13803-4_17
[7]  
DEERWESTER S, 1990, J AM SOC INFORM SCI, V41, P391, DOI 10.1002/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO
[8]  
2-9
[9]  
DEVROYE L, 1982, HDB STAT, V2
[10]  
DIABY M, 1991, J OPER RES SOC, V42, P991, DOI 10.1038/sj/jors/0421107