A hybrid classical approach to a fixed-charged transportation problem

Authors:
Camelia-M. Pintea;Corina Pop Sitar;Mara Hajdu-Macelaru;Pop Petrica
Affiliations:
North University, Baia-Mare, Romania;North University, Baia-Mare, Romania;North University, Baia-Mare, Romania;North University, Baia-Mare, Romania
Venue:
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
Year:
2012

Citing 7
Cited 0

Vector quantization and signal compression

Vector quantization and signal compression
A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features

Machine Learning
Advances in knowledge discovery and data mining

Advances in knowledge discovery and data mining
An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Journal of the ACM (JACM)
Query by Image and Video Content: The QBIC System

Computer
Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prüfer number representation

Expert Systems with Applications: An International Journal
A cultural algorithm for the urban public transportation

HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.