DocumentCode :
3033658
Title :
MICAH: a genetic algorithm system for multi-commodity transshipment problems
Author :
Thangiah, Sam R. ; Nygard, Kendall E.
Author_Institution :
Dept. of Comput. Sci., Slippery Rock Univ., PA, USA
fYear :
1992
fDate :
2-6 Mar 1992
Firstpage :
240
Lastpage :
246
Abstract :
The multicommodity transshipment problem (MCTP) is a specialization of the vehicle routing problem. MICAH, a genetic algorithm system integrated with a MCTP solver for solving MCTPs, is described. An MCTP consists of nodes that either produce or acquire commodities and arcs that are used for the transportation of commodities between the different nodes. The objective is to maximize the total amount of commodities transported between the nodes while minimizing the transportation cost. Multicommodity transshipment problems are combinatorially explosive problems that have no known polynomial-time algorithms for obtaining optimal solutions. MCTP problems belong to the NP-complete class of problems. The solution obtained from MICAH for a real-world MCTP transports 38% more commodities compared to the solution obtained from a combination of a MCTP solver and manual routing
Keywords :
computational complexity; genetic algorithms; problem solving; transportation; MCTP solver; MICAH; NP-complete; combinatorially explosive problems; genetic algorithm system; multicommodity transshipment problem; polynomial-time algorithms; transportation cost; vehicle routing problem; Aircraft; Cities and towns; Computer science; Costs; Genetic algorithms; Job shop scheduling; Rail transportation; Routing; Upper bound; Vehicles;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Artificial Intelligence for Applications, 1992., Proceedings of the Eighth Conference on
Conference_Location :
Monterey, CA
Print_ISBN :
0-8186-2690-9
Type :
conf
DOI :
10.1109/CAIA.1992.200036
Filename :
200036
Link To Document :
بازگشت