Optimizing marine cargo in the Aegean with the simulated annealing algorithm

被引：0

作者：

Fountas, Chrysostomos ^{[1
]}

Vlachos, Aristeidis ^{[1
]}

Lytras, Christos ^{[1
]}

机构：

[1] Univ Piraeus, Dept Informat, 80 Karaoli & Dimitrioy Str, Piraeus 18534, Greece

来源：

JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES | 2008年 / 29卷 / 02期

关键词：

Simulated annealing algorithm; Floyd algorithm; NP-complete problem; travelling salesman problem;

D O I：

10.1080/02522667.2008.10699804

中图分类号：

G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];

学科分类号：

1205 ; 120501 ;

摘要：

This paper presents an optimization approach to the problem of marine cargo in the Aegean, using the Simulated Annealing Algorithm. Our main target is minimizing the total crossing costs of thirteen harbors in the Aegean, when a ship can visit a harbor exactly once, with regard to the total cost of fuel and port fees. Our method utilizes Floyds Algorithm in order to determine the minimum distances and then apply the Simulated Annealing Algorithm to the hard combinatorial problem.

引用

页码：271 / 285

页数：15

共 8 条

[1]

Aarts E., 1989, SIMULATED ANNEALING

[2]

Alexandris N, 2005, J STAT MANAG SYST, V8, P1

[3]

Fleischer M., P 1995 WINT SIM C, P155

[4] OPTIMIZATION BY SIMULATED ANNEALING [J].

KIRKPATRICK, S ;

GELATT, CD ;

VECCHI, MP .

SCIENCE, 1983, 220 (4598) :671-680

[5] EFFECTIVE HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM [J].

LIN, S ;

KERNIGHAN, BW .

OPERATIONS RESEARCH, 1973, 21 (02) :498-516

[6] EQUATION OF STATE CALCULATIONS BY FAST COMPUTING MACHINES [J].

METROPOLIS, N ;

ROSENBLUTH, AW ;

ROSENBLUTH, MN ;

TELLER, AH ;

TELLER, E .

JOURNAL OF CHEMICAL PHYSICS, 1953, 21 (06) :1087-1092

[7]

Nahar S., 1986, 23rd ACM/IEEE Design Automation Conference. Proceedings 1986 (Cat. No.86CH2288-9), P293, DOI 10.1145/318013.318059

[8]

Sambracos E., 2000, 16 INT LOG C VERS OC

← 1 →