{"id":809,"date":"2017-11-08T13:33:17","date_gmt":"2017-11-08T12:33:17","guid":{"rendered":"https:\/\/www.hsu-hh.de\/logistik\/?page_id=809"},"modified":"2017-11-26T06:55:52","modified_gmt":"2017-11-26T05:55:52","slug":"coach-trip-with-shuttle-service-problem","status":"publish","type":"page","link":"https:\/\/www.hsu-hh.de\/logistik\/research\/projects\/coach-trip-with-shuttle-service-problem","title":{"rendered":"Coach Trip with Shuttle Service Problem"},"content":{"rendered":"

In the Coach Trip with Shuttle Service Problem<\/em>, passengers are picked up from bus stations and transported to a central hub. Two types vehicles are available: coaches and smaller shuttle-vehicles. While all coaches terminate at the central hub, the shuttles may transport passengers either to the central hub, also, or bring them to a bus stop (transfer point) from where they get picked up by a coach.<\/p>\n

The objective of the problem is minimize the total costs of transporting all passengers to the hub while respecting all side constraints. Individual cost functions for the coaches and the shuttle-vehicles are given, and maximum driving times must be respected for all bus stops (obviously, this limits the total trip duration for the passengers waiting at bus stops and hence presents an important practical aspect). Besides, each vehicle has a capacity constraint on the maximum number of transported passengers.<\/p>\n

VeRoLog Solver Challenge 2015<\/h3>\n

The problem definition goes back to the VeRoLog Solver Challenge 2015, an implementation challenge of the EURO Working Group on Vehicle Routing and Logistics Optimization. The background of this problem is a business application of the PTV Group, a Karlsruhe-based company specializing in transportation\/logistics optimization and software services.<\/p>\n

We employ techniques from Variable Neighborhood Search, combined with Iterated Local Search. On a lower level, efficient data-structures for solution representations have been studied: It is possible to show that any feasible alternative may be represented by a forest of directed trees. The latter significantly contributed to the effectiveness of our concept. Moreover, a visualization of the obtained solutions has been implemented.<\/p>\n

\"VeRoLog
Fig.: Visualization of a solution – coach trips (green) and shuttle trips (pink)<\/figcaption><\/figure>\n

Our contribution ranked first in this competition. Follow this link<\/a> to a press release by the sponsor.
\nA complete description of our work and the source-code of the developed program have been made available to the public.<\/p>\n

\"VeRoLog2015\"
From left to right: Karl D\u00f6rner, Werner Heid, Martin Josef Geiger, Daniele Vigo<\/figcaption><\/figure>\n

Related key publications<\/h3>\n

\"NetworksMartin Josef Geiger (2017):
\nOn an effective approach for the coach trip with shuttle service problem of the VeRoLog solver challenge 2015<\/strong>.
\nNetworks, Volume 69, Issue 3, May 2017, Pages 329\u2013345.
\n[doi:10.1002\/net.21733<\/a>]<\/p>\n

\n

\"MendeleyMartin Josef Geiger:
\nVeRoLog Solver Challenge 2015 \u2013 sourcecode of my contribution<\/strong>.
\n[doi:10.17632\/662mtv6sd8.1<\/a>]<\/p>\n","protected":false},"excerpt":{"rendered":"

In the Coach Trip with Shuttle Service Problem, passengers are picked up from bus stations and transported to a central hub. Two types vehicles are available: coaches and smaller shuttle-vehicles. […]<\/p>\n","protected":false},"author":74,"featured_media":0,"parent":644,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"categories":[53],"tags":[],"class_list":["post-809","page","type-page","status-publish","hentry","category-research-project"],"_links":{"self":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages\/809","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/users\/74"}],"replies":[{"embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/comments?post=809"}],"version-history":[{"count":19,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages\/809\/revisions"}],"predecessor-version":[{"id":1212,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages\/809\/revisions\/1212"}],"up":[{"embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages\/644"}],"wp:attachment":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/media?parent=809"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/categories?post=809"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/tags?post=809"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}