Containership routing with time deadlines and simultaneous deliveries and pick-ups

Karlaftis, MG; Kepaptsoglou, K; Sambracos, E

dc.contributor.author	Karlaftis, MG	en
dc.contributor.author	Kepaptsoglou, K	en
dc.contributor.author	Sambracos, E	en
dc.date.accessioned	2014-03-01T01:30:01Z
dc.date.available	2014-03-01T01:30:01Z
dc.date.issued	2009	en
dc.identifier.issn	1366-5545	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/19455
dc.subject	Containerships	en
dc.subject	Pick-ups and deliveries	en
dc.subject	Ship routing	en
dc.subject	Time deadlines	en
dc.subject.classification	Engineering, Civil	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.classification	Transportation	en
dc.subject.classification	Transportation Science & Technology	en
dc.subject.other	container ship	en
dc.subject.other	freight transport	en
dc.subject.other	genetic algorithm	en
dc.subject.other	hub and spoke network	en
dc.subject.other	optimization	en
dc.subject.other	parameterization	en
dc.subject.other	performance assessment	en
dc.subject.other	routing	en
dc.subject.other	sensitivity analysis	en
dc.title	Containership routing with time deadlines and simultaneous deliveries and pick-ups	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.tre.2008.05.001	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.tre.2008.05.001	en
heal.language	English	en
heal.publicationDate	2009	en
heal.abstract	In this paper we seek to determine optimal routes for a containership fleet performing pick-ups and deliveries between a hub and several spoke ports. A capacitated vehicle routing problem with pick-ups, deliveries and time deadlines is formulated and solved using a hybrid genetic algorithm for establishing routes for a dedicated containership fleet. Results on the performance of the algorithm and the feasibility of the approach show that a relatively small fleet of containerships could provide efficient services within deadlines. Moreover, through sensitivity analysis we discuss performance robustness and consistency of the developed algorithm under a variety of problem settings and parameters values. (C) 2008 Elsevier Ltd. All rights reserved.	en
heal.publisher	PERGAMON-ELSEVIER SCIENCE LTD	en
heal.journalName	Transportation Research Part E: Logistics and Transportation Review	en
dc.identifier.doi	10.1016/j.tre.2008.05.001	en
dc.identifier.isi	ISI:000262774300018	en
dc.identifier.volume	45	en
dc.identifier.issue	1	en
dc.identifier.spage	210	en
dc.identifier.epage	221	en