The berth allocation problem with stochastic vessel handling times

dc.creator	Karafa, J.	en
dc.creator	Golias, M. M.	en
dc.creator	Ivey, S.	en
dc.creator	Saharidis, G. K. D.	en
dc.creator	Leonardos, N.	en
dc.date.accessioned	2015-11-23T10:32:54Z
dc.date.available	2015-11-23T10:32:54Z
dc.date.issued	2013
dc.identifier	10.1007/s00170-012-4186-0
dc.identifier.issn	0268-3768
dc.identifier.uri	http://hdl.handle.net/11615/28943
dc.description.abstract	In this paper, the berth allocation problem with stochastic vessel handling times is formulated as a bi-objective problem. To solve the resulting problem, an evolutionary algorithm-based heuristic and a simulation-based Pareto front pruning algorithm is proposed. Computational examples show that the proposed approach provides solutions superior to the ones where the expected value of the vessel handling times is used.	en
dc.source.uri	<Go to ISI>://WOS:000315389300040
dc.subject	Berth allocation	en
dc.subject	Stochastic	en
dc.subject	Optimization	en
dc.subject	Simulation	en
dc.subject	SCHEDULING PROBLEM	en
dc.subject	STABILITY	en
dc.subject	Automation & Control Systems	en
dc.subject	Engineering, Manufacturing	en
dc.title	The berth allocation problem with stochastic vessel handling times	en
dc.type	journalArticle	en

Αρχεία σε αυτό το τεκμήριο

Αρχεία	Μέγεθος	Τύπος	Προβολή
Δεν υπάρχουν αρχεία που να σχετίζονται με αυτό το τεκμήριο.