Please use this identifier to cite or link to this item:
Title: Shortest route problem with soft time windows
Authors: BRAEKERS, Kris 
Issue Date: 2013
Publisher: Eurosis
Source: Onggo, Stephan; Kavicka, Antonin (Ed.). ESM 2013 - The European Simulation and Modelling Conference, p. 279-283
Abstract: The shortest path problem may be enriched with assigning time windows to the nodes. In case the time windows are of the soft type, earliness and tardiness may be considered of importance when evaluating a path, next to the usual criterion of total path length. While the distance between the nodes may be fixed or time-dependent, criteria like total earliness or total tardiness are, by definition, time-dependent, i.e. they depend on the time one leaves a node. To solve this multi-criteria time-dependent shortest path problem, a dynamic programming approach is used. Numerical examples are given and the performance of the approach is investigated.
Notes: Braekers, K (reprint author), Univ Hasselt, Fac Business Econ, Res Grp Logist, Campus Diepenbeek,Agoralaan 1, B-3590 Diepenbeek, Belgium.;
Keywords: Shortest route problem; multi-objective optimization; time-dependent route problem; dynamic programming
Document URI:
ISBN: 978-90-77381-79-3
ISI #: 000344910500044
Category: C1
Type: Proceedings Paper
Validations: ecoom 2015
Appears in Collections:Research publications

Show full item record


checked on May 14, 2022

Page view(s)

checked on May 19, 2022

Google ScholarTM



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