Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Rlt Approaches to Qsaps: Applied to Timetable Synchronization in Public Transport

Rlt Approaches to Qsaps: Applied to Timetable Synchronization in Public Transport

Schule, Ingmar

Paperback

General Mathematics

Currently unavailable to order

ISBN10: 3832526374
ISBN13: 9783832526375
Publisher: Logos Verlag Berlin
Published: Nov 30 2010
Pages: 250
Weight: 1.25
Height: 0.56 Width: 5.68 Depth: 8.04
Language: English
The research of this work is motivated by the Timetable Synchronization Problem in public transport. The problem is formulated as a multi-criteria Quadratic Semi-Assignment Problem (QSAP). This type of problem is known to be NP-hard. Therefore, the real life problem instances are solved with metaheuristics. To evaluate the quality of the solutions, lower bounds are generated by using the Reformulation Linearization Technique (RLT). This work contains new polyhedral results for the QSAP and analyzes the characteristics of the RLT solutions. A graph structure that causes untight solutions is presented and its minimality is proven. Exploiting these results, the natural stepwise structure of the RLT can be softened up to generate new algorithms for fast lower bound computations. The competitiveness of the approach is demonstrated by means of the real life instances.

Also in

General Mathematics

View All