A Time-Space Network Approach for the Integrated Vehicle- and Crew-Scheduling Problem with Multiple Depots

Steinzen, Ingmar; Gintner, Vitali; Suhl, Leena; Kliewer, Natalia

doi:10.1287/trsc.1090.0304

Cited by 112 publications

(90 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, it would be interesting to include production planning approaches into the MAS. An integrated optimization approach for the planning steps crew scheduling and vehicle scheduling is presented by Steinzen et al (2010). Fink and Homberger (2013) are developing an automated negotiation mechanism for project scheduling, where information asymmetry and conflicting objectives are taken into account.…”

Section: Examples Of Initial Resultsmentioning

confidence: 99%

Model-Based Decision Support in Manufacturing and Service Networks

et al. 2014

Self Cite

View full text Add to dashboard Cite

Section: Examples Of Initial Resultsmentioning

confidence: 99%

Model-Based Decision Support in Manufacturing and Service Networks

et al. 2014

Self Cite

View full text Add to dashboard Cite

“…Rules 1-6 are customary assumptions in the literature (Huisman, 2004;Huisman et al, 2005;Steinzen, 2007;Steinzen et al, 2010).…”

Section: Assumptionsmentioning

confidence: 99%

“…This idea was applied for integrated problems as well (e.g., Freling et al (2003); Huisman et al (2005); Steinzen et al (2010)), however, it is worth mentioning that omitting such long waiting and deadheads may change the set of potential tasks (see Rule 5), hence the set of feasible duties can be changed. Rule 2 can create another problem when time-space network approaches are used for the VCSP.…”

Section: Assumptionsmentioning

confidence: 99%

“…Rule 2 can create another problem when time-space network approaches are used for the VCSP. Steinzen (2007) and Steinzen et al (2010) suggested to eliminate appropriate (long) arcs from network to ensure Rule 2, but it is not sufficient by itself as we will show in Section 4.1. That is why we will handle Rule 2 as a lazy rule, i.e., we will eliminate long arcs from the network model of the problem, but we will not make further efforts to satisfy Rule 2.…”

Section: Assumptionsmentioning

confidence: 99%

“…Their integer programming model uses a so-called connection-based network and consists of three components: a quasi-assignment formulation for vehicle scheduling, a set partitioning formulation Steinzen et al (2010). Friberg and Haase (1999) propose the first exact algorithm for the single-depot case.…”

Section: Complete Integrationmentioning

confidence: 99%

See 2 more Smart Citations

Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price

Horváth

Kis

2017

Cent Eur J Oper Res

View full text Add to dashboard Cite

In the problem of the title, vehicle and crew schedules are to be determined simultaneously in order to satisfy a given set of trips over time. The vehicles and the crew are assigned to depots, and a number of rules have to be observed in the course of constructing feasible schedules. The main contribution of the paper is a novel mathematical programming formulation which combines ideas from known models, and an exact solution procedure based on branch-and-price.The method is tested on benchmark instances from the literature and it provides suboptimal schedules using limited computational resources.Keywords vehicle and crew scheduling · branch-and-price · exact methods · integer programming

show abstract

A methodology for schedule‐based paths recommendation in multimodal public transportation networks

Canca

Zarzo

González‐R

et al. 2012

J of Advced Transportation

View full text Add to dashboard Cite

This paper analyzes the problem of intermodal itineraries recommendation in interurban networks where different public transportation modes, several companies, time, and capacity constraints, as well as seat booking, are considered. The inherent network optimization problem is first modeled for a generic user request, and then a solving method that makes use of a network graph transformation is proposed. For each request, this solving method is based on pruning the user-specific time-space graph, followed by the application of a k-shortest path algorithm. Moreover, in order to build on-demand real-time itineraries recommendations, the algorithm has been embedded in a Web client-server to which users ask for trip recommendations by Internet or mobile phone. Finally, as an illustration, the proposed approach has been tested on the Andalusia main transportation network. ATIS and APTS have been analyzed by many authors, from both a theoretical and technical point of view. Yang and Meng [4] studied the price of using and the benefits gained from ATIS services as two key factors in explaining the growth of adoption of ATIS products. Horn [5] proposed a modeling framework to analyze the performance of urban passenger transport systems, with particular attention to demand-responsive transport modes and traveler information technologies. Levinson [6] and Kenyon and Lyons [7] considered the value of ATIS for route choice and its potential contribution to modal change, respectively. Yin et al.[8] studied how Intelligent Transportation Systems technologies can improve traffic congestion levels in urban road networks. They analyzed the impact that ATIS may play in route choice and departure time decisions. Most of these works are focused on the use of information systems in the private vehicle case. Concerning to the public case, several authors have studied different issues of ATIS and APTS focused on different topics such as users assessment (see e.g., [9] or [10]), congestion costs [11], or technology sourcing evaluation [12]. A recent point of interest has been the integration of ATIS into Web applications (see [13][14][15][16]).Roughly speaking, traveler public information systems have two main aims (see e.g., [17] or [18]). First, they should contribute to minimize the inconvenience of using public transport, simplifying the journey-planning and executing processes. Second, their design should be addressed to diminish the sense in which such a journey is disjointed and awkward, in such a way that the intermodal travel experience becomes closer to that of a journey by private car. To succeed in this latter aim, an accurate and efficient way to manage transfers is needed because, as pointed out in [19], transfers are one of the most important inconveniences perceived by users of multimodal transport systems.At this point, it is clear that, besides the appropriate infrastructure properties of the network, good and well-oriented information becomes also necessary in order to guarantee intermodality success [20]. Moreover...

show abstract

A Time-Space Network Approach for the Integrated Vehicle- and Crew-Scheduling Problem with Multiple Depots

Cited by 112 publications

References 32 publications

Model-Based Decision Support in Manufacturing and Service Networks

Model-Based Decision Support in Manufacturing and Service Networks

Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price

A methodology for schedule‐based paths recommendation in multimodal public transportation networks

Contact Info

Product

Resources

About