Solving set partitioning problems arising in handicapped people`s transport
Conference
·
OSTI ID:35852
In dial-a-ride systems, for instance in the Telebus-system for handicapped people`s transport in Berlin, the problem of routing and scheduling a fleet of transportation vehicles to fulfill the user requests in a best possible way arises. This problem can be modelled as a Set Partitioning Problem. In a polyhedral approach, facets namely of Set Packing polyhedra can be used in a cutting plane algorithm to solve the problem. In this talk we discuss a branch and cut algorithm for Set Partitioning problems and computational results for it. For our Telebus application these indicate that substantial improvements in both quality of transport and reduction of costs are possible.
- OSTI ID:
- 35852
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Solving set covering problems with general cutting planes
Solving multiple knapsack problems by cutting planes
Polyhedral studies for the multicut problem in hypergraphs
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35882
Solving multiple knapsack problems by cutting planes
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36266
Polyhedral studies for the multicut problem in hypergraphs
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36003