Speed-up of Labelling Algorithms for Biobjective Shortest Path Problems

Raith, Andrea

dc.contributor.author	Raith, Andrea	en
dc.coverage.spatial	Auckland, New Zealand	en
dc.date.accessioned	2011-12-05T20:19:35Z	en
dc.date.issued	2010	en
dc.identifier.citation	ORSNZ 45th Annual Conference, Auckland, New Zealand, 29 Nov 2010 - 30 Nov 2010. ORSNZ 45th Annual Conference. 313-322. 2010	en
dc.identifier.uri	http://hdl.handle.net/2292/9789	en
dc.description.abstract	There is a range of algorithms available to solve biobjective shortest path problems. Here, we focus on biobjective labelling algorithms and propose an acceleration tech- nique, which is easily implemented. We compare the performance of the algorithms with and without the proposed improvements on the basis of test instances with three di erent network structures. The usage of di erent data structures within label setting algorithms and their e ect on run times is also discussed.	en
dc.relation.ispartof	ORSNZ 45th Annual Conference	en
dc.relation.ispartofseries	ORSNZ 45th Annual Conference	en
dc.rights	Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher.	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.title	Speed-up of Labelling Algorithms for Biobjective Shortest Path Problems	en
dc.type	Conference Item	en
pubs.begin-page	313	en
dc.rights.holder	Copyright: the author	en
pubs.author-url	https://secure.orsnz.org.nz/conf45/	en
pubs.end-page	322	en
pubs.finish-date	2010-11-30	en
pubs.start-date	2010-11-29	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/RestrictedAccess	en
pubs.subtype	Proceedings	en
pubs.elements-id	190090	en
pubs.org-id	Engineering	en
pubs.org-id	Engineering Science	en
pubs.record-created-at-source-date	2010-12-02	en