Please use this persistent identifier to cite or link to this item: doi:10.24405/4297
DC FieldValueLanguage
dc.contributor.authorGerhards, Patrick-
dc.contributor.authorStürck, Christian-
dc.contributor.editorFink, Andreas-
dc.date.accessioned2019-09-17T09:44:07Z-
dc.date.available2019-09-17T09:44:07Z-
dc.date.issued2016-
dc.identifier.issn2198-3968-
dc.identifier.otherhttp://edoc.sub.uni-hamburg.de/hsu/volltexte/2016/3150/-
dc.identifier.urihttps://doi.org/10.24405/4297-
dc.description.abstractIn this work we consider the Coach Trip with Shuttle Service Problem (CTSSP), which is a routing problem where passengers have to be transported from bus stops to a central hub with a fleet of coaches and shuttles. The capacity of each vehicle must not be exceeded and for each group of passengers waiting at a bus stop there is a maximal travel time that must not be exceeded while travelling to the hub. Shuttles can use bus stops as transfer points to drop their passengers from which they have to be picked up by a coach. Coaches must end their trip at the hub while shuttles can stop at any bus stop. The goal is to minimize costs. The costs consist of travelling costs of the used vehicles plus fixed costs for the usage of the shuttles. We prove the computational complexity of the problem and present a novel mathematical model for the CTSSP. This model is implemented in CPLEX and the optimal solution of the "example" instance of the VeRoLog Solver Challenge 2015 is shown.-
dc.description.sponsorshipBWL, insb. Wirtschaftsinformatik-
dc.language.isoeng-
dc.publisherHelmut-Schmidt-Universität / Universität der Bundeswehr Hamburg, Institut für Informatik-
dc.relation.ispartofResearch paper / Institute of Computer Science-
dc.subjectComputational Complexity-
dc.subjectCPLEX-
dc.subjectRouting-
dc.subjectTransfers-
dc.subjectCTSSP-
dc.subject.ddc330 Wirtschaft-
dc.titleA Mathematical Model for the Coach Trip with Shuttle Service Problem-
dc.typeWorking Paper-
dc.identifier.urnurn:nbn:de:gbv:705-opus-31501-
dcterms.bibliographicCitation.volume16-
dcterms.bibliographicCitation.issue02-
dcterms.bibliographicCitation.originalpublisherplaceHamburg-
local.submission.typefull-text-
hsu.dnb.deeplinkhttps://d-nb.info/1122461933/-
item.grantfulltextopen-
item.languageiso639-1en-
item.fulltext_sWith Fulltext-
item.openairetypeWorking Paper-
item.fulltextWith Fulltext-
Appears in Collections:1 - Open Access Publications (except Theses)
Files in This Item:
File Description SizeFormat
openHSU_4297.pdf250.01 kBAdobe PDFView/Open
Show simple item record

CORE Recommender

Google ScholarTM

Check

User Tools
Login to see more information

Items in openHSU are protected by copyright, with all rights reserved, unless otherwise indicated.