A Mathematical Model for the Coach Trip with Shuttle Service Problem

A Mathematical Model for the Coach Trip with Shuttle Service Problem

In 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 wa...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Gerhards, Patrick, Stürck, Christian
Format: Dataset
Sprache:eng
Schlagworte:
Computational Complexity
CPLEX
CTSSP
Routing
Transfers
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Gerhards, Patrick
Stürck, Christian
description In 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.
doi_str_mv 10.24405/4297
format Dataset
fullrecord <record><control><sourceid>datacite_PQ8</sourceid><recordid>TN_cdi_datacite_primary_10_24405_4297</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_24405_4297</sourcerecordid><originalsourceid>FETCH-datacite_primary_10_24405_42973</originalsourceid><addsrcrecordid>eNqNjrsKwkAQAK_QImj-YRvLaF5qUkpUbAJC0h_rZcMdXLhwrop_7wM_wGpgmGKECJN4meZ5vF7labmdiCBNyiLKyk0RiP0OamRNA7JRaKF2HVnonYe3hMqh0tB6M8LDsIZG35gtQUP-bhTB2buLpWEupj3aK4U_zsTieGirU9QhozJMcvRmQP-USSy_J_Jzkv3bvQAQDDl1</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>dataset</recordtype></control><display><type>dataset</type><title>A Mathematical Model for the Coach Trip with Shuttle Service Problem</title><source>DataCite</source><creator>Gerhards, Patrick ; Stürck, Christian</creator><contributor>Fink, Andreas</contributor><creatorcontrib>Gerhards, Patrick ; Stürck, Christian ; Fink, Andreas</creatorcontrib><description>In 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.</description><identifier>ISSN: 2198-3968</identifier><identifier>DOI: 10.24405/4297</identifier><language>eng</language><publisher>Helmut-Schmidt-Universität / Universität der Bundeswehr Hamburg, Institut für Informatik</publisher><subject>Computational Complexity ; CPLEX ; CTSSP ; Routing ; Transfers</subject><creationdate>2016</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,1887</link.rule.ids><linktorsrc>$$Uhttps://commons.datacite.org/doi.org/10.24405/4297$$EView_record_in_DataCite.org$$FView_record_in_$$GDataCite.org$$Hfree_for_read</linktorsrc></links><search><contributor>Fink, Andreas</contributor><creatorcontrib>Gerhards, Patrick</creatorcontrib><creatorcontrib>Stürck, Christian</creatorcontrib><title>A Mathematical Model for the Coach Trip with Shuttle Service Problem</title><description>In 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.</description><subject>Computational Complexity</subject><subject>CPLEX</subject><subject>CTSSP</subject><subject>Routing</subject><subject>Transfers</subject><issn>2198-3968</issn><fulltext>true</fulltext><rsrctype>dataset</rsrctype><creationdate>2016</creationdate><recordtype>dataset</recordtype><sourceid>PQ8</sourceid><recordid>eNqNjrsKwkAQAK_QImj-YRvLaF5qUkpUbAJC0h_rZcMdXLhwrop_7wM_wGpgmGKECJN4meZ5vF7labmdiCBNyiLKyk0RiP0OamRNA7JRaKF2HVnonYe3hMqh0tB6M8LDsIZG35gtQUP-bhTB2buLpWEupj3aK4U_zsTieGirU9QhozJMcvRmQP-USSy_J_Jzkv3bvQAQDDl1</recordid><startdate>2016</startdate><enddate>2016</enddate><creator>Gerhards, Patrick</creator><creator>Stürck, Christian</creator><general>Helmut-Schmidt-Universität / Universität der Bundeswehr Hamburg, Institut für Informatik</general><scope>DYCCY</scope><scope>PQ8</scope></search><sort><creationdate>2016</creationdate><title>A Mathematical Model for the Coach Trip with Shuttle Service Problem</title><author>Gerhards, Patrick ; Stürck, Christian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-datacite_primary_10_24405_42973</frbrgroupid><rsrctype>datasets</rsrctype><prefilter>datasets</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Computational Complexity</topic><topic>CPLEX</topic><topic>CTSSP</topic><topic>Routing</topic><topic>Transfers</topic><toplevel>online_resources</toplevel><creatorcontrib>Gerhards, Patrick</creatorcontrib><creatorcontrib>Stürck, Christian</creatorcontrib><collection>DataCite (Open Access)</collection><collection>DataCite</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gerhards, Patrick</au><au>Stürck, Christian</au><au>Fink, Andreas</au><format>book</format><genre>unknown</genre><ristype>DATA</ristype><title>A Mathematical Model for the Coach Trip with Shuttle Service Problem</title><date>2016</date><risdate>2016</risdate><issn>2198-3968</issn><abstract>In 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.</abstract><pub>Helmut-Schmidt-Universität / Universität der Bundeswehr Hamburg, Institut für Informatik</pub><doi>10.24405/4297</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2198-3968
ispartof
issn 2198-3968
language eng
recordid cdi_datacite_primary_10_24405_4297
source DataCite
subjects Computational Complexity
CPLEX
CTSSP
Routing
Transfers
title A Mathematical Model for the Coach Trip with Shuttle Service Problem
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T17%3A32%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-datacite_PQ8&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=unknown&rft.au=Gerhards,%20Patrick&rft.date=2016&rft.issn=2198-3968&rft_id=info:doi/10.24405/4297&rft_dat=%3Cdatacite_PQ8%3E10_24405_4297%3C/datacite_PQ8%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true