I.P. Gent. Two Results on Car-sequencing Problems. Technical report APES. 1998 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Study of Greedy, Local Search and Ant Colony.. - Gottlieb, Puchta, Solnon (Correct)
....on them. Each option is installed by a di erent station, designed to handle at most a certain percentage of the cars passing along the assembly line, and the cars requiring this option must be spaced such that the capacity of the station is never exceeded. This problem is NP complete [5]. It has been formulated as a constraint satisfaction problem (CSP) and is a classical benchmark for constraint solvers [3, 6, 13] Most of these CSP solvers use a complete tree search approach to explore the search space in a systematic way, until either a solution is found, or the problem is ....
....time Instance 19 71 LS DED ACO Fig. 1. Results on four representative benchmark instances of the second suite. ble solution for the instance 26 82, for which it was formerly unknown whether it is satis able or not. The lower bound 2 on the number of constraint violations proved by Gent [5] for 19 71 is reached by all three algorithms. Table 6. Comparison with results reported in [5, 6, 9] The best solution is the best value we found in all our experiments, and the success rate (SR) measures for each algorithm the ratio of runs that actually found the best value. Instance 10 93 ....
[Article contains additional citation context not shown here]
I.P. Gent. Two Results on Car-sequencing Problems. Technical report APES. 1998
Constraint Satisfaction By Local Search - Bohlin (2002) (Correct)
....16 The problem can be generalized to that of scheduling m groups of n golfers over p weeks, such that no golfer plays in the same group as any other golfer twice. The car sequencing problem The car sequencing problem is mentioned in work by Parrello and Kabat [40] Dincbas et al. 8] Gent [16], R egin [42] and Lee et al. 31] In CSPLib it is described as follows. A number of cars are to be produced; they are not identical, because di erent options are available as variants on the basic model. The assembly line has di erent stations which install the various options ....
Gent, I. Two results on car sequencing problems. Tech. Rep. Technical Report APES-02-1998, University of St Andrews, School of Computer Science, APES Group, 1998.
Solving Permutation Constraint Satisfaction Problems with.. - Solnon (2000) (1 citation) (Correct)
....Let us consider for example instance pb19 71 of the car sequencing problem extracted from [13] The feasibility of this instance remained open in [17] i.e. Ilog solver can neither find a solution, nor prove infeasibility, on this particular instance within a reasonable amount of time. [12] proves that this instance is actually infeasible, and that any complete assignment violates at least two capacity constraints. On this instance, Ant P solver has found an assignment that violates 2 capacity constraints, in 81s cpu time. This assignment is actually optimal, even though ....
I.P. Gent, `Two results on car-sequencing problems', Technical report (http://www.apes.cs.strath.ac.uk/apesreports.html), APES, (1998).
Problem Reformulation and Search -- Part 2: Description of the.. - Of (Correct)
....effect of different representations as problem structure varies. 2. 4 Programme The body of work will be broken into two work packages, The first investigation (work package 1) will look at the car sequencing problem, a problem recently shown to be NP complete via translation from Hamiltonian Path [4]. Work package 2 investigates change of representation between the job shop scheduling problem and vehicle routing, and may use two toolkits ILOG Scheduler and ILOG Dispatcher. 2.4.1 Work Package 1: The Car Sequencing Problem The car sequencing problem is an example of an assembly line scheduling ....
....the APES research group, with group members in Leeds (Dr. Barbara Smith, a senior lecturer) and Strathclyde (with Dr. Toby Walsh, a senior research fellow) Barbara Smith and Ian Gent will both be involved in the management of Work Package 1 (section 2.4. 1) due to their expertise in that area [5, 4]. We ask for two low cost PC with cameras, one to be located at Leeds the other at Strathclyde, to allow face to face electronic meetings over JANET. We expect meetings of this kind to occur frequently each week. Meetings with our industrial collaborators will be scheduled as necessary, but at ....
I.P. Gent. Two results on car sequencing problems. Technical report. Technical Report APES-02-1998.
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