Synchronizing time-dependent transportation services: Reformulation and solution algorithm using quadratic assignment problem

•Connect quadratic assignment model (QAP) with network design problem.•Reformulate time-dependent synchronized service design as network-based quadratic assignment problem.•Propose extended Gilmore-Lawler Bound (EGLB) in the generic QAP network.•Develop Branch & Bound algorithm with an effective...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Transportation research. Part B: methodological 2021-10, Vol.152, p.140-179
Hauptverfasser:	Wu, Xin (Bruce), Lu, Jiawei, Wu, Shengnan, Zhou, Xuesong (Simon)
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Assignment problem Branch andbound Combinatorial analysis Computer applications Decision making Economic models Gilmore-Lawler bound Lower bounds Network design Operations research Optimization Quadratic assignment problem Service network design, Synchronized service Synchronism Time dependence Time synchronization Transportation services
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!