The off-line group seat reservation problem |
| |
Authors: | Tommy Clausen Allan Nordlunde Hjorth Morten Nielsen David Pisinger |
| |
Institution: | 1. DTU Management Engineering, Produktionstorvet 424, DK-2800 Kgs. Lyngby, Denmark;2. DIKU, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark |
| |
Abstract: | In this paper we address the problem of assigning seats in a train for a group of people traveling together. We consider two variants of the problem. One is a special case of two-dimensional knapsack where we consider the train as having fixed size and the objective is to maximize the utilization of the seats in the train. The second is a special case of two-dimensional bin packing where all requests must be accommodated while trying to minimize the number of passenger cars needed. For both variants of the problem we present a number of bounds and develop exact algorithms. Computational results are presented for various instances based on realistic data, and from the packing literature adapted to the problems addressed. |
| |
Keywords: | Two-dimensional packing problem Bin packing Seat reservation Storehouse planning Berth scheduling Production planning |
本文献已被 ScienceDirect 等数据库收录! |