Lagerholm M., Peterson C., Soderberg B. Airline Crew Scheduling Using Potts Mean Field Techniques. European Journal of Operational Research, 120:81-96, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Crew Assignment by Constraint Logic Programming - Christodoulou, Stamatopoulos (Correct)
....be explored [6] The problem is often tackled by breaking it down into the crew pairing and the crew assignment subproblems, which are still hard problems. The crew pairing subproblem has been studied extensively and tackled with OR techniques [10, 1, 20] genetic algorithms [14] neural networks [4, 12], constraint programming [15] etc. Much work has been done also for the crew assignment problem, where pure OR methods have been applied [2, 16, 5] or hybrid methods that combine OR and constraint programming [8, 3, 17, 21, 7] In this paper, we discuss the crew assignment problem and we propose ....
Lagerholm M., Peterson C., Soderberg B. Airline Crew Scheduling Using Potts Mean Field Techniques. European Journal of Operational Research, 120:81-96, 2000.
An Efficient Mean Field Approach to the Set Covering Problem - Ohlsson, Peterson.. Self-citation (Peterson Soderberg) (Correct)
....gained a lot of attention during the last 5 10 years. Most of the activities have been directed towards feed forward architectures for pattern recognition or function approximation. ANN, in particular feedback networks, can also be used for difficult combinatorial optimization problems (e.g. 6] [11]) Here ANN introduces a new method that, in contrast to most existing search and heuristics techniques, is not based on exploratory search to find the optimal configuration. Rather, the neural units find their way in a fuzzy manner through an interpolating, continuous space towards good ....
M. Lagerholm, C. Peterson and B. Soderberg, "Airline Crew Scheduling Using Potts Mean Field Techniques", European Journal of Operational Research 120 (2000) 81-96.
Local Routing Algorithms Based on Potts Neural Networks - Häkkinen, Lagerholm.. (1998) Self-citation (Lagerholm Peterson Soderberg) (Correct)
....in an impossible situation, with no good continuation node available. Following [6] an escape facility is introduced, enabling an (expensive) emergency route to b r . To construct the load and loop terms, a propagator formalism is employed, following ref. 3] for a more detailed explanation see [8]. For the Potts system managing the routing of request r, an element of the propagator P r is defined as P r ij = 1 Gamma v r ) Gamma1 ) ij = ffi ij v r ij X k v r ik v r kj X kl v r ik v r kl v r lj : 6) It could be interpreted as the (fuzzy) number of paths i ....
M. Lagerholm, C. Peterson and B. Soderberg, "Airline Crew Scheduling Using Potts Mean Field Techniques", LU TP 97-10.
An Efficient Mean Field Approach to the Set Covering Problem - Ohlsson, Peterson.. (1999) Self-citation (Peterson) (Correct)
....gained a lot of attention during the last 5 10 years. Most of the activities have been directed towards feed forward architectures for pattern recognition or function approximation. ANN, in particular feedback networks, can also be used for difficult combinatorial optimization problems (e.g. 5] [10]) Here ANN introduces a new method that, in contrast to most existing search and heuristics techniques, is not based on exploratory search to find the optimal configuration. Rather, the neural units find their way in a fuzzy manner through an interpolating, continuous space towards good ....
M. Lagerholm, C. Peterson and B. Soderberg, "Airline Crew Scheduling Using Potts Mean Field Techniques", LU TP 97-10 (to appear in European Journal for Operations Research).
Statistical Properties of Unrestricted Crew Scheduling.. - Lagerholm, Peterson.. Self-citation (Lagerholm Peterson Soderberg) (Correct)
....space reduced by typically a factor 2 Na , with N a the total number of airports. 1 martin thep.lu.se 2 carsten thep.lu.se 3 bs thep.lu.se 1 Introduction Airline crew scheduling represents an important class of optimization problems where the topological structure is important. In ref. [1], a novel Potts artificial neural network approach is developed for attacking semi realistic airline crew scheduling problems of the following type: A weekly flight schedule is given in terms of a set of flights, each with a specified airport and time for departure and arrival. The object is to ....
....time (including the waiting time at airports) The solution is subject to a set of global constraints: The crews are required to travel along closed tours, starting and ending at a certain airport, the home base. These tours are subject to limitations as to duration and leg count. As shown in ref. [1], a great deal of simplification is gained by reformulating the problem as that of mapping arrivals on departures at each airport, implying an implicit representation of the crews. In fact, without the global restrictions, the problem is reduced to a set of independent local subproblems, one at ....
[Article contains additional citation context not shown here]
M. Lagerholm, C. Peterson and B. Soderberg, "Airline Crew Scheduling using Potts Mean Field Techniques", LU TP 97-10 (submitted to European Journal of Operational Research).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC