Abstract
The problem of daily parking of subway vehicles is a special type of timetabling problems. It consists of assigning to the railroad lines of the depot of the subway system of Tunis the fleet of vehicles, while respecting a set of capacity and precedence constraints. Each vehicle is assigned daily one or more operating indices characterized by their departure and arrival times, and their itineraries. The objective is to minimize the number of scheduled conflicts. Five two-phase methods based on an exact model, on Genetic Algorithms, Tabu Search, Simulated Annealing and Expert Systems are proposed. The results are compared showing the superiority of the Tabu Search and Genetic Algorithm based heuristics and their capability of assigning all the vehicles in most cases.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Colorni, A., Dorigo, M., Maniezzo V.: Genetic Algorithms and Highly Constrained Problems: The Time-Table Case. Proceedings of the First International Workshop on Parallel Problem Solving from Nature, Dortmund Germany, H.-P.Schwefel and R.Männer (1990)
Colorni, A., Dorigo, M., Maniezzo, V.: Genetic Algorithms: A New Approach to the Time-Table Problem. NATO ASI Series, Vol. F82, Combinatorial Optimization, M.Akgül et al., Springer-Verlag, (1990)
Come, D., Fang, H-L., Mellish, C.: Solving the Modular Exam Scheduling Problem with Genetic Algorithms. DAI Research Paper No.622, Internet, (1993)
Come, D., Ross, P., Fang, H.L.: Evolutionary Timetabling: Practice, Prospects and Work in Progress. University of Edinburg, Internet, (1993)
Costa, D.: A Tabu Search Algorithm for Computing an Operational Timetable. EJOR, Vol. 76. (1994) 98–110
Even, S., Itail, A., Shamir A.: On the Complexity of Timetabling Multi Commodity Flow Problems. Siam J. Comput., Vol. 5. (1976) 691–703
Kang, L., White, G. M.: A logic Approach to the Resolution of Constraints in Timetabling. EJOR, Vol. 61. (1992) 306–317
Nachtshem, P. R.: Solving Constraint Satisfaction Problems. AI expert, (1989) 30–35
Pirlot, M.: General Local Search Methods. EJOR, Vol. 92. (1996) 493–511
Punnem, A. P., Aneja, Y. P.: A Tabu Search Algorithm for the ResourceConstrained Assignment Problem. JORS, Vol. 46. (1995) 214–220
Ross P., Come, D., Fang, H-L.: Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation. DAI Research Paper 707, Internet (1994)
Ross P., Come, D., Fang, H-L.: Successful Lecture Timetabling with Evolutionary Algorithms. University of Edinburgh, Internet (1994)
Sofianopoulou, S.: Simulated Annealing Applied to the Process Allocation Problem. EJOR, Vol. 60. (1992) 327–334
Weare, R., Burke, E., Elliman, D.: A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems. Technical Report NOTTCS-TR-95-8, Internet (1995)
Wen, U. P., Huang A. D.: A Simple Tabu Search Method to Solve the MixedInteger Linear Bilevel Programming Problem. EJOR, Vol. 88. (1996) 563–571
Wright, M.: School Timetabling Using Heuristic Search. JORS, Vol. 47. (1994) 347–357
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lassoued, B., M'Hallah, R. (1998). Daily parking of subway vehicles. In: Pasqual del Pobil, A., Mira, J., Ali, M. (eds) Tasks and Methods in Applied Artificial Intelligence. IEA/AIE 1998. Lecture Notes in Computer Science, vol 1416. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64574-8_472
Download citation
DOI: https://doi.org/10.1007/3-540-64574-8_472
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64574-0
Online ISBN: 978-3-540-69350-5
eBook Packages: Springer Book Archive